DocumentCode
1191195
Title
Constant integer multiplication using minimum adders
Author
Dempster, A.G. ; Macleod, M.D.
Author_Institution
Dept. of Eng., Cambridge Univ., UK
Volume
141
Issue
5
fYear
1994
fDate
10/1/1994 12:00:00 AM
Firstpage
407
Lastpage
413
Abstract
A new method of formulating constant integer multiplication is presented. It requires fewer adders in general than a canonic signed-digit (CSD) representation. Graphs are used to illustrate multiplier implementation. A general suboptimal algorithm for the design of multipliers of any wordlength is presented. For 32-bit words, it achieves an average improvement of 26.6% over CSD. Rules for the generation of graphs with the minimum number of adders and subtracters are presented. An exhaustive search algorithm using these rules is described, and applied for word-lengths up to 12 bits. For 12-bit words, it was found that an average improvement of 16% over CSD is achievable
Keywords
adders; digital arithmetic; graph theory; multiplying circuits; 12 bit; 32 bit; constant integer multiplication; graphs; minimum adders; multiplier design; search algorithm; suboptimal algorithm; wordlength;
fLanguage
English
Journal_Title
Circuits, Devices and Systems, IEE Proceedings -
Publisher
iet
ISSN
1350-2409
Type
jour
DOI
10.1049/ip-cds:19941191
Filename
329866
Link To Document