This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Detecting Sneak Paths in Transistor Networks
March 1986 (vol. 35 no. 3)
pp. 274-278
D. Brand, IBM Thomas J. Watson Research Center
In an MOS transistor network information can propagate through transistors and connections in both directions. Sometimes, however, it is intended to propagate in one direction only. Propagation in the wrong direction, causing a so called sneak path, could result in a functional error. We present an almost linear algorithm for detecting such sneak paths. Only consistent sneak paths, i.e., only paths that can possibly conduct, can cause a functional error; therefore, the algorithm allows inconsistent sneak paths to be left in the network. It does so without actually examining any paths, which would be too inefficient.
Index Terms:
transistor network, Dominator, sneak path, synthesis
Citation:
D. Brand, "Detecting Sneak Paths in Transistor Networks," IEEE Transactions on Computers, vol. 35, no. 3, pp. 274-278, March 1986, doi:10.1109/TC.1986.1676750
Usage of this product signifies your acceptance of the Terms of Use.