Design of synchronous and asynchronous variable-latency pipelined multipliers

Authors:
Mauro Olivieri
Affiliations:
Univ. of Rome “La Sapienza”, Italy
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2001

Citing 0
Cited 4

ReCycle:: pipeline adaptation to tolerate process variation

Proceedings of the 34th annual international symposium on Computer architecture
Design of a low-power, high performance, 8×8bit multiplier using a Shannon-based adder cell

Microelectronics Journal
Coupling latency-insensitivity with variable-latency for better than worst case design: a RISC case study

Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
A general design methodology for synchronous early-completion-prediction adders in nano-CMOS DSP architectures

VLSI Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel variable-latency multiplier architecture, suitable for implementation as a self-timed multiplier core or as a fully synchronous multicycle multiplier core. The architecture combines a second-order Booth algorithm with a split carry save array pipelined organization, incorporating multiple row skipping and completion-predicting carry-select dual adder. The paper reports the architecture and logic design, CMOS circuit design and performance evaluation. In 0.35 /spl mu/m CMOS, the expected sustainable cycle time for a 32-bit synchronous implementation is 2.25 ns. Instruction level simulations estimate 54% single-cycle and 46% two-cycle operations in SPEC95 execution. Using the same CMOS process, the 32-bit asynchronous implementation is expected to reach an average 1.76 ns throughput and 3.48 ns latency in SPEC95 execution.