{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:41:43Z","timestamp":1778355703129,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12065-019-00302-w","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T04:27:21Z","timestamp":1571804841000},"page":"399-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel method for high-level synthesis of datapaths in digital filters using a\u00a0moth-flame optimization algorithm"],"prefix":"10.1007","volume":"13","author":[{"given":"Mohammad Reza","family":"Esmaeili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Hamid","family":"Zahiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Mohammad","family":"Razavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"issue":"4","key":"302_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MM.2017.3211105","volume":"37","author":"NS Kim","year":"2017","unstructured":"Kim NS, Xiong J, Hwu WW (2017) heterogeneous computing meets near-memory acceleration and high-level synthesis in the post-moore era. IEEE Micro 37(4):10\u201318","journal-title":"IEEE Micro"},{"issue":"3","key":"302_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/LES.2017.2774800","volume":"10","author":"C Pilato","year":"2018","unstructured":"Pilato C, Garg S, Wu K, Karri R, Regazzoni F (2018) Securing hardware accelerators: a new challenge for high-level synthesis. IEEE Embed Syst Lett 10(3):77\u201380","journal-title":"IEEE Embed Syst Lett"},{"issue":"4","key":"302_CR3","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/TCAD.2016.2597232","volume":"36","author":"A Sengupta","year":"2017","unstructured":"Sengupta A, Bhadauria S, Mohanty SP (2017) TL-HLS: methodology for low cost hardware trojan security aware scheduling with optimal loop unrolling factor during high level synthesis. IEEE Trans Comput Aided Des Integr Circuits Syst 36(4):655\u2013668","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"302_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.vlsi.2018.03.011","volume":"64","author":"A Mahapatra","year":"2019","unstructured":"Mahapatra A, Schafer BC (2019) VeriIntel2C: abstracting RTL to C maximize high-level synthesis design space exploration. Integration 64:1\u201312","journal-title":"Integration"},{"issue":"4","key":"302_CR5","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1007\/s00034-017-0609-3","volume":"37","author":"S Das","year":"2018","unstructured":"Das S, Maity R, Maity NP (2018) VLSI-based pipeline architecture for reversible image watermarking by difference expansion with high-level synthesis approach. Circuits Syst Signal Process 37(4):1575\u20131593","journal-title":"Circuits Syst Signal Process"},{"key":"302_CR6","doi-asserted-by":"crossref","unstructured":"Zhao J, Feng L, Sinha S, Zhang W, Liang Y, He B (2017) COMBA: a comprehensive model-based analysis framework for high level synthesis of real applications In: Proceedings IEEE\/ACM international conference on computer-aided design, Irvine","DOI":"10.1109\/ICCAD.2017.8203809"},{"issue":"5","key":"302_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MDAT.2018.2824121","volume":"35","author":"P Fezzardi","year":"2018","unstructured":"Fezzardi P, Pilato C, Ferrandi F (2018) Enabling automated bug detection for IP-based design using high-level synthesis. IEEE Des Test 35(5):54\u201362","journal-title":"IEEE Des Test"},{"key":"302_CR8","unstructured":"Tang X, Jiang T, Jones A, Banerjee P (2005) Behavioral synthesis of data-dominated circuits for minimal energy implementation In: Proceedings of 18th the international conference on VLSI design, 3\u20137 Jan. 2005"},{"issue":"10","key":"302_CR9","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1109\/TVLSI.2005.859482","volume":"13","author":"N Chabini","year":"2005","unstructured":"Chabini N, Wolf W (2005) Unification of scheduling, binding, and retiming to reduce power consumption under timings and resources constraints. IEEE Trans VLSI Syst 13(10):1113\u20131126","journal-title":"IEEE Trans VLSI Syst"},{"key":"302_CR10","doi-asserted-by":"crossref","unstructured":"Kumar A, Bayoumi M (1999) Multiple voltage-based scheduling methodology for low power in the high level synthesis. In: Proceedings of the international symposium on circuits and systems (ISCAS), pp 371\u2013379","DOI":"10.1109\/ISCAS.1999.777880"},{"issue":"6","key":"302_CR11","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/TVLSI.2003.819566","volume":"11","author":"AK Murugavel","year":"2003","unstructured":"Murugavel AK, Ranganathan N (2003) A game theoretic approach for power optimization during behavioral synthesis. IEEE Trans Very Large Scale Integr (VLSI) Syst 11(6):1031\u20131043","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"302_CR12","first-page":"204","volume-title":"Silicon Compilation","author":"RK Brayton","year":"1988","unstructured":"Brayton RK, Camposano R, De Micheli G, Otten R, van Eijndhoven J (1988) The Yorktown silicon compiler system. In: Gajski DD (ed) Silicon Compilation. Addison-Wesley, Reading, pp 204\u2013310"},{"key":"302_CR13","doi-asserted-by":"crossref","unstructured":"Nepomnyashchiy OV, Ryjenko IV, Shaydurov VV, Sirotinina NY, Postnikov AI (2018) The VLSI high-level synthesis for building onboard spacecraft control systems. In Anisimov K et al (eds). Proceedings of the scientific-practical conference research and development 2016. Springer, Cham, pp 229\u2013238","DOI":"10.1007\/978-3-319-62870-7_25"},{"key":"302_CR14","doi-asserted-by":"crossref","unstructured":"Mohanty SP, Velagapudi R, Kougianos E (2006) Physical-aware simulated annealing optimization of gate leakage in nanoscale datapath circuits. In: Proceedings of the conference on design, automation and test in Europe, pp 1191\u20131196, 6\u201310 March 2006","DOI":"10.1109\/DATE.2006.244046"},{"issue":"7","key":"302_CR15","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/43.31534","volume":"8","author":"S Devadas","year":"1989","unstructured":"Devadas S, Newton AR (1989) Algorithms for hardware allocation in data path synthesis. IEEE Trans Comput Aided Des Integr Circuits Syst 8(7):768\u2013781","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"302_CR16","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/43.238604","volume":"12","author":"JA Nestor","year":"1993","unstructured":"Nestor JA, Krishnamoorthy G (1993) SALSA: a new approach to scheduling with timing constraints. IEEE Trans Comput Aided Des Integr Circuits Syst 12:1107\u20131122","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"1","key":"302_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/TII.2017.2719940","volume":"14","author":"S Lucia","year":"2018","unstructured":"Lucia S, Navarro D, Lucia O, Zometa P, Findeisen R (2018) Optimized FPGA implementation of model predictive control for embedded systems using high-level synthesis tool. IEEE Tran Ind Inform 14(1):137\u2013145","journal-title":"IEEE Tran Ind Inform"},{"key":"302_CR18","volume-title":"Synthesis and Optimization of Digital Circuits","author":"G De Micheli","year":"1994","unstructured":"De Micheli G (1994) Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York"},{"key":"302_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/43.62794","volume":"10","author":"R Camposano","year":"1991","unstructured":"Camposano R (1991) Path-based scheduling for synthesis. IEEE Trans Comput Aided Des 10:85\u201393","journal-title":"IEEE Trans Comput Aided Des"},{"key":"302_CR20","volume-title":"Algorithms for VLSI design automation","author":"SH Gerez","year":"2004","unstructured":"Gerez SH (2004) Algorithms for VLSI design automation. Wiley, New York"},{"key":"302_CR21","doi-asserted-by":"crossref","unstructured":"Parker AC, Pizarro JT, Mlinar M (1986) Maha: a program for datapath synthesis. In: Proceedings of the 23rd ACM\/IEEE design automation conference, 29 June\u20132 July 1986, pp 461\u2013466","DOI":"10.1145\/318013.318087"},{"key":"302_CR22","first-page":"265","volume":"269","author":"S Bhadauria","year":"2015","unstructured":"Bhadauria S, Sengupta A (2015) Adaptive bacterial foraging driven datapath optimization: exploring power-performance tradeoff in high level synthesis. Appl Math Comput 269:265\u2013278","journal-title":"Appl Math Comput"},{"issue":"3","key":"302_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TEVC.2005.860764","volume":"10","author":"V Krishnan","year":"2006","unstructured":"Krishnan V, Katkoori S (2006) A genetic algorithm for the design space exploration of datapaths during high-level synthesis. IEEE Trans Evol Comput 10(3):213\u2013229","journal-title":"IEEE Trans Evol Comput"},{"key":"302_CR24","doi-asserted-by":"crossref","unstructured":"Sengupta A, Sedaghat R (2011) Integrated scheduling, allocation and binding in high level synthesis using multi structure Genetic Algorithm based design space exploration. In: Proceedings of the 12th international symposium on quality electronic design, pp 1\u20139, 14\u201316 March 2011","DOI":"10.1109\/ISQED.2011.5770772"},{"key":"302_CR25","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1155\/2012\/273276","volume":"2012","author":"DS Harish Ram","year":"2012","unstructured":"Harish Ram DS, Bhuvaneswari MC, Prabhu SS (2012) A novel framework for applying multiobjective GA and PSO based approaches for simultaneous area, delay, and power optimization in high level synthesis of datapaths. VLSI Des 2012:2\u20132. \n                  https:\/\/doi.org\/10.1155\/2012\/273276","journal-title":"VLSI Des"},{"issue":"4","key":"302_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2008\/930610","volume":"2008","author":"RF Abdel-kader","year":"2008","unstructured":"Abdel-kader RF (2008) Particle swarm optimization for constrained instruction scheduling. VLSI Des 2008(4):1\u20137. \n                  https:\/\/doi.org\/10.1155\/2008\/930610","journal-title":"VLSI Des"},{"key":"302_CR27","unstructured":"Hashemi SA, Nowrouzian B (2012) A novel particle swarm optimization for high-level synthesis of digital filters. In: Proceedings of the 25th IEEE international symposium on circuits and systems. pp 580\u2013583, 20\u201323 May 2012"},{"key":"302_CR28","first-page":"701","volume":"2","author":"C Pilato","year":"2010","unstructured":"Pilato C, Loiacono D, Tumeo A, Ferrandi F, Lanzi PL, Sciuto D (2010) Speeding-up expensive evaluations in high-level synthesis using solution modeling and fitness inheritance. Comput Intell Expens Optim Probl 2:701\u2013723","journal-title":"Comput Intell Expens Optim Probl"},{"key":"302_CR29","doi-asserted-by":"crossref","unstructured":"Wang G, Gong W, DeRenzi B, Kastner R (2006) Design space exploration using time and resource duality with the ant colony optimization. In: Proceedings of the 43rd ACM\/IEEE design automation conference, pp 451\u2013454, 24\u201328 July 2006","DOI":"10.1145\/1146909.1147028"},{"key":"302_CR30","unstructured":"Gopalakrishnan C, Katkoori S (2004) Tabu search based behavioral synthesis of low leakage datapaths. In: IEEE computer society annual symposium on VLSI, pp 260\u2013261, 19\u201320 Feb. 2004"},{"key":"302_CR31","volume-title":"Low-power high-level synthesis for nanoscale CMOS circuits","author":"SP Mohanty","year":"2008","unstructured":"Mohanty SP, Ranganathan N, Kougianos E, Patra P (2008) Low-power high-level synthesis for nanoscale CMOS circuits. Springer, Berlin"},{"key":"302_CR32","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 89:228\u2013249","journal-title":"Knowl Based Syst"},{"key":"302_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-1958-3","volume-title":"Application of evolutionary algorithms for multi-objective optimization in VLSI and embedded systems","author":"MC Bhuvaneswari","year":"2015","unstructured":"Bhuvaneswari MC (2015) Application of evolutionary algorithms for multi-objective optimization in VLSI and embedded systems. Springer, Berlin"},{"issue":"1","key":"302_CR34","first-page":"355","volume":"19","author":"MJ Garima","year":"2016","unstructured":"Garima MJ, Loohani H (2016) Design, implementation and performance comparison of multiplier topologies in power-delay space. Eng Sci Technol Int J 19(1):355\u2013363","journal-title":"Eng Sci Technol Int J"},{"key":"302_CR35","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.swevo.2018.08.004","volume":"44","author":"SS Choong","year":"2019","unstructured":"Choong SS, Wong LP, Lim CP (2019) An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol Comput 44:622\u2013635","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"302_CR36","doi-asserted-by":"publisher","first-page":"1950004","DOI":"10.1142\/S0218213019500040","volume":"28","author":"D Karaboga","year":"2019","unstructured":"Karaboga D, Gorkemli B (2019)\u00a0Solving traveling salesman problem by using combinatorial artificial bee colony algorithms. Int J Artif Intell Tools 28(1):1950004. \n                  https:\/\/doi.org\/10.1142\/S0218213019500040","journal-title":"Int J Artif Intell Tools"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00302-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-019-00302-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00302-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:26:12Z","timestamp":1603236372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-019-00302-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s12065-019-00302-w","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"6 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}