Monotonicity Constraint
We can constrain the positive-time part of the window to be monotonically decreasing:
| (4.77) |
In matrix form,
![]() |
or,
| (4.78) |
See Fig.3.38.
Next Section:
L-Infinity Norm of Derivative Objective
Previous Section:
Remez Exchange Algorithm




![$\displaystyle \left[\begin{array}{ccccc}
-1 & 1 & & & 0\\
& -1 & 1 & & \\
& & \ddots & \ddots & \\
0 & & & -1 & 1\end{array}\right]h$](http://www.dsprelated.com/josimages_new/sasp2/img623.png)
![\includegraphics[width=\twidth,height=6.5in]{eps/print_monotonic_chebwin}](http://www.dsprelated.com/josimages_new/sasp2/img626.png)



