Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
Kenneth Steiglitz; T W Parks; James F Kaiser
|Description:||19 pages : illustrations ; 28 cm.|
|Series Title:||Princeton University.; Department of Computer Science.; Technical report|
|Responsibility:||K. Steiglitz, T.W. Parks, J.F. Kaiser.|
The resulting filter responses touch the constraint boundaries at many points, however, and are not good final designs because they do not make the best use of the degrees of freedom in the coefficients. We use the simplex algorithm for linear programming to find the best linear-phase FIR filter of minimum length, as well as to find the minimum feasible length itself. The simplex algorithm, while much slower than exchange algorithms, also allows us to incorporate more general kinds of constraints, such as constraints which force the magnitude response to be a concave function in a particular band. Very flat passband magnitude characteristics can be obtained by constraining the passband to be a concave-downward function.
We give examples that illustrate how the proposed and the usual approaches differ, and how the new approach can be used to design filters with flat passbands, filters which meet point constraints, minimum-phase filters, and bandpass filters with controlled transition band behavior."