{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T09:49:31Z","timestamp":1744192171832,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T00:00:00Z","timestamp":1382572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00500-013-1158-8","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T12:10:47Z","timestamp":1382530247000},"page":"1529-1547","source":"Crossref","is-referenced-by-count":7,"title":["Metaheuristic algorithms for the design of multiplier-less non-uniform filter banks based on frequency response masking"],"prefix":"10.1007","volume":"18","author":[{"given":"T. S.","family":"Bindiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Elias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"issue":"5","key":"1158_CR1","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1109\/TSMCA.2011.2109376","volume":"41","author":"G Acampora","year":"2011","unstructured":"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\u2013960","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"issue":"2","key":"1158_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1111\/j.1467-8640.2010.00367.x","volume":"27","author":"G Acampora","year":"2011","unstructured":"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\u2013165","journal-title":"Comput Intell"},{"issue":"4","key":"1158_CR3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/TII.2011.2166782","volume":"7","author":"G Acampora","year":"2011","unstructured":"Acampora G, Cadenas JM (2011) Achieving memetic adaptability by means of agent-based machine learning. IEEE Trans Ind Inform 7(4):557\u2013569","journal-title":"IEEE Trans Ind Inform"},{"issue":"3","key":"1158_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/int.20517","volume":"27","author":"G Acampora","year":"2012","unstructured":"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\u2013216","journal-title":"Int J Intell Syst"},{"key":"1158_CR5","doi-asserted-by":"crossref","unstructured":"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\u201311 (published by Foundation of Computer Science, New York, USA)","DOI":"10.5120\/9589-4213"},{"key":"1158_CR6","unstructured":"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\u201319"},{"key":"1158_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"1158_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013547","DOI":"10.1109\/TCSI.2010.2072290"},{"key":"1158_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013469","DOI":"10.1109\/MWSCAS.1998.759529"},{"key":"1158_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00185-7","volume-title":"Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence series","author":"ZW Geem","year":"2009","unstructured":"Geem ZW (2009) Music-inspired harmony search algorithm: theory and applications. Studies in computational intelligence series. Springer, New York"},{"issue":"10","key":"1158_CR11","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/82.539000","volume":"43","author":"RI Hartley","year":"1996","unstructured":"Hartley RI (1996) Subexpression sharing in filters using canonic signed digit multipliers. IEEE Trans Circuits Syst II 43(10):677\u2013688","journal-title":"IEEE Trans Circuits Syst II"},{"issue":"1","key":"1158_CR12","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"key":"1158_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013360. http:\/\/dx.doi.org\/10.1016\/j.asoc.2012.08.024","DOI":"10.1016\/j.asoc.2012.08.024"},{"key":"1158_CR14","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","volume":"194","author":"KS Lee","year":"2005","unstructured":"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\u20133933","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"10","key":"1158_CR15","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1007\/s00500-007-0264-x","volume":"12","author":"KK Lim","year":"2008","unstructured":"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\u2013994","journal-title":"Soft Comput"},{"key":"1158_CR16","first-page":"577","volume":"II","author":"YC Lim","year":"1999","unstructured":"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\u2013584","journal-title":"IEEE Trans Circuits Syst Analog Digit Signal Process"},{"key":"1158_CR17","unstructured":"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\u2013II-72"},{"key":"1158_CR18","first-page":"357","volume":"CAS\u201333","author":"YC Lim","year":"1986","unstructured":"Lim YC (1986) Frequency-response masking approach for the synthesis of sharp linear phase digital filters. IEEE Trans Circuits Syst CAS\u201333:357\u2013364","journal-title":"IEEE Trans Circuits Syst"},{"issue":"11","key":"1158_CR19","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1016\/j.sigpro.2009.05.006","volume":"89","author":"VJ Manoj","year":"2009","unstructured":"Manoj VJ, Elias E (2009) Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Process 89(11):2274\u20132285","journal-title":"Signal Process"},{"key":"1158_CR20","doi-asserted-by":"crossref","unstructured":"Manoj VJ, Elias E (2011) Artificial bee colony algorithm for the design of multiplierless nonuniform filter bank transmultiplexers. Inf Sci. http:\/\/dx.doi.org\/10.1016\/j.ins.2011.02.023","DOI":"10.1016\/j.ins.2011.02.023"},{"key":"1158_CR21","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1016\/j.engappai.2012.02.010"},{"issue":"8","key":"1158_CR22","first-page":"739","volume":"13","author":"YS Ong","year":"2009","unstructured":"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\u2013740","journal-title":"Soft Comput Fusion Found Methodol Appl"},{"issue":"2","key":"1158_CR23","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TCSII.2007.910969","volume":"55","author":"SY Park","year":"2008","unstructured":"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\u2013177","journal-title":"IEEE Trans Circuits Syst II Analog Digit Signal Process Express Briefs"},{"issue":"13","key":"1158_CR24","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"1158_CR25","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/ICNC.2007.549"},{"issue":"4","key":"1158_CR26","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"issue":"9","key":"1158_CR27","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s00500-006-0139-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim MH, Ong YS (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(9):873\u2013888","journal-title":"Soft Comput"},{"key":"1158_CR28","volume-title":"Multirate systems and filter banks","author":"PP Vaidyanathan","year":"1992","unstructured":"Vaidyanathan PP (1992) Multirate systems and filter banks. Prentice-Hall, Englewood Cliffs"},{"key":"1158_CR29","unstructured":"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\u2013820"},{"key":"1158_CR30","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm, vol 191. Springer, Heidelberg, pp 1\u201314","DOI":"10.1007\/978-3-642-00185-7_1"},{"key":"1158_CR31","doi-asserted-by":"crossref","unstructured":"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\u20131907","DOI":"10.1109\/TCAD.2007.895615"},{"issue":"3","key":"1158_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00034-004-7043-z","volume":"21","author":"YJ Yu","year":"2002","unstructured":"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\u2013276","journal-title":"Circuits Syst Signal Process"},{"issue":"10","key":"1158_CR33","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00500-006-0145-8","volume":"11","author":"Z Zhou","year":"2007","unstructured":"Zhou Z, Ong YS, Lim MH, Lee BS (2007) Memetic algorithm using multi-surrogates for computationally expensive optimization problems. Soft Comput 11(10):957\u2013971","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1158-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1158-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1158-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T02:23:54Z","timestamp":1564539834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1158-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,24]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1158"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1158-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2013,10,24]]}}}