Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays

This work covers field programmable gate array (FPGA)-specific optimizations of circuits computing the multiplication of a variable by several constants, commonly denoted as multiple constant multiplication (MCM). These optimizations focus on low resource usage but high performance. They comprise th...

Full description

Bibliographic Details
Main Author: Kumm, Martin
Format: eBook
Language:English
Published: Wiesbaden Springer Fachmedien Wiesbaden 2016, 2016
Edition:1st ed. 2016
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02835nmm a2200313 u 4500
001 EB001191476
003 EBX01000000000000000863612
005 00000000000000.0
007 cr|||||||||||||||||||||
008 160511 ||| eng
020 |a 9783658133238 
100 1 |a Kumm, Martin 
245 0 0 |a Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays  |h Elektronische Ressource  |c by Martin Kumm 
250 |a 1st ed. 2016 
260 |a Wiesbaden  |b Springer Fachmedien Wiesbaden  |c 2016, 2016 
300 |a XXXIII, 206 p. 47 illus  |b online resource 
505 0 |a Heuristic and ILP-Based Optimal Solutions for the Pipelined Multiple Constant Multiplication Problem -- Methods to Integrate Embedded Multipliers, LUT-Based Constant Multipliers and Ternary (3-Input) Adders -- An Optimized Multiple Constant Multiplication Architecture Using Floating Point Arithmetic. 
653 |a Applied mathematics 
653 |a Engineering mathematics 
653 |a Electrical engineering 
653 |a Computer Hardware 
653 |a Mathematical and Computational Engineering 
653 |a Electrical Engineering 
653 |a Computer hardware 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
856 4 0 |u https://doi.org/10.1007/978-3-658-13323-8?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 621.3 
520 |a This work covers field programmable gate array (FPGA)-specific optimizations of circuits computing the multiplication of a variable by several constants, commonly denoted as multiple constant multiplication (MCM). These optimizations focus on low resource usage but high performance. They comprise the use of fast carry-chains in adder-based constant multiplications including ternary (3-input) adders as well as the integration of look-up table-based constant multipliers and embedded multipliers to get the optimal mapping to modern FPGAs. The proposed methods can be used for the efficient implementation of digital filters, discrete transforms and many other circuits in the domain of digital signal processing, communication and image processing. Contents Heuristic and ILP-Based Optimal Solutions for the Pipelined Multiple Constant Multiplication Problem Methods to Integrate Embedded Multipliers, LUT-Based Constant Multipliers and Ternary (3-Input) Adders An Optimized Multiple Constant Multiplication Architecture Using Floating Point Arithmetic Target Groups Researchers and students of electrical engineering and computer science Practitioners in the area of FPGAs and signal processing or digital arithmetic The Author Martin Kumm is working as a postdoctoral researcher at the University of Kassel. His current research interests are digital arithmetic, digital signal processing and discrete optimization, all in the context of field programmable gate arrays.