loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'04)
High-Speed Reduced Stack Dual Lock Circuits
Crete, Greece
April 19-April 23
ISBN: 0-7695-2133-9
Nisrine Saadallah, McGill University
Xiaohua Kong, McGill University
Radu Negulescu, McGill University
This paper proposes a new pipeline circuit design with improved latency and throughput compared to several other asynchronous pipeline circuits. The channels between pipeline stages use data encoding and a small set of minimum-delay timing constraints that permit modular design with few dependencies on technology and layout. We develop circuit blocks that implement linear pipelines as well as forking, joining and data-dependent decisions. The single-bit operating cucle has only 6 CMOS inversions of which the forward latency has only 2 inversions. In the multi-bit case, we eliminate acknowledge completion detection and we place the request completion detection outside critical paths while still preventing data overlap in both convergent and ring trajectories. An implementation in CMOS 0.18µm exhibits a latency of 56ps per pipeline stage and throughput of 4.8-giga data item per second (GDI/s) in Hspice simulation. Reduced swing versions of the proposed circuits further improve these full-swing measurements.
Citation:
Nisrine Saadallah, Xiaohua Kong, Radu Negulescu, "High-Speed Reduced Stack Dual Lock Circuits," async, pp.219-228, 10th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.