By Topic

Two-dimensional rank-order filter by using max-min sorting network

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
$33 $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

2 Author(s)
C. C. Lin ; Dept. of Electr. Eng, Nat. Chung Cheng Univ., Chiayi, Taiwan ; C. J. Kuo

Based on the previously developed sorting networks, a new VLSI architecture suitable for two-dimensional (2-D) rank-order filtering is proposed. The major advantage of the proposed architecture is their fast response time, modular architecture, and simple and regular interconnection. Generally speaking, the throughput of the proposed architecture is (N-1) times faster than using a one-dimensional rank-order filter for 2-D N×N data. The concept of block processing is also incorporated into the design to reduce the time-area complexity of the proposed architecture. Roughly speaking, the complexity is reduced to 2/3 and 1/2 compared with a rank-order and median filter without using a block processing architecture, respectively. A 3×3 median filter with block processing architecture is implemented through a 0.8 μm single-poly double-metal CMOS process. The results are correct with a clock rate up to 125 MHz

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:8 ,  Issue: 8 )