Skip to main content
Erschienen in: Soft Computing 8/2014

01.08.2014 | Methodologies and Application

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

verfasst von: T. S. Bindiya, Elizabeth Elias

Erschienen in: Soft Computing | Ausgabe 8/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat 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–960CrossRef 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–960CrossRef
Zurück zum Zitat 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–165CrossRefMathSciNet 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–165CrossRefMathSciNet
Zurück zum Zitat Acampora G, Cadenas JM (2011) Achieving memetic adaptability by means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557–569CrossRef Acampora G, Cadenas JM (2011) Achieving memetic adaptability by means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557–569CrossRef
Zurück zum Zitat 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–216CrossRef 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–216CrossRef
Zurück zum Zitat 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) 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)
Zurück zum Zitat 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–19 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–19
Zurück zum Zitat Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRefMATH Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeCrossRefMATH
Zurück zum Zitat 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 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
Zurück zum Zitat 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–469 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–469
Zurück zum Zitat Geem ZW (2009) Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence series. Springer, New YorkCrossRef Geem ZW (2009) Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence series. Springer, New YorkCrossRef
Zurück zum Zitat Hartley RI (1996) Subexpression sharing in filters using canonic signed digit multipliers. IEEE Trans Circuits Syst II 43(10):677–688CrossRef Hartley RI (1996) Subexpression sharing in filters using canonic signed digit multipliers. IEEE Trans Circuits Syst II 43(10):677–688CrossRef
Zurück zum Zitat Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRef Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRef
Zurück zum Zitat 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–3933CrossRefMATH 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–3933CrossRefMATH
Zurück zum Zitat 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–994CrossRef 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–994CrossRef
Zurück zum Zitat 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–584 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–584
Zurück zum Zitat 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-72 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-72
Zurück zum Zitat Lim YC (1986) Frequency-response masking approach for the synthesis of sharp linear phase digital filters. IEEE Trans Circuits Syst CAS–33:357–364 Lim YC (1986) Frequency-response masking approach for the synthesis of sharp linear phase digital filters. IEEE Trans Circuits Syst CAS–33:357–364
Zurück zum Zitat Manoj VJ, Elias E (2009) Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Process 89(11):2274–2285CrossRefMATH Manoj VJ, Elias E (2009) Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Process 89(11):2274–2285CrossRefMATH
Zurück zum Zitat 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–740 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–740
Zurück zum Zitat 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–177CrossRefMathSciNet 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–177CrossRefMathSciNet
Zurück zum Zitat Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH
Zurück zum Zitat 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 computation 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 computation
Zurück zum Zitat Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNet Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359CrossRefMATHMathSciNet
Zurück zum Zitat Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9):873–888CrossRef Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9):873–888CrossRef
Zurück zum Zitat Vaidyanathan PP (1992) Multirate systems and filter banks. Prentice-Hall, Englewood Cliffs Vaidyanathan PP (1992) Multirate systems and filter banks. Prentice-Hall, Englewood Cliffs
Zurück zum Zitat 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–820 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–820
Zurück zum Zitat Yang XS (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm, vol 191. Springer, Heidelberg, pp 1–14 Yang XS (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm, vol 191. Springer, Heidelberg, pp 1–14
Zurück zum Zitat 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 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
Zurück zum Zitat 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–276CrossRefMATH 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–276CrossRefMATH
Zurück zum Zitat Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10):957–971CrossRef Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10):957–971CrossRef
Metadaten
Titel
Metaheuristic algorithms for the design of multiplier-less non-uniform filter banks based on frequency response masking
verfasst von
T. S. Bindiya
Elizabeth Elias
Publikationsdatum
01.08.2014
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 8/2014
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-013-1158-8

Weitere Artikel der Ausgabe 8/2014

Soft Computing 8/2014 Zur Ausgabe