Concepedia

Lower Bounds for Constant Multiplication Problems

Oscar Gustafsson

IEEE Transactions on Circuits & Systems II Express Briefs · 2007 · 109 citations · 30 references

DOI

Concepts

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.

References

30

Subexpression sharing in filters using canonic signed digit multipliers

Richard Hartley · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1996 · 590 citations

, , +8

Use of minimum-adder multiplier blocks in FIR digital filters

Andrew G. Dempster, M.D. Macleod · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1995 · 580 citations

, , +12

Multiplierless multiple constant multiplication

Yevgen Voronenko, Markus Püschel · ACM Transactions on Algorithms · 2007 · 428 citations

, , +10

Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

Miodrag Potkonjak, Mani Srivastava, Anantha P. Chandrakasan · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1996 · 372 citations

, , +14

Primitive operator digital filters

David Bull, D.H. Horrocks · IEE Proceedings G Circuits Devices and Systems · 1991 · 294 citations

, , +17