Title :
SBNR processor for stack filters
Author :
Akopian, D. ; Vainio, O. ; Agaian, S. ; Astola, J.
Author_Institution :
Signal Process. Lab., Tampere Univ. of Technol., Finland
fDate :
31 Oct-2 Nov 1994
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
Keywords :
Boolean functions; arithmetic codes; computational complexity; decoding; digital filters; nonlinear filters; signal representation; binary-weighted code; coder; decoder; minimal SBNR; minimization; mutual transformation; positive Boolean function calculation stages; processor structure; signed binary number representation; signed power-of-two terms; stack filters; time-area complexity; Boolean functions; Decoding; Digital filters; Filtering algorithms; Laboratories; Noise reduction; Nonlinear filters; Signal processing; Signal processing algorithms; Smoothing methods;
Conference_Titel :
Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-6405-3
DOI :
10.1109/ACSSC.1994.471471
