A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity
2005 (English)In: European Conf. Circuit Theory Design,2005, Cork: IEEE , 2005, III/465- p.Conference paper (Refereed)
Multiple constant multiplication (MCM) has been an active research area for the last decade. Most work so far have only considered the number of additions to realize a number of constant multiplications with the same input. In this work, we consider the number of full and half adder cells required to realize those additions, and a novel complexity measure is proposed. The proposed complexity measure can be utilized for all types of constant operations based on shifts, additions and subtractions. Based on the proposed complexity measure a novel MCM algorithm is presented. Simulations show that compared with previous algorithms, the proposed MCM algorithm have a similar number of additions while the number of full adder cells are significantly reduced.
Place, publisher, year, edition, pages
Cork: IEEE , 2005. III/465- p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-34587Local ID: 22190OAI: oai:DiVA.org:liu-34587DiVA: diva2:255435