DocumentCode :
942574
Title :
Lower Bounds for Constant Multiplication Problems
Author :
Gustafsson, Oscar
Author_Institution :
Linkoping Univ., Linkoping
Volume :
54
Issue :
11
fYear :
2007
Firstpage :
974
Lastpage :
978
Abstract :
Lower bounds for problems related to realizing multiplication by constants with shifts, adders, and subtracters are presented. These lower bounds are straightforwardly calculated and have applications in proving the optimality of solutions obtained by heuristics.
Keywords :
adders; digital arithmetic; multiplying circuits; adders; constant multiplication problems; lower bounds; subtracters; Constant multiplication; lower bound; multiplier block; multiplierless;
fLanguage :
English
Journal_Title :
Circuits and Systems II: Express Briefs, IEEE Transactions on
Publisher :
ieee
ISSN :
1549-7747
Type :
jour
DOI :
10.1109/TCSII.2007.903212
Filename :
4358616
Link To Document :
بازگشت