Improved multiple constant multiplication using minimum spanning trees
2004 (English)In: Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004, Volume 1 / [ed] Michael B. Matthews, IEEE , 2004, 63-66 p.Conference paper (Other academic)
Recently, a novel technique for the multiple constant multiplication (MCM) problem using minimum spanning trees (MSTs) has been proposed. The approach works by finding simple differences between the coefficients to realize and then applying the same method to the differences (which is an MCM problem as well). Each iteration is divided into two steps. First, finding a minimum spanning tree in the graph describing the differences between the coefficients. Second, as each edge in the graph may correspond to more than one difference, one difference is selected for each edge in the MST. Generally, both these stages have multiple solutions. The aim of this work is to more closely study how the MST and the differences should be selected to give better total results. It is also discussed how the two stages in each iteration may be joined into one problem.
Place, publisher, year, edition, pages
IEEE , 2004. 63-66 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-23601DOI: 10.1109/ACSSC.2004.1399088Local ID: 3091ISBN: 0-7803-8622-1OAI: oai:DiVA.org:liu-23601DiVA: diva2:243916
The Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 7-10 November, Pacific Grove, California, USA