By Topic

Programmable 1-D rank filter of O(1) time complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pedroni, V.A. ; Dept. of Electron. Eng., Fed. Center of Technol. Educ. of Parana, Curitiba, Brazil

An efficient architecture and circuit implementation for programmable rank filtering is presented. The circuit ranks a one-dimensional signal in an amount of time independent of the number of signal values and the rank number. The operation is based on one MIN and one MAX filter, and can be efficiently implemented using winner-take-all circuits of O(1) time complexity and O(n) hardware complexity. SPICE simulations and experimental results from a fabricated CMOS chip are included

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 9 )