Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays

1. Introduction
Martin Kumm

2. Background
Martin Kumm

Part I. The Pipelined Multiple Constant Multiplication Problem

3. Optimal Pipelining of Precomputed Adder Graphs
Martin Kumm

4. The Reduced Pipelined Adder Graph Algorithm
Martin Kumm

5. Optimally Solving MCM Related Problems Using Integer Linear Programming
Martin Kumm

6. A Heuristic for the Constant Matrix Multiplication Problem
Martin Kumm

Part II. FPGA Specific MCM Optimizations

7. Combining Adder Graphs with LUT-Based Constant Multipliers
Martin Kumm

8. Optimization of Hybrid Adder Graphs Containing Embedded Multipliers
Martin Kumm

9. Floating Point Multiple Constant Multiplication
Martin Kumm

10. Optimization of Adder Graphs with Ternary (3-Input) Adders
Martin Kumm

11. Conclusion and Future Work
Martin Kumm

Nyckelord: Engineering, Electrical Engineering, Computer Hardware, Appl.Mathematics/Computational Methods of Engineering