{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:46:34Z","timestamp":1759146394311},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Integration"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0167-9260(03)00050-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:40:25Z","timestamp":1062603625000},"page":"103-119","source":"Crossref","is-referenced-by-count":3,"title":["Synthesis of integer multipliers in sum of pseudoproducts form"],"prefix":"10.1016","volume":"36","author":[{"given":"Valentina","family":"Ciriani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Luccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-9260(03)00050-6_BIB1","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/12.754996","article-title":"On a new Boolean function with applications","volume":"48","author":"Luccio","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00050-6_BIB2","doi-asserted-by":"crossref","unstructured":"V. Ciriani, Synthesis of SPP three-level logic networks using affine spaces, IEEE Trans. Comput. Aided Des. (2003), to appear.","DOI":"10.1109\/TCAD.2003.818121"},{"issue":"1","key":"10.1016\/S0167-9260(03)00050-6_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/12.67320","article-title":"Absolute minimization of completely specified switching functions","volume":"40","author":"Hong","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0167-9260(03)00050-6_BIB4","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1145\/157485.165069","article-title":"ESPRESSO-SIGNATURE","volume":"1","author":"McGeer","year":"1993","journal-title":"IEEE Trans. VLSI"},{"key":"10.1016\/S0167-9260(03)00050-6_BIB5","unstructured":"O. Coudert, Doing two level logic minimization 100 times faster, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995, pp. 112\u2013121."},{"issue":"2","key":"10.1016\/S0167-9260(03)00050-6_BIB6","first-page":"157","article-title":"Logic networks with minimum number of NOR (NAND) gates for parity functions of n variables","volume":"36","author":"Lai","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00050-6_BIB7","series-title":"Representation of Discrete Functions","article-title":"Representation of logic functions using EXOR operators","author":"Sasao","year":"1996"},{"key":"10.1016\/S0167-9260(03)00050-6_BIB8","doi-asserted-by":"crossref","unstructured":"V. Ciriani, Logic minimization using exclusive or gates, Proceedings of the ACM\/IEEE 38th Design Automation Conference (DAC), 2001, pp. 115\u2013120.","DOI":"10.1145\/378239.378361"},{"key":"10.1016\/S0167-9260(03)00050-6_BIB9","doi-asserted-by":"crossref","unstructured":"A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli, Fast three-level logic minimization based on autosymmetry, Proceedings of the ACM\/IEEE 39th Design Automation Conference (DAC), (2002), 425\u2013430.","DOI":"10.1145\/513918.514027"},{"key":"10.1016\/S0167-9260(03)00050-6_BIB10","doi-asserted-by":"crossref","unstructured":"A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli, Three-level logic minimization based on function regularities, IEEE Trans. Comput. Aided Des. (2003), to appear.","DOI":"10.1109\/TCAD.2003.814950"},{"key":"10.1016\/S0167-9260(03)00050-6_BIB11","unstructured":"S. Yang, Logic synthesis and optimization benchmarks, User Guide, Microelectronic Center of North Carolina, 1991. Benchmarks available at: ftp:\/\/ftp.mcnc.org\/pub\/benchmark\/Benchmark-dirs\/LGSynth93\/."},{"issue":"2","key":"10.1016\/S0167-9260(03)00050-6_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1970.222881","article-title":"Fast multiplier","volume":"C-19","author":"Habibi","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00050-6_BIB13","series-title":"Computer Arithmetic","author":"Hwang","year":"1979"},{"issue":"2","key":"10.1016\/S0167-9260(03)00050-6_BIB14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/12.833113","article-title":"New efficient structure for a modular multiplier for RNS","volume":"49","author":"Hiasat","year":"2000","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0167-9260(03)00050-6_BIB15","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TC.2003.1190583","article-title":"Low complexity multiplication in a finite field using ring representation","volume":"52","author":"Katti","year":"2003","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/S0167-9260(03)00050-6_BIB16","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/12.736433","article-title":"New low-complexity bit-parallel finite field multipliers using weakly dual bases","volume":"47","author":"Wu","year":"1998","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/S0167-9260(03)00050-6_BIB17","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1109\/12.795222","article-title":"An effective built-in self-test scheme for parallel multipliers","volume":"48","author":"Gizopoulos","year":"1999","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-9260(03)00050-6_BIB18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The area-time complexity of binary multiplication","volume":"28","author":"Brent","year":"1981","journal-title":"J. ACM"},{"issue":"8","key":"10.1016\/S0167-9260(03)00050-6_BIB19","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/12.403712","article-title":"A new design technique for column compression multipliers","volume":"44","author":"Wang","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/S0167-9260(03)00050-6_BIB20","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/12.736430","article-title":"Technology scaling effects on multipliers","volume":"47","author":"Al-Twaijry","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00050-6_BIB21","series-title":"Principles of CMOS VLSI Design","author":"Weste","year":"1993"},{"issue":"11","key":"10.1016\/S0167-9260(03)00050-6_BIB22","first-page":"1740","article-title":"Design of low power VLSI circuits based on a novel pass-transistor logic","volume":"E81-C","author":"Song","year":"1998","journal-title":"IEICE Trans. Electron."},{"key":"10.1016\/S0167-9260(03)00050-6_BIB23","unstructured":"E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, A. Sangiovanni-Vincentelli, SIS: A system for sequential circuit synthesis, Electronics Research Laboratory, University of California, Berkeley, Technical Report UCB\/ERL M92\/41, 1992."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T09:37:04Z","timestamp":1585129024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926003000506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0167926003000506"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(03)00050-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"value":"0167-9260","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}