Lower bounds for constant multiplication problems

被引：72
|
作者：
Gustafsson, Oscar [1 ]
机构：
[1] Linkoping Univ, Dept Elect Engn, SE-58183 Linkoping, Sweden
来源：
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS | 2007年 / 54卷 / 11期
关键词：
constant multiplication; lower bound; multiplier block; multiplierless;
D O I：
10.1109/TCSII.2007.903212
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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.
引用
收藏
页码：974 / 978
页数：5
相关论文
共 50 条
12345