loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th International Conference on VLSI Design: VLSI in Mobile Communication
Elimination of Dynamic Hazards from Signal Transition Graphs
Bangalore, INDIA
January 03-January 06
ISBN: 0-8186-7228-5
Radhakrishna Nagalla, Computer and System Technology Laboratory University of NSW, Sydney, Australia
Graham Hellestrand, Computer and System Technology Laboratory University of NSW, Sydney, Australia
In this paper, we present a novel method to eliminate logic hazards, in particular dynamic hazards, in asynchronous circuits synthesized from the signal transition graph (STG) specifications. The existing hazard removal techniques work with the logic implementation derived from the STG specifications. This paper describes algorithms to detect and eliminate dynamic hazards without implementing the logic. Our algorithms have the advantage of directly operating on the STG specifications. In order to implement logic, an STG needs to satisfy the complete state coding (CSC) property. We first review a relationship between the causal relations of the signal transitions and the resultant logic (two-level sum-of-products or product-of-sums) implementations. Using this relationship, we identify the causes of dynamic hazards and remove the hazards by adding appropriate internal signal transitions to the STG.
Index Terms:
Asynchronous circuits, Signal Transition Graphs, Logic hazards, Dynamic hazards
Citation:
Radhakrishna Nagalla, Graham Hellestrand, "Elimination of Dynamic Hazards from Signal Transition Graphs," vlsid, pp.382, 9th International Conference on VLSI Design: VLSI in Mobile Communication, 1996
Usage of this product signifies your acceptance of the Terms of Use.