A 16-bit x 16-bit 1.2 p CMOS Multiplier with Low Latency Vector Merging

Wayne Amendola, Hosahalli R. Srinivas, Keshab E. Parhi

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

This paper presents the VLSI architecture and implementation of a 16 x 16-bit, bit-level pipelined, two’s-complement binary array multiplier. This multiplier architecture employs signed-digit radix 2 carry free adders to perform multiplication. A fast conversion scheme for converting the final product, available from the multiplier array, in radix 2 signed-digit form to two’s-complement binary form is employed to reduce the latency of the multiplier. Furthermore, it results in savings in area in the form of reduced number of pipelining registers and half adders required for conversion, also called vector merging. This pipelined multiplier uses positive edge triggered registers and employs a single phase clocking scheme. It has been fabricated and tested to perform correctly at 50MHz clock frequency for a supply voltage of 3.0V. It may be noted that the speed of this multiplier is limited by 1 binary adder cell time and our test equipment imposed a limit of 50MHz.

Original languageEnglish (US)
Pages (from-to)398-402
Number of pages5
JournalProceedings of the IEEE International Conference on VLSI Design
DOIs
StatePublished - 1995
Externally publishedYes
EventProceedings of the 8th International Conference on VLSI Design - New Delhi, India
Duration: Jan 4 1995Jan 7 1995

Bibliographical note

Publisher Copyright:
© 1995 IEEE Computer Society. All rights reserved.

Fingerprint

Dive into the research topics of 'A 16-bit x 16-bit 1.2 p CMOS Multiplier with Low Latency Vector Merging'. Together they form a unique fingerprint.

Cite this