论文信息 - A fast VLSI implementation of sorting algorithm for standard median filters

A fast VLSI implementation of sorting algorithm for standard median filters

A new and fast sorting algorithm and architecture for standard median filters is proposed. This algorithm is suitable for VLSI implementation with low area that results in low switching activity and no feedback loop. The main idea is to employ a so-called history matrix for fast searching the rank of the oldest (first-in) window element. We simulated the proposed algorithm using SYNOPSYS/sup TM/ and the result showed the efficiency in real time operation.

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

[2] Levent Onural,et al. Design and implementation of a general-purpose median filter unit in CMOS VLSI , 1990 .

[3] Liang-Gee Chen,et al. VLSI implementation of a selective median filter , 1996 .

[4] B I Justusson,et al. Median Filtering: Statistical Properties , 1981 .

[5] S. G. Tyan,et al. Median Filtering: Deterministic Properties , 1981 .

[6] Thompson. The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.

[7] L.-W. Chang,et al. A bit-level systolic array for median filter , 1992, IEEE Trans. Signal Process..

[8] John W. Tukey,et al. Nonlinear (nonsuperposable) methods for smoothing data , 1974 .

[9] Roberto Roncella,et al. 70-MHz 2- mu m CMOS bit-level systolic array median filter , 1993 .

[10] T. Nodes,et al. Median filters: Some modifications and their properties , 1982 .

[11] Ioannis Pitas,et al. Nonlinear Digital Filters - Principles and Applications , 1990, The Springer International Series in Engineering and Computer Science.

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