國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Multiple constant multiplication opt...

Kumm, Martin.

Multiple constant multiplication optimizations for field programmable gate arrays

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Multiple constant multiplication optimizations for field programmable gate arraysby Martin Kumm.
作者:	Kumm, Martin.
出版者:	Wiesbaden :Springer Fachmedien Wiesbaden :2016.
面頁冊數:	xxxiii, 206 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Field programmable gate arrays.
電子資源:	http://dx.doi.org/10.1007/978-3-658-13323-8
ISBN:	9783658133238$q(electronic bk.)

Multiple constant multiplication optimizations for field programmable gate arrays
Kumm, Martin.

Multiple constant multiplication optimizations for field programmable gate arrays[electronic resource] /by Martin Kumm. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - xxxiii, 206 p. :ill., digital ;24 cm.

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.

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.

ISBN: 9783658133238$q(electronic bk.)

Standard No.: 10.1007/978-3-658-13323-8doiSubjects--Topical Terms:

246658
Field programmable gate arrays.

LC Class. No.: TK7895.G36

Dewey Class. No.: 621.395

Multiple constant multiplication optimizations for field programmable gate arrays
LDR:02731nmm a2200313 a 4500 001 486710
003 DE-He213
005 20161013150552.0
006 m d
007 cr nn 008maaau
008 161116s2016 gw s 0 eng d
020 $a 9783658133238$q(electronic bk.)
020 $a 9783658133221$q(paper)
024 7 $a 10.1007/978-3-658-13323-8 $2 doi
035 $a 978-3-658-13323-8
040 $a GP $c GP
041 0 $a eng
050 4 $a TK7895.G36
072 7 $a THR $2 bicssc
072 7 $a TEC007000 $2 bisacsh
082 0 4 $a 621.395 $2 23
090 $a TK7895.G36 $b K96 2016
100 1 $a Kumm, Martin. $3 744795
245 1 0 $a Multiple constant multiplication optimizations for field programmable gate arrays $h [electronic resource] / $c by Martin Kumm.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2016.
300 $a xxxiii, 206 p. : $b ill., digital ; $c 24 cm.
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.
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.
650 0 $a Field programmable gate arrays. $3 246658
650 0 $a Mathematical optimization. $3 183292
650 1 4 $a Engineering. $3 210888
650 2 4 $a Electrical Engineering. $3 338706
650 2 4 $a Computer Hardware. $3 275482
650 2 4 $a Appl.Mathematics/Computational Methods of Engineering. $3 273758
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-13323-8
950 $a Engineering (Springer-11647)