ILP modelling of the common subexpression sharing problem
2002 (English)In: International Conference on Electronics, Circuits, and Systems,2002, Piscataway, NJ: IEEE , 2002, 1171- p.Conference paper (Refereed)
Subexpression sharing is an important implementation issue when one data is multiplied with many constants or a sum of products is computed. By modelling the subexpression sharing problem using integer linear programming (ILP) an optimal solution can be found. Further, the model can be directly incorporated with the design of algorithms that have linear design constraints, e.g., linear-phase FIR filters. The proposed method is compared with previously reported algorithms. It produces better results than other subexpression sharing methods, even though it is still not comparable with the optimal method based on graph representation. However, the possibility to expand the ILP model beyond subexpression sharing is discussed. This would then produce identical results to the optimal adder graph method.
Place, publisher, year, edition, pages
Piscataway, NJ: IEEE , 2002. 1171- p.
National CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-34600DOI: 10.1109/ICECS.2002.1046461Local ID: 22203OAI: oai:DiVA.org:liu-34600DiVA: diva2:255448