Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations

Frequency-selective, linear FIR filters are considered, as single systems and with analysis-synthesis filter banks. They are usually designed, in the single-channel case, to fulfill tolerances in the Chebychev sense, or in near-perfect-reconstruction filter banks, to minimize a reconstruction-error measure. If hardware is limited, fixed-point coefficient quantization is needed. It causes, in general, tolerance violations or a larger reconstruction error. Discrete re-optimization may help. A recent technique, able to handle also large filter orders, is successfully applied and newly extended to filter banks. Even better are randomized strategies, introduced and examined in the mathematical-optimization community over past 15 years; especially, randomized rounding is very effective. Thereby, good results are found for both single-system and filter-bank designs. We further introduce a new random sub-set selection within th above re-optimization. Like randomized rounding, it allows a trade-off between computational effort and solution quality. Clear improvements over deterministic heuristics are obtained by both randomized algorithms.

[1]  Tanja Karp,et al.  MDFT filter banks with perfect reconstruction , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[2]  Jennifer Adams,et al.  FIR digital filters with least-squares stopbands subject to peak-gain constraints , 1991 .

[3]  Y. Lim Efficient special purpose linear programming for FIR filter design , 1983 .

[4]  Gennaro Evangelista,et al.  Design of optimum high-order finite-wordlength digital FIR filters with linear phase , 2002, Signal Process..

[5]  Anand Srivastav,et al.  Weighted Fractional and Integral K-matching in Hypergraphs , 1995, Discret. Appl. Math..

[6]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[7]  Ulrich Heute The impact of FFT coefficient errors on polyphase filter banks , 1984 .

[8]  Peter Vary,et al.  A short-time spectrum analyzer with polyphase-network and DFT , 1980 .

[9]  Andreas Antoniou,et al.  Efficient iterative design method for cosine-modulated QMF banks , 1996, IEEE Trans. Signal Process..

[10]  Jörg Kliewer Simplified design of linear-phase prototype filters for modulated filter banks , 1996, 1996 8th European Signal Processing Conference (EUSIPCO 1996).

[11]  Miki Haseyama,et al.  A filter coefficient quantization method with genetic algorithm, including simulated annealing , 2006, IEEE Signal Processing Letters.

[12]  O. Herrmann,et al.  Practical design rules for optimum finite impulse response low-pass digital filters , 1973 .

[13]  Ulrich Heute Results of a deterministic analysis of FFT coefficient errors , 1981 .

[14]  Truong Q. Nguyen Near-perfect-reconstruction pseudo-QMF banks , 1994, IEEE Trans. Signal Process..

[15]  P. P. Vaidyanathan,et al.  Cosine-modulated FIR filter banks satisfying perfect reconstruction , 1992, IEEE Trans. Signal Process..

[16]  L. Rabiner,et al.  FIR digital filter design techniques using weighted Chebyshev approximation , 1975, Proceedings of the IEEE.