Skip to main content
Log in

Theory and Design of Linear-Phase Minimax FIR Filters with Mixed Constraints in the Frequency Domain

Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

The alternation theorem is the core of efficient approximation algorithms for the minimax design of finite-impulse response (FIR) filters. In this paper, an extended alternation theorem with additional mixed constraints, i.e., equality-and-inequality constraints, is obtained. Then, an efficient multiple-exchange algorithm based on the extended theorem is presented for designing linear-phase FIR filters with frequency mixed constraints in the minimax sense. Further, convergence of the algorithm is established. Several design examples and comparisons with existing techniques are presented, and the simulation results show that the proposed algorithm is numerically more efficient and guaranteed to converge to the optimal solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Procedure 1
Algorithm 1
Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. J.W. Adams, J.L. Sullivan, Peak-constrained least-squares optimization. IEEE Trans. Signal Process. 46(2), 306–321 (1998)

    Article  Google Scholar 

  2. C.S. Burrus, J.A. Barreto, I.W. Selesnick, Iterative reweighted least-squares design of FIR filters. IEEE Trans. Signal Process. 42(11), 2926–2936 (1994)

    Article  Google Scholar 

  3. D. Goldfarb, A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27(1), 1–33 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. F. Grenez, Constrained Chebyshev approximation for FIR filters, in IEEE Int. Conf. Acoust. Speech Signal Process., Boston (1983), pp. 194–196

    Google Scholar 

  5. F. Grenez, Design of linear or minimum-phase FIR filters by constrained Chebyshev approximation. Signal Process. 5(4), 325–332 (1983)

    Article  Google Scholar 

  6. K.C. Haddad, H. Stark, N.P. Galatsanos, Constrained FIR filter design by the method of vector space projections. IEEE Trans. Circuits Syst. II 47(8), 714–724 (2000)

    Article  Google Scholar 

  7. L.J. Karam, J.H. McClellan, Complex Chebyshev approximation for FIR filter design. IEEE Trans. Circuits Syst. II 42(3), 207–216 (1995)

    Article  MATH  Google Scholar 

  8. L.J. Karam, J.H. McClellan, Chebyshev digital FIR filter design. Signal Process. 76(1), 17–36 (1999)

    Article  MATH  Google Scholar 

  9. X.P. Lai, Chebyshev design of a class of FIR filters with frequency equation constraints. Circuits Syst. Signal Process. 21(2), 181–193 (2002)

    Article  MATH  Google Scholar 

  10. X.P. Lai, Chebyshev design of FIR filters with frequency inequality constraints. Circuits Syst. Signal Process. 22(3), 325–334 (2003)

    Article  MATH  Google Scholar 

  11. X.P. Lai, Constrained Chebyshev design of a class of FIR filters using sequential unconstrained optimization techniques, in The 4th Int. Conf. Control Autom., Montreal, Canada (2003), pp. 790–793

    Google Scholar 

  12. X.P. Lai, Constrained Chebyshev design of FIR filters. IEEE Trans. Circuits Syst. II 51(3), 143–146 (2004)

    Article  Google Scholar 

  13. X.P. Lai, Projected least-squares algorithms for constrained FIR filter design. IEEE Trans. Circuits Syst. I 52(11), 2436–2443 (2005)

    Article  Google Scholar 

  14. X.P. Lai, R.J. Zhao, On Chebyshev design of linear-phase FIR filters with frequency inequality constraints. IEEE Trans. Circuits Syst. II 53(2), 120–124 (2006)

    Article  Google Scholar 

  15. Y.C. Lim, J.H. Lee, C.K. Chen, R.H. Yang, A weighted least-squares algorithm for quasi-equiripple FIR and IIR digital filter design. IEEE Trans. Signal Process. 40(3), 551–558 (1992)

    Article  Google Scholar 

  16. J.H. McClellan, T. Parks, L. Rabiner, A computer program for designing optimum FIR linear phase digital filters. IEEE Trans. Audio Electroacoust. 21(6), 506–526 (1973)

    Article  Google Scholar 

  17. G. Meinardus, Approximation of Functions: Theory and Numerical Methods (Springer, New York, 1967) (Translated by L.L. Schumaker)

    Book  MATH  Google Scholar 

  18. S. Nordebo, Z.Q. Zang, Semi-infinite linear programming: a unified approach to digital filter design with time- and frequency-domain specifications. IEEE Trans. Circuits Syst. II 46(6), 765–775 (1999)

    Article  MATH  Google Scholar 

  19. T.W. Parks, C.S. Burrus, Digital Filter Design (Wiley, New York, 1987)

    MATH  Google Scholar 

  20. S.C. Pei, P.H. Wang, Design of equiripple FIR filters with constraint using a multiple exchange algorithm. IEEE Trans. Circuits Syst. I 49(1), 113–116 (2002)

    Article  MathSciNet  Google Scholar 

  21. A.W. Potchinkov, Design of optimal linear phase FIR filters by a semi-infinite programming technique. Signal Process. 46(2), 165–180 (1997)

    Article  Google Scholar 

  22. I.W. Selesnick, C.S. Burrus, Exchange algorithms that complement the Parks–McClellan algorithm for linear-phase FIR filter design. IEEE Trans. Circuits Syst. II 44(2), 137–143 (1997)

    Article  Google Scholar 

  23. D.J. Shpak, A. Antoniou, A generalized Remez method for the design of FIR digital filters. IEEE Trans. Circuits Syst. 37(2), 161–174 (1990)

    Article  Google Scholar 

  24. D.J. Shpak, Designing FIR digital filters having exact in-band values, in The 14th Int. Conf. Digital Signal Process., Santorini, Greece (2002), pp. 281–284

    Google Scholar 

  25. K. Steiglitz, T.W. Parks, J.F. Kaiser, METEOR: a constraint-based FIR filter design program. IEEE Trans. Signal Process. 40(8), 1901–1909 (1992)

    Article  Google Scholar 

  26. H.D. Tuan, T.T. Son, H. Tuy, T. Nguyen, New linear-programming-based filter design. IEEE Trans. Circuits Syst. II 52(5), 276–281 (2005)

    Article  Google Scholar 

  27. C.C. Tseng, S.C. Pei, Design of an equiripple FIR notch filter using a multiple exchange algorithm. Signal Process. 75(3), 225–237 (1999)

    Article  MATH  Google Scholar 

  28. R.J. Zhao, X.P. Lai, Chebyshev design of linear-phase FIR filters with linear equality constraints. IEEE Trans. Circuits Syst. II 54(6), 494–498 (2007)

    Article  Google Scholar 

  29. W.P. Zhu, M.O. Ahmad, M.N.S. Swamy, Weighted least-square design of FIR filters using a fast iterative matrix inversion algorithm. IEEE Trans. Circuits Syst. I 49(11), 1620–1627 (2002)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Nature Science Foundation of China under Grants 61175001 and 60974102, in part by the National Basic Research Program of China under Grants 2012CB821200 and 2009CB320600, and in part by the Shandong Provincial Nature Science Foundation of China under Grant ZR2010FQ016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruijie Zhao.

Appendices

Appendix A: Proof of Theorem 4

Proof

The theorem is trivial if δ =0. Then, assume δ >0.

(i) The proof of necessity. Assume that α is the solution to problem (12). It is obvious that α ⊂(F e F i ). Then, α is necessarily the solution to the following problem:

(39)

where δ is given by (14).

Otherwise, there should exist some α F e satisfying

(40)

Considering α F i , we have

and then

(41)

Combining (14) and (41), we further have

(42)

According to the definition (19) of the weighting function \(\tilde{W}(\omega,\delta)\), (42) can be equivalently written as

(43)

Then it follows from (40) and (43) that

or

(44)

Equation (44) implies that α also belongs to F i , i.e., α F i , and

It is contrary to the assumption that α is the solution to problem (12). So, α is also the solution to the problem (39).

By applying Theorem 2 to the problem (39), we assert that there exist r+1 frequencies A≡{ω k ,k=0,1,…,r}⊂B such that Ω e A and E(ω,α ) satisfies

which is equivalent to the condition (13)–(14).

(ii) The proof of sufficiency. Let α F e F i and assume that there exist r+1 frequencies {ω k ,k=0,1,…,r}⊂B satisfying (13)–(14). If α is not the unique solution to the problem (12), then there would exist some α F e F i satisfying

Consequently, the following function

should have the same sign as E(ω,α ) or be equal to 0 at frequencies ω k for k=0,1,…,r. It follows that \(\tilde{E}(\omega)\) has at least r zeros (counting repeated zeros) in [0,π]. However, \(\tilde{E}(\omega)\) is a trigonometric polynomial of degree at most r−1, which means its zeros are no more than r−1 in [0,π], a contradiction. Therefore, such α does not exist and the proof is complete. □

Appendix B: Proof of Theorem 5

Proof

First, we show that {δ(l)} is a monotone increasing sequence, i.e., δ(l+1)>δ(l). From (20) and (32), and noting that b(l) and c(l) have the same sign, we obtain

or

(45)

Since δ(l+1) and A(l+1) satisfy

we have from (20) that

(46)

From (45) and (46), it is easy to see that δ(l+1)>δ(l).

Next, we show that δ is an upper bound of the sequence {δ(l)}. Suppose that δ(l)>δ for some l. Noticing that δ(l) is the weighted error norm of problem (29) and using Corollary 1, we have

(47)

where ω k (l),k=0,1,…,r are the frequency points arranged in increasing order in A(l). In addition, according to the definitions of α and δ , we have

(48)

From (47) and (48) and the assumption of δ(l)>δ , it is easy to see that

which implies that H(ω,α (l))−H(ω,α ) has at least r zeros (counting repeated zeros) in [0,π]. This is impossible because its degree is at most r−1. Therefore, δ(l)≤δ for all l.

Since the sequence {δ(l)} is bounded and monotonically increasing, then it is convergent. Let limδ(l)=δ as l→∞, and \(A^{\circ}\equiv\{\omega_{k}^{\circ},k=0,1,\dots ,r\}\) be a corresponding limit point of {A(l)}. Considering the equivalence of (16) and (18) and using Theorem 2, the optimal solution α (A ,δ ) of problem

satisfies

Then, α (A ,δ ) and A satisfy Theorem 4, i.e., the sequences {A(l)}, {δ(l)} and {α (l)} converge to A , δ and α , respectively. The proof is complete. □

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, R., Lai, X. Theory and Design of Linear-Phase Minimax FIR Filters with Mixed Constraints in the Frequency Domain. Circuits Syst Signal Process 32, 183–203 (2013). https://doi.org/10.1007/s00034-012-9441-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-012-9441-y

Keywords

Navigation