Window Design by Linear Programming

This section, based on a class project by EE graduate student Tatsuki
Kashitani, illustrates the use
of `linprog` in Matlab for designing variations on the
Chebyshev window (§3.10). In addition, some comparisons between standard
linear programming and the Remez exchange algorithm (`firpm`)
are noted.

If we can get our filter or window design problems in the form

(4.60) |

where , , is , etc., then we are done.

The ` linprog` function in Matlab Optimization Toolbox
solves LP problems. In Octave, one can use

- LP Formulation of Chebyshev Window Design
- Symmetric Window Constraint
- Positive Window-Sample Constraint
- DC Constraint
- Sidelobe Specification
- LP Standard Form
- Remez Exchange
Algorithm

- Monotonicity Constraint
- L-Infinity Norm of Derivative Objective
- L-One Norm of Derivative Objective
- Summary

[How to cite this work] [Order a printed hardcopy] [Comment on this page via email]

Copyright ©

Center for Computer Research in Music and Acoustics (CCRMA), Stanford University