Improved heuristics for optimal parallel multiplier synthesis

Troy Townsend; Michael Liebelt

doi:10.1117/12.448852

19 November 2001 Improved heuristics for optimal parallel multiplier synthesis

Troy Townsend, Michael Liebelt

Author Affiliations +

Proceedings Volume 4593, Design, Characterization, and Packaging for MEMS and Microelectronics II; (2001) https://doi.org/10.1117/12.448852
Event: International Symposium on Microelectronics and MEMS, 2001, Adelaide, Australia

Abstract

Parallel multipliers are of increasing importance for VLSI design, largely driven by the significant increase in demand for computer graphics and digital signal processing. The fastest (and, when pipelined, most area-efficient) multiplier class is partial product reduction tree (PPRT) based multipliers. The previous best known heuristic for PPRT design (published by Stelling et al.) is capable of producing the fastest possible circuits but suffers an infeasible computational burden. This paper introduces some results which significantly reduce the search space of this heuristic. Consequently, the speed of netlist generation is increased, and the circuits generated retain optimal performance. In addition, larger optimal multipliers may be synthesised due to the easing of the computational burden.

Citation Download Citation

Troy Townsend and Michael Liebelt "Improved heuristics for optimal parallel multiplier synthesis", Proc. SPIE 4593, Design, Characterization, and Packaging for MEMS and Microelectronics II, (19 November 2001); https://doi.org/10.1117/12.448852

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE