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...
Saved in:
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 |
Similar Items
-
Optimization of structural adders in fixed coefficient transposed direct form FIR filters
by: Faust, Mathias, et al.
Published: (2009) -
High speed multiple output adders
by: Wei, Lai
Published: (2014) -
Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications
by: Xu, Fei, et al.
Published: (2010) -
Speed and energy optimized quasi-delay-insensitive block carry lookahead adder
by: Mastorakis, N. E., et al.
Published: (2019) -
High-speed and energy-efficient carry look-ahead adder
by: Balasubramanian, Padmanabhan, et al.
Published: (2022)