Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Kumm, M. (2016). Optimally Solving MCM Related Problems Using Integer Linear Programming. In: Multiple Constant Multiplication Optimizations for Field Programmable Gate Arrays. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-13323-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-658-13323-8_5
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-13322-1
Online ISBN: 978-3-658-13323-8
eBook Packages: EngineeringEngineering (R0)