A width-recursive depth-first tree search approach for the design of discrete coefficient perfect reconstruction lattice filter bank

• Published in: IEEE transactions on circuits and systems. 2, Analog and digital signal processing Vol. 50; no. 6; pp. 257 - 266
• Main Authors: Lim, Yong Ching, Yu, Ya Jun
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2003; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Filter bank; Finite impulse response filter; Frequency measurement; Frequency response; Image reconstruction; Lattices; Nonlinear filters; Quantization; Signal processing algorithms; Transversal filters
• ISSN: 1057-7130; 1558-125X
• DOI: 10.1109/TCSII.2003.812912

The lattice structure two-channel orthogonal filter bank structurally guarantees the perfect reconstruction (PR) property. Thus, it is eminently suitable for hardware realization even under severe coefficient quantization condition. Nevertheless, its frequency response is still adversely affected by coefficient quantization. In this paper, a novel recursive-in-width depth-first tree search technique is presented for the design of lattice structure PR orthogonal filter banks subject to discrete coefficient value constraint. A frequency-response deterioration measure is developed to serve as a branching criterion. At any node, the coefficient which will cause the largest deterioration in the frequency response of the filter when quantized is selected for branching. The improvement in the frequency response ripple magnitude achieved by our algorithm over that by simple rounding of coefficient values differs widely from example to example ranging from a fraction of a decibel to over 10 dB.