Please use this identifier to cite or link to this item:
Title: Pipelined adder graph optimization for high speed multiple constant multiplication
Authors: Kumm, Martin
Zipf, Peter
Faust, Mathias
Chang, Chip Hong
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2012
Source: Kumm, 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.
Abstract: This 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.
DOI: 10.1109/ISCAS.2012.6272072
Rights: © 2012 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Conference Papers

Citations 10

Updated on Nov 28, 2022

Page view(s) 10

Updated on Dec 1, 2022

Google ScholarTM




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