Using all signed-digit representations to design single integer multipliers using subexpression elimination | IEEE Conference Publication | IEEE Xplore
Subscribe
ADVANCED SEARCH
Conferences >2004 IEEE International Sympo...

Using all signed-digit representations to design single integer multipliers using subexpression elimination

PDF
A.G. Dempster; M.D. Macleod
All Authors

Abstract:

A new algorithm is introduced for design of integer multipliers using subexpression elimination. Hartley's algorithm for subexpression elimination is applied to all possi...Show More

Metadata

Abstract:

A new algorithm is introduced for design of integer multipliers using subexpression elimination. Hartley's algorithm for subexpression elimination is applied to all possible signed-digit representations of the integer. Results are within 1% of the slow optimal exhaustive searches for 19-bit integers.
Published in: 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)
Date of Conference: 23-26 May 2004
Date Added to IEEE Xplore: 03 September 2004
Print ISBN:0-7803-8251-X
DOI: 10.1109/ISCAS.2004.1328709
Conference Location: Vancouver, BC, Canada
Contents

Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.