By Topic

The minimax design of digital all-pass filters with prescribed pole radius constraint using semidefinite programming (SDP)

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
$31 $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)
Pun, C.K.S. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., China ; Chan, S.C.

This paper proposes a new method for designing digital all-pass filters with a minimax design criterion using semidefinite programming (SDP). The frequency specification is first formulated as a set of linear matrix inequalities (LMI), which is a bilinear function of the filter coefficients and the ripple to be minimized. Unlike other all-pass filter design methods, additional linear constraints can be readily incorporated. The overall design problem turns out to be a quasi-convex constrained optimization problem (solved using the SDP) and it can be solved through a series of convex optimization sub-problems and the bisection search algorithm. The convergence of the algorithm is guaranteed. Nonlinear constraints such as the pole radius constraint of the filters can also be formulated as LMI using the Rouche theorem. It was found that the pole radius constraint allows an additional tradeoff between the approximation error and the stability margin in finite wordlength implementation. The effectiveness of the proposed method is demonstrated by several design examples.

Published in:

Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on  (Volume:6 )

Date of Conference:

6-10 April 2003