AREA-TIME-EFFICIENT VLSI RESIDUE-TO-BINARY CONVERTERS

Citation
T. Srikanthan et al., AREA-TIME-EFFICIENT VLSI RESIDUE-TO-BINARY CONVERTERS, IEE proceedings. Computers and digital techniques, 145(3), 1998, pp. 229-235
Citations number
14
Categorie Soggetti
Computer Science Hardware & Architecture","Computer Science Theory & Methods","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
13502387
Volume
145
Issue
3
Year of publication
1998
Pages
229 - 235
Database
ISI
SICI code
1350-2387(1998)145:3<229:AVRC>2.0.ZU;2-E
Abstract
The authors present highly area-time-efficient VLSI implementations of residue reverse converters called compressed multiply accumulate (CMA C) converters. This efficiency results from carefully identifying and eliminating redundancy in existing proposals. Specifically, the partia l sum generation and addition are merged into a single carry-save addi tion operation. Also, module multipliers are replaced by simple adders by the bit unfolding and uncorrected residues technique. The CMAC rev erse converters proposed here were fabricated in a 0.8 mu m N-well CMO S process. Due to the techniques mentioned, the resulting VLSI impleme ntation was 3-4 times smaller than recently reported results, while de livering identical throughput and achieving four times lower delay. Th e AT(2) efficiency of these converters O(n(2)log(3)n) equals the best known to date. Comprehensive analysis of the various implementation op tions (CPA, CLA or serial) presented will be of great value to the VLS I system designer in choosing a reverse converter that conforms to the delay, area and power requirements imposed by a given application.