ACM Home Page
Please provide us with feedback. Feedback
Cost-aware synthesis of asynchronous circuits based on partial acknowledgement
Full text PdfPdf (674 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
SESSION: Optimization techniques for different target technologies table of contents
Pages: 158 - 163  
Year of Publication: 2006
ISBN ~ ISSN:1092-3152 , 1-59593-389-1
Authors
Yu Zhou  University of Newcastle, upon Tyne
Danil Sokolov  University of Newcastle, upon Tyne
Alex Yakovlev  University of Newcastle, upon Tyne
Sponsors
IEEE-CS : Computer Society
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1233501.1233533
What is a DOI?

ABSTRACT

Designing asynchronous circuits by reusing existing synchronous tools has become a promising solution to the problem of poor CAD support in asynchronous world. A straightforward way is to structurally map the gates in a synchronous netlist to their functionally equivalent modules which use delay-insensitive codes. Different trade-offs exist in previous methods between the overheads of the implementations and their robustness. The aim of this paper is to optimise the area of asynchronous circuits using partial acknowledgement concept. We employ this concept in two design flows, which are implemented in a software tool to evaluate the efficiency of the method. The benchmark results show the average reduction in area by 28% and in the number of inter-functional module wires that require timing verification by 67%, compared to NCL-X.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
T.-A. Chu. Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. PhD thesis, MIT Laboratory for Computer Science, June 1987.
 
3
 
4
 
5
 
6
 
7
L. Heller, W. Griffin, J. Davis, and N. Thoma. Cascode voltage switch logic: a differential CMOS logic family. In International Solid State Circuits Conference, pages 16--17, 1984.
 
8
 
9
 
10
A. J. Martin. Asynchronous datapaths and the design of an asynchronous adder. Formal Methods in System Design, 1 (1):119--137, July 1992.
 
11
 
12
 
13
 
14
 
15
 
16
C. L. Seitz. System timing. In C. A. Mead and L. A. Conway, editors, Introduction to VLSI Systems, chapter 7. Addison-Wesley, 1980.
 
17
S. C. Smith, R. F. DeMara, J. S. Yuan, D. Ferguson, and D. Lamb. Optimization of null convention self-timed circuits. Journal of Systems Architecture, 37(3):135--165, Aug. 2004.
 
18
S. C. Smith, R. F. DeMara, J. S. Yuan, M. Hagedorn, and D. Ferguson. Delay-insensitive gate-level pipelining. Integration, the VLSI journal, 30(2):103--131, 2001.
 
19
G. E. Sobelman and K. Fant. CMOS circuit design of threshold gates with hysteresis. In Proc. International Symposium on Circuits and Systems, pages 61--64, June 1998.
 
20
 
21

Collaborative Colleagues:
Yu Zhou: colleagues
Danil Sokolov: colleagues
Alex Yakovlev: colleagues