By Topic

Design of prototype filter of DFT filter banks with low implementation complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhi Guo Feng ; College of Mathematics and Computer Science, Chongqing Normal University, China ; Ka Fai Cedric Yiu

In this paper, we consider the design of FIR prototype filter of DFT filter banks, where the coefficients are expressed as sums of signed powers-of-two terms. The infinite precision solution can be obtained for given amplitude distortion or aliasing power. However, the finite precision solution may not be satisfied. This problem is formulated as a constrained optimization problem and can be transformed into an unconstrained integer programming problem. An efficient algorithm based on a discrete filled function is developed for solving the finite precision solution.

Published in:

2009 IEEE 13th International Symposium on Consumer Electronics

Date of Conference:

25-28 May 2009