FIR variable digital filter with signed power-of-two coefficients

Dam, Hai and Cantoni, Antonio and Teo, Kok Lay and Nordholm, Sven. 2007. FIR variable digital filter with signed power-of-two coefficients. IEEE Transactions on Circuits and Systems I: Regular Papers. 54 (6): pp. 1348-1357.

Source Title

IEEE Transactions on Circuits and Systems I: Regular Papers

DOI

10.1109/TCSI.2007.897775

ISSN

15498328

Faculty

Faculty of Science and Engineering

Western Australian Telecommunications Research Institute 'WATRI' (Research Institute)

School

Western Australian Telecommunications Research Institute (Research Institute)

Remarks

Copyright © 2007 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI

http://hdl.handle.net/20.500.11937/5092

Collection

Curtin Research Publications

Abstract

Variable digital filters (VDFs) are useful for various signal processing and communication applications where the frequency characteristics, such as fractional delays and cutoff frequencies, can be varied online. In this paper, we investigate the design of VDFs with discrete coefficients as a means of achieving low complexity and efficient hardware implementation. The filter coefficients are expressed as the sum of signed power-of-two terms with a restriction on the total number of power-of-two for the filter coefficients. An efficient design procedure is proposed that includes an improved method for handling the quantization of the VDF coefficients for both the min-max and the least-square criteria leading to an optimum quantized solution. For the least-square criterion, a reduced search region around the optimum quantized solution is further constructed and the branch and bound method in conjunction with an efficient branch cutting scheme is presented to search for an optimum solution in this reduced region.