DocumentCode
1897753
Title
Multiple constant multiplication with ternary adders
Author
Kumm, Martin ; Hardieck, Martin ; Willkomm, Jens ; Zipf, Peter ; Meyer-Baese, U.
Author_Institution
Digital Technol. Group, Univ. of Kassel, Kassel, Germany
fYear
2013
fDate
2-4 Sept. 2013
Firstpage
1
Lastpage
8
Abstract
The scaling operation, i. e., the multiplication with a single constant is a frequently used operation in many kinds of numeric algorithms. The multiple constant multiplication (MCM) is a generalization where a variable is multiplied by several constants. This kind of operation is heavily used, e. g., in digital filters or discrete transforms. It was shown in recent work that small, fast and power efficient MCM implementations can be realized by using the fast carry chains of FPGAs rather than wasting specialized embedded multipliers. However, in the work so far, only common two-input adders were used. As FPGAs today support ternary adders, i. e., adders with three inputs, this work investigates the optimization of pipelined MCM circuits which include ternary adders. It is shown experimentally that 27% less operations are needed on average by using ternary adders, resulting in 15% slice (Xilinx) and 10% ALM (Altera) reductions, respectively.
Keywords
adders; digital filters; Altera reductions; FPGA; Xilinx; digital filters; discrete transforms; fast carry chains; generalization; multiple constant multiplication; numeric algorithms; pipelined MCM circuits; scaling operation; single constant; slice; specialized embedded multipliers; ternary adders; Adders; Field programmable gate arrays; Logic gates; Pipelines; Routing; Table lookup; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications (FPL), 2013 23rd International Conference on
Conference_Location
Porto
Type
conf
DOI
10.1109/FPL.2013.6645543
Filename
6645543
Link To Document