Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)

Pacific Grove, CA, USA

Oct. 31, 1994 to Nov. 2, 1994

ISSN: 1058-6393

ISBN: 0-8186-6405-3

pp: 335-339

D. Akopian , Signal Process. Lab., Tampere Univ. of Technol., Finland

O. Vainio , Signal Process. Lab., Tampere Univ. of Technol., Finland

S. Agaian , Signal Process. Lab., Tampere Univ. of Technol., Finland

J. Astola , Signal Process. Lab., Tampere Univ. of Technol., Finland

ABSTRACT

The signed binary number representation (SBNR) is used to reduce the number of positive Boolean function (PBF) calculation stages in stack filters. The approach is based on the possibility of minimization of signed power-of-two terms in 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 algorithm and a processor structure for stack filtering based on the minimal SBNR are presented. The time-area complexity of the proposed filter is O(k), where k is the number of bits in the input signals.<>

INDEX TERMS

digital filters, nonlinear filters, Boolean functions, computational complexity, decoding, arithmetic codes, signal representation

CITATION

D. Akopian, O. Vainio, S. Agaian and J. Astola, "SBNR processor for stack filters,"

*Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC)*, Pacific Grove, CA, USA, 1995, pp. 335-339.

doi:10.1109/ACSSC.1994.471471

CITATIONS