2016 | OriginalPaper | Chapter
Optimally Solving MCM Related Problems Using Integer Linear Programming
Author : Martin Kumm
Published in: Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays
Publisher: Springer Fachmedien Wiesbaden
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this chapter, optimal methods are considered to solve the PMCM problem as well as the MCM problem with adder depth constraints (the MCMMAD and MCMBAD as defined in Section 2.4). For that we formulate the problems using integer linear programming (ILP). Of course, optimal results can only be achieved for relatively small problems, so there will be still a need for good heuristics like the RPAG algorithm presented in the last chapter.