Input compression and efficient VLSI architectures for rank order and stack filters

Adams, George B.; Coyle, Eugene; Lin, Liangchien; Lucke, L.; Parhi, Keshab K.

doi:10.1016/0165-1684(94)90159-7

Cited by 18 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sample points appearing in the filter window are compressed to or represented as the integers 1 through without changing the positions and relative ranks of the samples. Other stack filter implementations utilizing different properties of PBF have been reported in [19]- [24].…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

SBNR processor for stack filters

Akopian

Vainio

Agaian

et al. 1997

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

The signed binary number representation (SBNR) is used to reduce the number of PBF calculation stages in stack filters. The approach is based on the possibility of minimization of signed power-of-two terms in the SBNR representation of input data. A coder and a decoder for the mutual transformation of binary-weighted code and the minimal SBNR are proposed. An efficient algorithm and a processor structure for stack filtering based on the minimal SBNR are presented. The time complexity of the proposed filter is of order kT , where k is the number of bits in the input signals and T is the delay in the incorporated circuit for the positive Boolean function (PBF). A stack filtering algorithm for the generalized nonadjacent form (GNAF) of signed digit number representation (SDNR) is also presented.

show abstract

Section: Introductionmentioning

confidence: 98%

“…For further reduction of PBF calculation stages, input compression can be used before the stack filter [19]. Sample points appearing in the filter window are compressed to or represented as the integers 1 through without changing the positions and relative ranks of the samples.…”

Section: Introductionmentioning

confidence: 99%