Please use this identifier to cite or link to this item:
|Title:||A width-recursive depth-first tree search approach for the design of discrete coefficient perfect reconstruction lattice filter bank||Authors:||Lim, Y.C.
Orthogonal filter bank
Perfect reconstruction (PR)
Width-recursive depth-first tree search
|Issue Date:||Jun-2003||Citation:||Lim, Y.C., Yu, Y.J. (2003-06). A width-recursive depth-first tree search approach for the design of discrete coefficient perfect reconstruction lattice filter bank. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing 50 (6) : 257-266. ScholarBank@NUS Repository. https://doi.org/10.1109/TCSII.2003.812912||Abstract:||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.||Source Title:||IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/54853||ISSN:||10577130||DOI:||10.1109/TCSII.2003.812912|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.