This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Path Complexity of Logic Networks
May 1978 (vol. 27 no. 5)
pp. 459-462
J.P. Hayes, Department of Electrical Engineering, University of Southern California
The problem of measuring the structural complexity of logic networks is examined. A complexity measure p(N) is proposed which is the total number of input-output paths in an acyclic network N. p(N) is easily computed by representing network structure in matrix form. It is shown that simple upper bounds on the number of tests required by a combinational network N can be derived from p(N). These bounds are fairly tight when N contains little or no fan-out. The path complexity of combinational functions is defined and briefly discussed.
Index Terms:
testability, Acyclic networks, combinational functions, complexity measures, fault diagnosis, logic networks, path complexity, path number
Citation:
J.P. Hayes, "Path Complexity of Logic Networks," IEEE Transactions on Computers, vol. 27, no. 5, pp. 459-462, May 1978, doi:10.1109/TC.1978.1675127
Usage of this product signifies your acceptance of the Terms of Use.