A Fast VLSI Implementation of Sorting Algorithm for Standard Median Filters


for standard median filter is proposed. This algorithm is suitable for VLSI implementation with low area that results in low switching activities and no feedback loop. The main idea is to employ a noble so-called history matrix for fast searching the rank of the oldest (first-in) window element. We simulated the proposed algorithm using SYNOPSYS™ and the… (More)


6 Figures and Tables

Slides referencing similar topics