Chebyshev FIR Design via Linear Programming

We return now to the -norm minimization problem of §4.10.2:

and discuss its formulation as a

(5.47) |

where denotes the th row of the matrix . This can be expressed as

s.t. | (5.48) |

Introducing a new variable

(5.49) |

then we can write

(5.50) |

and our optimization problem can be written in more standard form:

s.t. | (5.51) |

Thus, we are minimizing a

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

[Lecture Video] [Exercises] [Examination]

Copyright ©

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