{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:56:31Z","timestamp":1782316591851,"version":"3.54.5"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T00:00:00Z","timestamp":1522972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00034-018-0811-y","type":"journal-article","created":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T17:32:16Z","timestamp":1523035936000},"page":"5127-5142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for Multiplierless Multiple Constant Multiplication in Online Arithmetic"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0913-1106","authenticated-orcid":false,"given":"Georgina Binoy","family":"Joseph","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Devanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"issue":"6","key":"811_CR1","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TCAD.2008.923242","volume":"27","author":"L Aksoy","year":"2008","unstructured":"L. Aksoy, E. Costa, P. Flores, J. Monteiro, Exact and approximate algorithms for the optimization of area and delay in multiple constant multiplications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(6), 1013\u20131026 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"811_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.micpro.2009.10.001","volume":"34","author":"L Aksoy","year":"2010","unstructured":"L. Aksoy, E. Gunes, P. Flores, Search algorithms for the multiple constant multiplications problem: exact and approximate. Elsevier J. Microprocess. Microsyst. 34(5), 151\u2013162 (2010)","journal-title":"Elsevier J. Microprocess. Microsyst."},{"key":"811_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.micpro.2011.08.009","volume":"35","author":"L Aksoy","year":"2011","unstructured":"L. Aksoy, E. Costa, P. Flores, J. Monteiro, Finding the optimal tradeoff between area and delay in multiple constant multiplications. Elsevier J. Microprocess. Microsyst. 35, 729\u2013741 (2011)","journal-title":"Elsevier J. Microprocess. Microsyst."},{"issue":"3","key":"811_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.vlsi.2011.11.008","volume":"45","author":"L Aksoy","year":"2012","unstructured":"L. Aksoy, C. Lazzari, E. Costa, P. Flores, J. Monteiro, High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications. INTEGRATION VLSI J. 45(3), 294\u2013306 (2012)","journal-title":"INTEGRATION VLSI J."},{"issue":"9","key":"811_CR5","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1109\/TCSI.2013.2244328","volume":"60","author":"F Al-Hasani","year":"2013","unstructured":"F. Al-Hasani, M.P. Hayes, A. Bainbridge-Smith, A common subexpression elimination tree algorithm. IEEE Trans. Circuits Syst.-I: Regul. Pap. 60(9), 2389\u20132400 (2013)","journal-title":"IEEE Trans. Circuits Syst.-I: Regul. Pap."},{"issue":"3","key":"811_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1049\/ip-g-2.1991.0066","volume":"138","author":"DR Bull","year":"1991","unstructured":"D.R. Bull, D.H. Horrocks, Primitive operator digital filters. IEE Proc. G Circuits Devices Syst. 138(3), 401\u2013412 (1991)","journal-title":"IEE Proc. G Circuits Devices Syst."},{"issue":"5","key":"811_CR7","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1109\/TASSP.1984.1164433","volume":"32","author":"P Cappello","year":"1984","unstructured":"P. Cappello, K. Steiglitz, Some complexity issues in digital signal processing. IEEE Trans. Acoust. Speech Signal Process. 32(5), 1037\u20131041 (1984)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"5","key":"811_CR8","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1049\/ip-cds:19941191","volume":"141","author":"AG Dempster","year":"1994","unstructured":"A.G. Dempster, M.D. Macleod, Constant integer multiplication using minimum adders. IEE Proc. Circuits Devices Syst. 141(5), 407\u2013413 (1994)","journal-title":"IEE Proc. Circuits Devices Syst."},{"issue":"9","key":"811_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/82.466647","volume":"42","author":"AG Dempster","year":"1995","unstructured":"A.G. Dempster, M.D. Macleod, Use of minimum-adder multiplier blocks in FIR digital filters. IEEE Trans. Circuits Syst.-II 42(9), 569\u2013577 (1995)","journal-title":"IEEE Trans. Circuits Syst.-II"},{"key":"811_CR10","volume-title":"Digital Arithmetic","author":"MD Ercegovac","year":"2004","unstructured":"M.D. Ercegovac, T. Lang, Digital Arithmetic (Morgan Kaufmann, San Francisco, 2004)"},{"key":"811_CR11","doi-asserted-by":"crossref","unstructured":"M. Farahani, E. Guerra, B. Colpitts, Efficient implementation of FIR filters based on a novel common subexpression elimination algorithm, in Proceedings Canadian Conference on Electrical and Computer Engineering, pp. 1\u20134 (2010)","DOI":"10.1109\/CCECE.2010.5575223"},{"key":"811_CR12","doi-asserted-by":"crossref","unstructured":"O. Gustafsson, A difference based adder graph heuristic for multiple constant multiplication problems, in Proceedings IEEE International Symposium on Circuits and Systems, pp. 1097\u20131100 (2007)","DOI":"10.1109\/ISCAS.2007.378201"},{"key":"811_CR13","doi-asserted-by":"crossref","unstructured":"K. Johansson, O. Gustafsson, A. Dempster, L. Wanhammar, Algorithm to reduce the number of shifts and additions in multiplier blocks using serial arithmetic, in Proceedings IEEE Meditteranean Electrotechnical Conference, pp. 197\u2013200 (2004)","DOI":"10.1109\/MELCON.2004.1346807"},{"issue":"7","key":"811_CR14","first-page":"1001","volume":"5","author":"K Johansson","year":"2006","unstructured":"K. Johansson, O. Gustafsson, L. Wanhammar, Multiple constant multiplication for digit-serial implementation of low power FIR filters. WSEAS Trans. Circuits Syst. 5(7), 1001\u20131008 (2006)","journal-title":"WSEAS Trans. Circuits Syst."},{"key":"811_CR15","doi-asserted-by":"crossref","unstructured":"G.B. Joseph, R. Devanathan, Radix-2h online floating point multipliers, in Proceedings 10th IEEE Dallas Circuits and Systems Conference, DCAS 14, pp. 1\u20134 (2014)","DOI":"10.1109\/DCAS.2014.6965332"},{"key":"811_CR16","unstructured":"G.B. Joseph, Architectures for online processing in reconfigurable computing. Doctoral dissertation submitted to Hindustan Institute of Technology and Science, Chennai, India (2017)"},{"key":"811_CR17","doi-asserted-by":"crossref","unstructured":"M. Kumm, K. Liebisch, P. Zipf, Reduced complexity single and multiple constant multiplication in floating point precision, in Proceedings 22nd International Conference on Field Programmable Logic and Applications, pp. 255\u2013261 (2012)","DOI":"10.1109\/FPL.2012.6339190"},{"issue":"6","key":"811_CR18","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TC.2011.97","volume":"61","author":"JV Moreno","year":"2012","unstructured":"J.V. Moreno, T. Lang, J. Hormigo, Radix-2 multioperand and multiformat streaming online addition. IEEE Trans. Comput. 61(6), 790\u2013803 (2012)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"811_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TCSI.2013.2278331","volume":"61","author":"Y Pan","year":"2014","unstructured":"Y. Pan, P.K. Meher, Bit-level optimization of adder-trees for multiple constant multiplications for efficient FIR filter implementation. IEEE Trans. Circuits Syst. I: Regul. Pap. 61(2), 455\u2013462 (2014)","journal-title":"IEEE Trans. Circuits Syst. I: Regul. Pap."},{"key":"811_CR20","doi-asserted-by":"crossref","unstructured":"K. Shi, D. Boland, G.A. Constantinides, Efficient FPGA implementation of digit parallel online arithmetic operators, in Proceedings IEEE International Conference on Field-Programmable Technology (FPT), pp. 115\u2013122 (2014)","DOI":"10.1109\/FPT.2014.7082763"},{"issue":"2","key":"811_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1240233.1240234","volume":"3","author":"Y Voronenko","year":"2007","unstructured":"Y. Voronenko, M. P\u00fcschel, Multiplierless multiple constant multiplication. ACM Trans. Algorithms 3(2), 1\u201338 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"11","key":"811_CR22","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1109\/TCSI.2004.836853","volume":"51","author":"CY Yao","year":"2004","unstructured":"C.Y. Yao, H.H. Chen, T.F. Lin, C.J. Chien, C.T. Hsu, A novel common subexpression elimination method for synthesizing fixed-point FIR filters. IEEE Trans. Circuits Systems-I Regul. Pap. 51(11), 2215\u20132221 (2004)","journal-title":"IEEE Trans. Circuits Systems-I Regul. Pap."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-018-0811-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-018-0811-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-018-0811-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T11:04:09Z","timestamp":1571051049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-018-0811-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,6]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["811"],"URL":"https:\/\/doi.org\/10.1007\/s00034-018-0811-y","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,6]]},"assertion":[{"value":"18 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}