By Topic

Complex approximation with additional constraints

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

1 Author(s)
Schulist, M. ; Lehrstuhl fuer Nachrichtentechnik, Erlangen-Nurnberg Univ.

A powerful signal exchange algorithm for the solution of the complex Chebyshev approximation problem was introduced by P.T.P. Tang (1988). It was picked up and modified by A. Alkhairy et al. (1991) for the design of digital FIR filters. This algorithm is extended to solve the approximation problem in conjunction with additional constraints, such as constraints on the filter coefficients, constraints on the magnitude response and/or its derivatives or constraints on the group delay. Since the algorithm deals with a linear optimization problem all constraints have to be linear with respect to the filter coefficients. This linearization, the integration into the complex approximation problem, and the algorithm are shown. An example demonstrating results obtained with the modified algorithm is given

Published in:

Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on  (Volume:5 )

Date of Conference:

23-26 Mar 1992