Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumm, Martinen
dc.contributor.authorZipf, Peteren
dc.contributor.authorFaust, Mathiasen
dc.contributor.authorChang, Chip Hongen
dc.identifier.citationKumm, M., Zipf, P., Faust, M., & Chang, C. H. (2012). Pipelined adder graph optimization for high speed multiple constant multiplication. 2012 IEEE International Symposium on Circuits and Systems, 49-52.en
dc.description.abstractThis paper addresses the direct optimization of pipelined adder graphs (PAGs) for high speed multiple constant multiplication (MCM). The optimization opportunities are described and a definition of the pipelined multiple constant multiplication (PMCM) problem is given. It is shown that the PMCM problem is a generalization of the MCM problem with limited adder depth (AD). A novel algorithm to solve the PMCM problem heuristically, called RPAG, is presented. RPAG outperforms previous methods which are based on pipelining the solutions of conventional MCM algorithms. A flexible cost evaluation is used which enables the optimization for FPGA or ASIC targets on high or low abstraction levels. Results for both technologies are given and compared with the most recent methods. Even for the special case of limited AD it is shown that RPAG often produces better results compared to the prominent Hcub algorithm with minimal total AD constraint.en
dc.rights© 2012 IEEE.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titlePipelined adder graph optimization for high speed multiple constant multiplicationen
dc.typeConference Paperen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.contributor.conferenceIEEE International Symposium on Circuits and Systems (2012 : Seoul, Korea)en
dc.contributor.researchCentre for High Performance Embedded Systemsen
item.fulltextNo Fulltext-
Appears in Collections:EEE Conference Papers

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.