Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays

Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays

Kumm, Martin

Paperback

Technology & EngineeringGeneral ComputersGeneral Mathematics

ISBN10: 3658133228
ISBN13: 9783658133221
Publisher: Springer Nature
Published: Apr 22 2016
Pages: 206
Weight: 0.71
Height: 0.55 Width: 5.83 Depth: 8.27
Language: English
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.

Also in

Technology & Engineering

View All