DocumentCode :
1153411
Title :
Detecting Sneak Paths in Transistor Networks
Author :
Brand, Daniel
Author_Institution :
IBM Thomas J. Watson Research Center
Issue :
3
fYear :
1986
fDate :
3/1/1986 12:00:00 AM
Firstpage :
274
Lastpage :
278
Abstract :
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.
Keywords :
Dominator; sneak path; synthesis; transistor network; Bridges; Circuit synthesis; Computer networks; Intelligent networks; Logic; MOS devices; MOSFETs; Merging; Network synthesis; Relays; Dominator; sneak path; synthesis; transistor network;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1986.1676750
Filename :
1676750
Link To Document :
بازگشت