Circuits, Systems, and Signal Processing

, Volume 33, Issue 3, pp 815–837 | Cite as

Modified Metaheuristic Algorithms for the Optimal Design of Multiplier-Less Non-uniform Channel Filters

Article

Abstract

Reconfigurable non-uniform channel filters are now being widely used in software define radio (SDR). The hardware implementation of these filters requires low complexity, low chip area and low power consumption. The frequency response masking (FRM) approach is proved to be a good candidate for the realization of a sharp digital finite impulse response (FIR) filter with low complexity. To reduce the complexity further, this paper gives an optimal design method which makes the channel filters totally multiplier-less. This is done in two steps. The channel filters are designed using the FRM approach with continuous filter coefficients. To obtain multiplier-less design, these filter coefficients are converted to finite-precision coefficients using signed power of two (SPT) space and the filter coefficients are synthesized in the canonic signed-digit (CSD) format. But this may lead to degradation of the filter performance. Hence the filter coefficients synthesis in the CSD format is formulated as an optimization problem. Several meta-heuristic algorithms like Differential Evolution (DE), Artificial Bee Colony (ABC), Harmony Search Algorithm (HSA) and Gravitational Search Algorithm (GSA) are modified and deployed and the best one is selected.

Keywords

Frequency response masking Canonic signed digit Metaheuristic algorithms Artificial bee colony Harmony search algorithm Gravitational search algorithm 

References

  1. 1.
    M. Bellanger, On computational complexity in digital filters, in Proc. of the European Conference on Circuit Theory and Design, Hague, Netherlands (1981), pp. 58–63 Google Scholar
  2. 2.
    T.S. Bindiya, S.V. Satish, E. Elias, Design of low power and low complexity multiplier-less reconfigurable non-uniform channel filter using genetic algorithm. Glob. J. Res. Eng. 12(6) (2012) Google Scholar
  3. 3.
    S. Boyd, L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, 2004) CrossRefMATHGoogle Scholar
  4. 4.
    D. Li, Y.C. Lim, Y. Lian, J. Song, A polynomial-time algorithm for designing FIR filters with power-of-two coefficients. IEEE Trans. Signal Process. 50(8), 1935–1941 (2002) CrossRefGoogle Scholar
  5. 5.
    A. Fuller, B. Nowrouzian, F. Ashrafzadeh, Optimization of FIR digital filters over the canonical Signed-digit coefficient space using genetic algorithms, in Proceedings of the 1998 Midwest Symposium on Circuits and Systems (1999), pp. 456–469 Google Scholar
  6. 6.
    Z.W. Geem, Music-Inspired Harmony Search Algorithm: Theory and Applications. Studies in Computational Intelligence Series (Springer, New York, 2009) CrossRefGoogle Scholar
  7. 7.
    R.I. Hartley, Subexpression sharing in filters using canonic signed digit multipliers. IEEE Trans. Circuits Syst. II 43(10), 677–688 (1996) CrossRefGoogle Scholar
  8. 8.
    D. Karaboga, B. Basturk, On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687–697 (2008) CrossRefGoogle Scholar
  9. 9.
    K.S. Lee, Z.W. Geem, A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput. Methods Appl. Mech. Eng. 194, 3902–3933 (2005) CrossRefMATHGoogle Scholar
  10. 10.
    Y.C. Lim, Frequency-response masking approach for the synthesis of sharp linear phase digital filters. IEEE Trans. Circuits Syst. 33, 357–364 (1986) CrossRefGoogle Scholar
  11. 11.
    Y.C. Lim, R. Yang, J. Song, Signed power-of-two term allocation scheme for the design of digital filters. IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. II, 577–584 (1999) Google Scholar
  12. 12.
    Y.C. Lim, Y.J. Yu, K.L. Leo, T. Saramaki, FRM-based FIR filters with optimum finite word-length performance. IEEE Trans. Signal Process. 55(6), 2914–2924 (2007) CrossRefMathSciNetGoogle Scholar
  13. 13.
    Y.C. Lim, Y. Lian, The optimum design of one- and two-dimensional FIR filters using the frequency response masking technique. IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. 40(2), 88–95 (1993) CrossRefMATHGoogle Scholar
  14. 14.
    R. Mahesh, A.P. Vinod, Reconfigurable frequency response masking filters for software radio channelization. IEEE Trans. Circuits Syst. 55-II(3), 274–278 (2008) CrossRefGoogle Scholar
  15. 15.
    R. Mahesh, A.P. Vinod, Reconfigurable low area complexity filter bank architecture based on frequency response masking for non-uniform channelization in software radio receivers. IEEE Trans. Aerosp. Electron. Syst. 47(2), 1241–1255 (2011) CrossRefGoogle Scholar
  16. 16.
    R. Mahesh, A.P. Vinod, E.M.-K. Lai, A. Omondi, Filter bank channelizers for multi-standard software defined radio receivers. J. Signal Process. Syst. 62(2), 157–171 (2011) CrossRefGoogle Scholar
  17. 17.
    V.J. Manoj, E. Elias, Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Process. 89(11), 2274–2285 (2009) CrossRefMATHGoogle Scholar
  18. 18.
    V.J. Manoj, E. Elias, Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer. Inf. Sci. (2011). doi:10.1016/j.ins.2011.02.023 Google Scholar
  19. 19.
    M. Manuel, E. Elias, Design of frequency response masking FIR filter in the canonic signed digit space using modified artificial bee colony algorithm. Eng. Appl. Artif. Intell. (2012). doi:10.1016/j.engappai.2012.02.010 Google Scholar
  20. 20.
    J. Mitola, Software Radio Architecture (Wiley, New York, 2000) CrossRefGoogle Scholar
  21. 21.
    E. Rashedi, S. Nezamabadi-Pour, S. Saryazdi, GSA: a gravitational search algorithm. Inf. Sci. 179(13), 2232–2248 (2009) CrossRefMATHGoogle Scholar
  22. 22.
    T. Saramaki, Y.C. Lim, Use of the Remez Algorithm for Designing FRM based FIR Filters. Circuits Syst. Signal Process. 22(2), 77–97 (2003). (Special issue on Frequency Response Making Technique and Its Applications). Guest-Editors: T. Saram Aki, Y. Lian Google Scholar
  23. 23.
    T. Saramaki, Y.C. Lim, Use of the Remez algorithm for designing FIR filters utilizing the frequency-response masking approach. ISCAS 3, 449–455 (1999) Google Scholar
  24. 24.
    K.G. Smitha, A.P. Vinod, A low complexity reconfigurable multi-stage channel filter architecture for resource-constrained software radio handsets. J. Signal Process. Syst. 217–231 (2011) Google Scholar
  25. 25.
    K.G. Smitha, R. Mahesh, A.P. Vinod, A reconfigurable multi-stage frequency response masking filter bank architecture for software defined radio receivers. IEEE Int. Symp. Circ. Syst. 85–88 (2008) Google Scholar
  26. 26.
    R. Storn, K. Price, Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997) CrossRefMATHMathSciNetGoogle Scholar
  27. 27.
    X.S. Yang, Harmony search as a metaheuristic algorithm. Music-inspired harmony search algorithm (2009), pp. 1–14 Google Scholar
  28. 28.
    Y.J. Yu, Y.C. Lim, A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank. Circuits Syst. Signal Process. 21(3), 263–276 (2002) CrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Electronics and Communication EngineeringNational Institute of Technology CalicutKeralaIndia

Personalised recommendations