Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/28494
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Delay evaluation of high speed data-path circuits based on threshold logic |
Author: | Celinski, P. Abbott, D. Cotofana, S. |
Citation: | Integrated circuit and system design : power and timing modeling, optimization and simulation : 14th International Workshop, PATMOS 2004, Santorini, Greece, September 15-17, 2004 : proceedings / Enrico Macii, Vassilis Paliouras and Odysseas Koufopavlou (eds.), pp. 899-906 |
Publisher: | Springer-Verlag |
Publisher Place: | Germany |
Issue Date: | 2004 |
Series/Report no.: | Lecture notes in computer science ; 3254. |
ISBN: | 3540230955 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | PATMOS 2004 (14th : 2004 : Santorini, Greece) |
Editor: | Macii, E. Paliouras, V. Koufopavlou, O. |
Statement of Responsibility: | Peter Celinski, Derek Abbott and Sorin D. Cotofana |
Abstract: | The main result is the development, and delay comparison based on Logical Effort, of a number of high speed circuits for common arithmetic and related operations using threshold logic. The designs include 8 to 64-input AND, 4-bit carry generate, and the carry-out of a (7,3) parallel (population) counter. The circuits are designed using both domino gates and the recently proposed CMOS Charge Recycling Threshold Logic (CRTL). It is shown that compared to domino, the CRTL design examples are typically between 1.3 and 2.7 times faster over a wide range of load values, while presenting the same input capacitance to the driver. |
Description: | The original publication is available at www.springerlink.com |
DOI: | 10.1007/b100662 |
Published version: | http://www.springerlink.com/content/64gkrxed0amdvu84/ |
Appears in Collections: | Aurora harvest 6 Electrical and Electronic Engineering publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.