<< Chapter < Page | Chapter >> Page > |
The frequency-dependent FIR problem was first introduced in [link] . Following the FIR approach, one can design IIR frequency-dependent filters by merely replacing the linear weighted least squares step by a nonlinear approach, such as the quasilinearization method presented in [link] (as in the complex IIR case). This problem illustrates the flexibility in design for IRLS-based methods.
The previous sections present algorithms that are based on complex specifications; that is, the user must specify both desired magnitude and phase responses. In some cases it might be better to specify a desired magnitude response only, while allowing an algorihm to select the phase that optimally minimizes the magnitude error. Note that if an algorithm is given a phase in addition to a magnitude function, it must then make a compromise between approximating both functions. The magnitude IIR approximation problem overcomes this dilemma by posing the problem only in terms of a desired magnitude function. The algorithm would then find the optimal phase that provides the optimal magnitude approximation. A mathematical formulation follows,
A critical idea behind the magnitude approach is to allow the algorithm to find the optimum phase for a magnitude approximation. It is important to recognize that the optimal magnitude filter indeed has a complex frequency response. Atmadji Soewito [link] published in 1990 a theorem in the context of IIR design that demonstrated that the phase corresponding to an optimal magnitude approximation could be found iteratively by updating the desired phase in a complex approximation scenario. In other words, given a desired complex response one can solve a complex problem and take the resulting phase to form a new desired response from the original desired magnitude response with the new phase. That is,
where represents the original desired magnitude response and is the resulting phase from the previous iteration. This approach was independently suggested [link] by Leland Jackson and Stephen Kay in 2008.
This work introduces an algorithm to solve the magnitude IIR problem by combining the IRLS-based complex IIR algorithm from [link] with the phase updating ideas from Soewito, Jackson and Kay. The resulting algorithm is robust, efficient and flexible, allowing for different orders in the numerator and denominator as well as even or uneven sampling in frequency space, plus the optional use of specified transition bands. A block diagram for this method is presented in [link] .
The overall IIR magnitude procedure can be summarized as follows,
Figures [link] through [link] illustrate the effectiveness of this algorithm at each of the three different stages for length-5 filters and , with transition edge frequencies of 0.2 and 0.24 (in normalized frequency) and . A linear transition band was specified. Figures [link] , [link] and [link] show the equation error , solution error and solution error . [link] shows a comparison of the magnitude error functions for the solution error and designs. [link] shows the phase responses for the three designs.
From Figures [link] and [link] one can see that the algorithm has changed the phase response in a way that makes the maximum magnitude error (located in the stopband edge frequency) to be reduced by approximately half its value. Furthermore, [link] demonstrates that one can reach quasiequiripple behavior with relatively low values of (for the examples shown, was set to 30).
Notification Switch
Would you like to follow the 'Iterative design of l_p digital filters' conversation and receive update notifications?