Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays
Authors: Kumm, Martin
Free Preview- Technical Study
Buy this book
- About this book
-
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.
- About the authors
-
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.
- Table of contents (11 chapters)
-
-
Introduction
Pages 1-7
-
Background
Pages 9-35
-
Optimal Pipelining of Precomputed Adder Graphs
Pages 39-51
-
The Reduced Pipelined Adder Graph Algorithm
Pages 53-85
-
Optimally Solving MCM Related Problems Using Integer Linear Programming
Pages 87-111
-
Table of contents (11 chapters)
Buy this book
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays
- Authors
-
- Martin Kumm
- Copyright
- 2016
- Publisher
- Springer Vieweg
- Copyright Holder
- Springer Fachmedien Wiesbaden
- eBook ISBN
- 978-3-658-13323-8
- DOI
- 10.1007/978-3-658-13323-8
- Softcover ISBN
- 978-3-658-13322-1
- Edition Number
- 1
- Number of Pages
- XXXIII, 206
- Number of Illustrations
- 47 b/w illustrations
- Topics
