Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

The design of constrained minimax FIR digital filters using quadratic programming

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Sullivan, J.L. ; Dept. of Electr. & Comput. Eng., California State Univ., Northridge, CA, USA ; Adams, J.W. ; Roosta, R.

We (see Adams et al., ibid., p.314, 1994) presented in an earlier article a new quadratic programming algorithm that can design constrained least-squares FIR digital filters. In this article we present a new quadratic programming algorithm for designing constrained minimax FIR filters. The new algorithm is better than the Parks-McClellan (1973) algorithm because it can design a much wider variety of filters. In particular, it can do minimax optimization subject to arbitrary equality and inequality constraints.

Published in:

Signals, Systems and Computers, 1995. 1995 Conference Record of the Twenty-Ninth Asilomar Conference on  (Volume:2 )

Date of Conference:

Oct. 30 1995-Nov. 1 1995