Lower bounds for constant multiplication problems
O Gustafsson - IEEE Transactions on Circuits and Systems II …, 2007 - ieeexplore.ieee.org
IEEE Transactions on Circuits and Systems II: Express Briefs, 2007•ieeexplore.ieee.org
… In this brief, we propose lower bounds on the number of adders required to realize the
different constant multiplication problems discussed before. While a lower bound does not
state that there is a solution that actually has an adder cost equal to the lower bound, it
states that there are no solutions with an adder cost lower than the bound. Hence, if a
heuristic is used that finds a solution with an adder cost equal to the … Furthermore, we
propose lower bounds on the number of cascaded adders. The proposed …
different constant multiplication problems discussed before. While a lower bound does not
state that there is a solution that actually has an adder cost equal to the lower bound, it
states that there are no solutions with an adder cost lower than the bound. Hence, if a
heuristic is used that finds a solution with an adder cost equal to the … Furthermore, we
propose lower bounds on the number of cascaded adders. The proposed …
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果