{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:15Z","timestamp":1750308735836,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-0925873"],"award-info":[{"award-number":["ECCS-0925873"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2012,10]]},"abstract":"<jats:p>This article presents a joint framework for quantization and Multiple Constant Multiplication (MCM) optimization, which yields a computationally efficient implementation of multiplierless multiplication in hardware and software. Frameworks of this nature have been developed in the context of Finite Impulse Response (FIR) filters, where frequency response specifications are used to drive the design. In this work, we look at a general case, considering as given a vector of ideal, real constants, which may come from any application and do not necessarily represent FIR filter coefficients. We first formulate a joint optimization problem for finding a fixed-point vector and a shift-add network that are optimal in terms of quantization error and MCM complexity. We then describe ways to finitize and prune the search space, leading to an efficient algorithm called JOINT_SOLVE that solves the problem. Finally, via extensive randomized experiments, we show that our joint framework is notably more computationally efficient than a disjointed one, reducing the MCM cost by 15%--60% on moderate size problems.<\/jats:p>","DOI":"10.1145\/2348839.2348846","type":"journal-article","created":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T13:48:27Z","timestamp":1350568107000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Jointly Optimizing Quantization and Multiple Constant Multiplication"],"prefix":"10.1145","volume":"17","author":[{"given":"Matthew B.","family":"Gately","sequence":"first","affiliation":[{"name":"University of Oklahoma"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark B.","family":"Yeary","sequence":"additional","affiliation":[{"name":"University of Oklahoma"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Choon Yik","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Oklahoma"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2009.10.001"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071356.2071359"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2008.917997"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1984.1164433"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1088\/1464-4258\/11\/7\/075102"},{"volume":"5","volume-title":"Proceedings of the IEEE International Symposium Circuits Systems.","author":"Dempster A.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/82.466647"},{"key":"e_1_2_1_8_1","unstructured":"Franklin G. F. Powell J. D. and Workman M. L. 1997. Digital Control of Dynamic Systems 3rd Ed. Addison-Wesley. Franklin G. F. Powell J. D. and Workman M. L. 1997. Digital Control of Dynamic Systems 3rd Ed. Addison-Wesley."},{"volume-title":"Proceedings of the IEEE International Conference on Acoustics Speech Signal Processing. 4368--4371","author":"Gately M. B.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Goldsmith A. 2005. Wireless Communications. Cambridge University Press. Goldsmith A. 2005. Wireless Communications . Cambridge University Press.","DOI":"10.1017\/CBO9780511841224"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Gross J. L. and Yellen J. Eds. 2004. Handbook of Graph Theory. Discrete Mathematics and Its Applications. CRC Press. Gross J. L. and Yellen J. Eds. 2004. Handbook of Graph Theory . Discrete Mathematics and Its Applications. CRC Press.","DOI":"10.1201\/9781420057140"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2007.378201"},{"key":"e_1_2_1_13_1","first-page":"974","article-title":"Lower bounds for constant multiplication problems","volume":"11","author":"Gustafsson O.","year":"2007","journal-title":"IEEE Trans. Circ. Syst. II, Exp. Briefs54"},{"key":"e_1_2_1_14_1","unstructured":"Intel. 2011. Intel\u00ae Xeon\u00ae processor E5405 (12M cache 2.00 GHz 1333 MHz FSB)with SPEC code(s) SLAP2 SLBBP. http:\/\/ark.intel.com\/Product.aspx?id=33079 (Last accessed 3\/11). Intel . 2011. Intel\u00ae Xeon\u00ae processor E5405 (12M cache 2.00 GHz 1333 MHz FSB)with SPEC code(s) SLAP2 SLBBP. http:\/\/ark.intel.com\/Product.aspx?id=33079 (Last accessed 3\/11)."},{"volume-title":"Proceedings of the IEEE International Conference on Electronic Circuits Systems. 713--716","author":"Johansson K.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1843565.1843729"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/82.959867"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds:20060201"},{"volume-title":"R2011b Documentation: Signal processing toolbox. http:\/\/www.mathworks.com\/help\/toolbox\/signal\/ref\/firpm.html (Last accessed 11\/11)","year":"2011","author":"MathWorks","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1973.1162525"},{"key":"e_1_2_1_21_1","unstructured":"Mitra S. K. 2010. Digital Signal Processing: A Computer-Based Approach 4th Ed. McGraw-Hill Higher Education. Mitra S. K. 2010. Digital Signal Processing: A Computer-Based Approach 4th Ed. McGraw-Hill Higher Education."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/196244.196343"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.486662"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2055290"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.826172"},{"key":"e_1_2_1_26_1","unstructured":"Voronenko Y. 2009. SPIRAL multiplier block generator. http:\/\/spiral.ece.cmu.edu\/mcm\/gen.html (Last accessed 10\/10). Voronenko Y. 2009. SPIRAL multiplier block generator. http:\/\/spiral.ece.cmu.edu\/mcm\/gen.html (Last accessed 10\/10)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240234"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2011.2158265"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.895615"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2006.880255"},{"volume":"2","volume-title":"Proceedings of the IEEE International Symposium Circuits Systems.","author":"Yli-Kaakinen J.","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.904599"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2348839.2348846","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2348839.2348846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:02Z","timestamp":1750278122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2348839.2348846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["10.1145\/2348839.2348846"],"URL":"https:\/\/doi.org\/10.1145\/2348839.2348846","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2012,10]]},"assertion":[{"value":"2011-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}