Sorting network based architectures for median filters

Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed architectures are highly pipelined and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs and also by using Batcher's odd-even merge sort (instead of bubble-sort). The latency of these networks is reduced by building them with sorting units that sort 2 elements (sort-2) as well as 3 elements (sort-3) in 1 time unit. >

[1]  Jenq-Neng Hwang,et al.  Systolic architecture for 2-D rank order filtering , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.

[2]  Allan L. Fisher.  Systolic Algorithms for Running Order Statistics in Signal and Image Processing , 1981 .

[3]  Keshab K. Parhi,et al.  Parallel structures for rank order and stack filters , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  C. Chakrabarti.  High sample rate array architectures for median filters , 1994, IEEE Trans. Signal Process..

[5]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[6]  Chaitali Chakrabarti,et al.  Median filter architecture based on sorting networks , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[7]  Dana S. Richards,et al.  VLSI median filters , 1990, IEEE Trans. Acoust. Speech Signal Process..

[8]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[9]  Kemal Oflazer.  Design and implementation of a single-chip 1-D median filter , 1983 .

[10]  Charles G. Boncelet,et al.  Recursive algorithms and VLSI implementations for median filtering , 1988, 1988., IEEE International Symposium on Circuits and Systems.