Processors for generalized stack filters
David Akopian, Olli Vainio, Sos С. Agaian, Jaakko T. Astola · IEEE Transactions on Signal Processing · 1995
New processor structures for generalized stack filters are proposed. They can be implemented using different numbers of Boolean function units. The class of pipeline-parallel structures for generalized stack filters is simple and modular in structure, and suitable for VLSI implementation. Coder and decoder networks are developed for the mutual transform of binary-weighted and unary-weighted codes as the thresholding and addition units of the processors. The area time complexity A/spl middot/T of the proposed filters is O(k/sup 3/) due to the feedback, instead of O(2/sup k/) for the threshold decomposition structure, where k is the number of bits for sample representation.>