{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:47:52Z","timestamp":1776955672806,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018,8,1]]},"DOI":"10.1109\/tc.2018.2795611","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T19:35:05Z","timestamp":1516304105000},"page":"1078-1091","source":"Crossref","is-referenced-by-count":38,"title":["Advanced Compressor Tree Synthesis for FPGAs"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8593-3138","authenticated-orcid":false,"given":"Martin","family":"Kumm","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Kappauf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224207"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.1993.397168"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272301"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2068716.2068725"},{"key":"ref14","first-page":"171","article-title":"Efficient high speed compression trees on Xilinx FPGAs","author":"kumm","year":"2014","journal-title":"Methoden und Beschreibungssprachen zur Modellierung und Verikation von Schaltungen und Systemen"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2014.6927468"},{"key":"ref16","first-page":"1","article-title":"Generic and universal parallel matrix summation with a flexible\n compression goal for Xilinx FPGAs","author":"preu\u00dfer","year":"2017","journal-title":"Proc Int Conf Field Programmable Logic Appl"},{"key":"ref17","first-page":"207","article-title":"Efficient implementation of carry-save adders in FPGAs","author":"ortiz","year":"2009","journal-title":"Proc IEEE Int Conf Appl -Specific Syst Archit Processors"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2009.5377679"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.168"},{"key":"ref28","article-title":"The SCIP Optimization Suite 5.0","author":"gleixner","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/12.910813"},{"key":"ref27","year":"2017"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1109\/43.845087","article-title":"A practical approach to the synthesis of arithmetic circuits using carry-save-adders","volume":"19","author":"kim","year":"2000","journal-title":"IEEE Trans Comput -Aided Des Integr Circuits Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263830"},{"key":"ref29","article-title":"Scalable Linear Programming (ScaLP)\n Project Website","author":"kumm","year":"2017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382683"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2008.4483927"},{"key":"ref7","first-page":"349","article-title":"Some schemes for parallel multipliers","volume":"45","author":"dadda","year":"1965","journal-title":"Alta Frequenza"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.1997.626121"},{"key":"ref9","first-page":"1256","article-title":"Improving\n synthesis of compressor trees on FPGAs via integer linear programming","author":"parandeh-afshar","year":"2008","journal-title":"Proc Des Autom Test Eur"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675482"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E96.A.2553"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645544"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2011.5993639"},{"key":"ref24","author":"ercegovac","year":"2004","journal-title":"Digital Arithmetic"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2011.44"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645543"},{"key":"ref25","article-title":"FloPoCo Project Website","author":"de dinechin","year":"2017"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8408570\/08263391.pdf?arnumber=8263391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:02Z","timestamp":1642004582000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8263391\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"references-count":29,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2795611","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,1]]}}}