Pipelined adder graph optimization for high speed multiple constant multiplication

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 prob...

Full description

Saved in:
Bibliographic Details
Main Authors: Kumm, Martin, Zipf, Peter, Faust, Mathias, Chang, Chip Hong
Other Authors: School of Electrical and Electronic Engineering
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/103747
http://hdl.handle.net/10220/16910
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-103747
record_format dspace
spelling sg-ntu-dr.10356-1037472020-03-07T13:24:51Z Pipelined adder graph optimization for high speed multiple constant multiplication Kumm, Martin Zipf, Peter Faust, Mathias Chang, Chip Hong School of Electrical and Electronic Engineering IEEE International Symposium on Circuits and Systems (2012 : Seoul, Korea) Centre for High Performance Embedded Systems DRNTU::Engineering::Electrical and electronic engineering 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. 2013-10-25T04:00:35Z 2019-12-06T21:19:17Z 2013-10-25T04:00:35Z 2019-12-06T21:19:17Z 2012 2012 Conference Paper 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. https://hdl.handle.net/10356/103747 http://hdl.handle.net/10220/16910 10.1109/ISCAS.2012.6272072 en © 2012 IEEE.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Kumm, Martin
Zipf, Peter
Faust, Mathias
Chang, Chip Hong
Pipelined adder graph optimization for high speed multiple constant multiplication
description 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.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Kumm, Martin
Zipf, Peter
Faust, Mathias
Chang, Chip Hong
format Conference or Workshop Item
author Kumm, Martin
Zipf, Peter
Faust, Mathias
Chang, Chip Hong
author_sort Kumm, Martin
title Pipelined adder graph optimization for high speed multiple constant multiplication
title_short Pipelined adder graph optimization for high speed multiple constant multiplication
title_full Pipelined adder graph optimization for high speed multiple constant multiplication
title_fullStr Pipelined adder graph optimization for high speed multiple constant multiplication
title_full_unstemmed Pipelined adder graph optimization for high speed multiple constant multiplication
title_sort pipelined adder graph optimization for high speed multiple constant multiplication
publishDate 2013
url https://hdl.handle.net/10356/103747
http://hdl.handle.net/10220/16910
_version_ 1681048275763855360