Soft Computing

, Volume 18, Issue 8, pp 1529–1547 | Cite as

Metaheuristic algorithms for the design of multiplier-less non-uniform filter banks based on frequency response masking

Methodologies and Application


In this paper, multiplier-less nearly perfect reconstruction tree structured non-uniform filter banks (NUFB) are proposed. When sharp transition width filter banks are to be implemented, the order of the filters and hence the complexity will become very high. The filter banks employ an iterative algorithm which adjusts the cut off frequencies of the prototype filter, to reduce the amplitude distortion. It is found that the proposed design method, in which the prototype filter is designed by the frequency response masking method, gives better results when compared to the earlier reported results, in terms of the number of multipliers when sharp transition width filter banks are needed. To reduce the complexity and power consumption for hardware realization, a design method which makes the NUFB totally multiplier-less is also proposed in this paper. The NUFB is made multiplier-less by converting the continuous filter bank coefficients to finite precision coefficients in the signed power of two space. The filter bank with finite precision coefficients may lead to performance degradation. This calls for the use of suitable optimization techniques. The classical gradient based optimization techniques cannot be deployed here, because the search space consists of only integers. In this context, meta-heuristic algorithm is a good choice as it can be tailor made to suit the problem under consideration. Thus, this design method results in near perfect NUFBs which are simple and multiplier-less and have linear phase and sharp transition width with very low aliasing. Also, different non-uniform bands can be obtained from the tree structured filter bank by rearranging the branches.


Tree structured filter banks Frequency response masking Canonic signed digit Metaheuristic optimization algorithms Genetic algorithm Differential evolution Artificial bee colony algorithm Gravitational search algorithm  Harmony search algorithm 


  1. Acampora G, Cadenas JM, Loia V, Ballester EM (2011) A multi-agent memetic system for human-based knowledge selection. IEEE Trans Syst Man Cybern Part A 41(5):946–960CrossRefGoogle Scholar
  2. Acampora G, Gaeta M, Loia V (2011) Combining multi-agent paradigm and memetic computing for personalized and adaptive learning experiences. Comput Intell 27(2):141–165CrossRefMathSciNetGoogle Scholar
  3. Acampora G, Cadenas JM (2011) Achieving memetic adaptability by means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557–569CrossRefGoogle Scholar
  4. Acampora G, Loia V, Salerno S, Vitiello A (2012) A hybrid evolutionary approach for solving the ontology alignment problem. Int J Intell Syst 27(3):189–216CrossRefGoogle Scholar
  5. Bindiya TS, Elias E (2012) Design of multiplier-less reconfigurable non-uniform channel filters using meta-heuristic algorithms. Int J Comput Appl 59(11):1–11 (published by Foundation of Computer Science, New York, USA)Google Scholar
  6. Bindiya TS, Satish Kumar V, Elias E (2012) Design of low power and low complexity multiplier-less reconfigurable non-uniform channel filter using genetic algorithm. Glob J Res Eng 12(5):7–19Google Scholar
  7. Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRefMATHGoogle Scholar
  8. Eghbali A, Johansson H, Lowenborg P (2011) Reconfigurable nonuniform transmultiplexers using uniform modulated filter banks. IEEE Trans Circuits Syst I Regul Paper 58(3):539–547 Google Scholar
  9. Fuller A, Nowrouzian B, Ashrafzadeh F (1999) 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, pp 456–469Google Scholar
  10. Geem ZW (2009) Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence series. Springer, New YorkCrossRefGoogle Scholar
  11. Hartley RI (1996) Subexpression sharing in filters using canonic signed digit multipliers. IEEE Trans Circuits Syst II 43(10):677–688CrossRefGoogle Scholar
  12. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRefGoogle Scholar
  13. Kumar A, Singh GK, Anurag S, (2013) Design of nearly perfect reconstructed non-uniform filter bank by constrained equiripple FIR technique. Appl Soft Comput 13(1):353–360. Google Scholar
  14. Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194:3902–3933CrossRefMATHGoogle Scholar
  15. Lim KK, Ong YS, Lim MH, Chen X, Agarwal A (2008) Hybrid ant colony algorithms for path planning in sparse graphs. Soft Comput 12(10):981–994CrossRefGoogle Scholar
  16. Lim YC, Yang R, Li D, Song J (1999) Signed power-of-two term allocation scheme for the design of digital filters. IEEE Trans Circuits Syst Analog Digit Signal Process II:577–584Google Scholar
  17. Lim YC, Yu YJ (2000) A successive reoptimization approach for the design of discrete coefficient perfect reconstruction lattice filter bank. In: Proceedings of the IEEE international symposium on circuits and systems, pp II-69–II-72Google Scholar
  18. Lim YC (1986) Frequency-response masking approach for the synthesis of sharp linear phase digital filters. IEEE Trans Circuits Syst CAS–33:357–364Google Scholar
  19. Manoj VJ, Elias E (2009) Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Process 89(11):2274–2285CrossRefMATHGoogle Scholar
  20. Manoj VJ, Elias E (2011) Artificial bee colony algorithm for the design of multiplierless nonuniform filter bank transmultiplexers. Inf Sci.
  21. Manuel M, Elias E (2012) Design of frequency response masking FIR filter in the Canonic Signed Digit space using modified Artificial Bee Colony algorithm. Eng Appl Artif Intell. doi: 10.1016/j.engappai.2012.02.010
  22. Ong YS, Lim MH, Neri F, Ishibuchi H (2009) Special issue on emerging trends in soft computing: memetic algorithms. Soft Comput Fusion Found Methodol Appl 13(8):739–740Google Scholar
  23. Park SY, Cho NI (2008) Design of multiplierless lattice QMF: structure and algorithm development. IEEE Trans Circuits Syst II Analog Digit Signal Process Express Briefs 55(2):173–177CrossRefMathSciNetGoogle Scholar
  24. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATHGoogle Scholar
  25. Samadi P, Ahmad M (2007) Performance analysis of genetic algorithm for the design of linear phase digital filter banks with CSD coefficients. In: Proceedings of the third IEEE international conference on natural computationGoogle Scholar
  26. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNetGoogle Scholar
  27. Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9):873–888CrossRefGoogle Scholar
  28. Vaidyanathan PP (1992) Multirate systems and filter banks. Prentice-Hall, Englewood CliffsGoogle Scholar
  29. Vaidyanathan PP, Vrcelj B (2002) Filter banks for cyclic-prefixing the nonuniform DMT system. In: Proceedings of the IEEE asilomar conference on signals, systems, and computers, Monterey, CA, vol 1, pp 816–820Google Scholar
  30. Yang XS (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm, vol 191. Springer, Heidelberg, pp 1–14Google Scholar
  31. Xu F, Chang CH, Jong CC (2007) Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common sub expressions. IEEE Trans Comput Aided Des Integr Circuits Syst 26(10):1898–1907 Google Scholar
  32. Yu YJ, Lim YC (2002) 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–276CrossRefMATHGoogle Scholar
  33. Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10):957–971CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

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

Personalised recommendations