Please use this identifier to cite or link to this item:
|Title:||Successive reoptimization approach for the design of discrete coefficient perfect reconstruction lattice filter bank||Authors:||Lim, Y.C.
Yu, Ya Jun
|Issue Date:||2000||Citation:||Lim, Y.C.,Yu, Ya Jun (2000). Successive reoptimization approach for the design of discrete coefficient perfect reconstruction lattice filter bank. Proceedings - IEEE International Symposium on Circuits and Systems 2 : II-69. ScholarBank@NUS Repository.||Abstract:||The lattice structure quadrature mirror filter (QMF) 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 technique is presented for the design of lattice structure PRQMF banks subject to discrete coefficient value constraints. In our technique, the coefficient values are quantized sequentially one at a time. After each coefficient is being quantized, the remaining unquantized coefficient values are reoptimized to partially compensate for the frequency response deviation caused by the quantization of that coefficient value. The order of selection of the coefficients for quantization is based on a coefficient sensitivity measure. Coefficients with higher sensitivity measures are quantized earlier than coefficients with lower sensitivity measures. 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 dB to over 10dB.||Source Title:||Proceedings - IEEE International Symposium on Circuits and Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/72953||ISSN:||02714310|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.