2.5 Constrained approximation and mixed criteria  (Page 3/10)

with a corresponding derivative of

The integral cannot be carried out analytically for a general weighting function, but if the weight function is constant over each subband, Equation 47 from Least Squared Error Design of FIR Filters can be written

which after rearranging is

where the integral in the first term can now be done analytically. In matrix notation Equation 49 from Least Squared Error Design of FIR Filters is

This is a similar form to that in the multiband paper where the matrix $\mathbf{R}$ gives the effects of weighting with elements

except for the first row which should be divided by $2K$ because of the normalizing of the $a\left(0\right)$ term in Equation 49 from FIR Digital Filters and [link] and the first column which should be multiplied by $K$ because of Equation 51 from FIR Digital Filters and [link] . The matrix $\mathbf{R}$ is a sum of a Toeplitz matrix and a Hankel matrix and this fact might be used to advantage and ${\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}$ is the vector of modified filter parameters with elements

and the matrix $\mathbf{H}$ is the same as used in [link] and defined in [link] . Equations Equation 50 from Least Squared Error Design of FIR Filters and [link] can be written together as a matrix equation

The solutions to Equation 50 from Least Squared Error Design of FIR Filters and [link] or to [link] are

which are ideally suited to a language like Matlab and are implemented in the programs at the end of this book.

Since the solution of $\mathbf{R}{\mathbf{a}}_{\mathbf{u}}={\mathbf{a}}_{{\mathbf{d}}_{\mathbf{w}}}$ is the optimal unconstrained weighted least squares filter, we can write [link] and [link] in the form

The exchange algorithms

This Lagrange multiplier formulation together with applying the Kuhn-Tucker conditions are used in an iterative multiple exchange algorithm similar tothe Remez exchange algorithm to give the complete design method.

One version of this exchange algorithm applies to the problem posed by Adams with specified pass and stopband edges and with zero error weightingin the transition band. This problem has the structure of a quadratic programming problem and could be solved using general QP methods but themultiple exchange algorithm suggested here is probably faster.

The second version of this exchange algorithm applies to the problem where there is no explicitly specified transition band. This problem is notstrictly a quadratic programming problem and our exchange algorithm has no proof of convergence (the HOS algorithm also has no proof of convergence).However, in practice, this program has proven to be robust and converges for a wide variety of lengths, constraints, weights, andband edges. The performance is completely independent of the normalizing parameter $K$ . Notice that the inversion of the $\mathbf{R}$ matrix is done once and does not have to be done each iteration. The details of theprogram are included in the filter design paper and in the Matlab program at the end of this book.