{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T13:56:28Z","timestamp":1758981388649,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T00:00:00Z","timestamp":1304294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,5,2]]},"DOI":"10.1145\/1973009.1973026","type":"proceedings-article","created":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T12:48:54Z","timestamp":1304426934000},"page":"79-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Design of low-power multiple constant multiplications using low-complexity minimum depth operations"],"prefix":"10.1145","author":[{"given":"Levent","family":"Aksoy","sequence":"first","affiliation":[{"name":"INESC-ID, Lisboa, Portugal"}]},{"given":"Eduardo","family":"Costa","sequence":"additional","affiliation":[{"name":"Universidade Catolica de Pelotas, Pelotas, Brazil"}]},{"given":"Paulo","family":"Flores","sequence":"additional","affiliation":[{"name":"INESC-ID\/IST TU Lisbon, Lisboa, Portugal"}]},{"given":"Jos\u00e9","family":"Monteiro","sequence":"additional","affiliation":[{"name":"INESC-ID\/IST TU Lisbon, Lisboa, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2011,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923242"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2009.10.001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2010.32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219227"},{"key":"e_1_3_2_1_6_1","volume-title":"Some Complexity Issues in Digital Signal Processing","author":"Cappello P.","year":"1984","unstructured":"P. Cappello and K. Steiglitz . Some Complexity Issues in Digital Signal Processing . IEEE Tran. on Acoustics, Speech, and Signal Processing , 32(5):1037--1041, 1984 . P. Cappello and K. Steiglitz. Some Complexity Issues in Digital Signal Processing. IEEE Tran. on Acoustics, Speech, and Signal Processing, 32(5):1037--1041, 1984."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2009.5118233"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2002.1009836"},{"key":"e_1_3_2_1_9_1","volume-title":"Morgan Kaufmann","author":"Ercegovac M.","year":"2003","unstructured":"M. Ercegovac and T. Lang . Digital Arithmetic . Morgan Kaufmann , 2003 . M. Ercegovac and T. Lang. Digital Arithmetic. Morgan Kaufmann, 2003."},{"issue":"10","key":"e_1_3_2_1_10_1","first-page":"677","article-title":"Subexpression Sharing in Filters using Canonic Signed Digit Multipliers","volume":"43","author":"Hartley R.","year":"1996","unstructured":"R. Hartley . Subexpression Sharing in Filters using Canonic Signed Digit Multipliers . IEEE TCAS II , 43 ( 10 ): 677 -- 688 , 1996 . R. Hartley. Subexpression Sharing in Filters using Canonic Signed Digit Multipliers. IEEE TCAS II, 43(10):677--688, 1996.","journal-title":"IEEE TCAS II"},{"issue":"8","key":"e_1_3_2_1_11_1","first-page":"770","article-title":"FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders","volume":"48","author":"Kang H-J.","year":"2001","unstructured":"H-J. Kang and I-C. Park . FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders . IEEE TCAS II , 48 ( 8 ): 770 -- 777 , 2001 . H-J. Kang and I-C. Park. FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders. IEEE TCAS II, 48(8):770--777, 2001.","journal-title":"IEEE TCAS II"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.863621"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378564"},{"key":"e_1_3_2_1_14_1","unstructured":"Solving Constraint Integer Programs website. http:\/\/scip.zib.de\/.  Solving Constraint Integer Programs website. http:\/\/scip.zib.de\/."},{"key":"e_1_3_2_1_15_1","unstructured":"Spiral webpage. http:\/\/spiral.ece.cmu.edu\/mcm\/gen.html.  Spiral webpage. http:\/\/spiral.ece.cmu.edu\/mcm\/gen.html."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240234"}],"event":{"name":"GLSVLSI '11: Great Lakes Symposium on VLSI 2011","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"],"location":"Lausanne Switzerland","acronym":"GLSVLSI '11"},"container-title":["Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1973009.1973026","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1973009.1973026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:23Z","timestamp":1750243943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1973009.1973026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,2]]},"references-count":15,"alternative-id":["10.1145\/1973009.1973026","10.1145\/1973009"],"URL":"https:\/\/doi.org\/10.1145\/1973009.1973026","relation":{},"subject":[],"published":{"date-parts":[[2011,5,2]]},"assertion":[{"value":"2011-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}