Multiplication by two integers using the minimum number of adders
Authors:
- A.G. DempsterADA.G. Dempster
- Malcolm D. MacleodMMMalcolm D. Macleod
- 27 July 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1814-1817
Abstract
2 QinetiQ Ltd, St Andrews Road, Malvern, Worcs, WR14 3PL, mdmacleod@iee.org Abstract - The two-coefficient minimum-adder graph (MAG2) algorithm is described and shown to be optimal. A partial implementation, optimal for pairs of integers up to 8 bits, outperforms the best existing algorithms.Keywords
This publication has 13 references indexed in Scilit:
- Generation of Signed-Digit Representations for Integer MultiplicationIEEE Signal Processing Letters, 2004
- Digital filter design using subexpression elimination and all signed-digit representations2004
- Using all signed-digit representations to design single integer multipliers using subexpression elimination2004
- Design guidelines for reconfigurable multiplier blocks2003
- Digital filter synthesis based on an algorithm to generate all minimal signed digit representationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Graphical Design Techniques for Fixed-point MultiplicationVLSI Design, 2000
- Subexpression sharing in filters using canonic signed digit multipliersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1996
- General algorithms for reduced-adder integermultiplier designElectronics Letters, 1995
- Use of minimum-adder multiplier blocks in FIR digital filtersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1995
- Primitive operator digital filtersIEE Proceedings G Circuits, Devices and Systems, 1991