Path Complexity of Logic Networks

Authors:
J. P. Hayes
Affiliations:
Department of Electrical Engineering, University of Southern California
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 4
Cited 1

The Fanout Structure of Switching Functions

Journal of the ACM (JACM)
Recent Developments in the Theory and Practice of Testable Logic Design*

Computer
On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests

IEEE Transactions on Computers
Diagnosis of automata failures: a calculus and a method

IBM Journal of Research and Development

A Tree Representation of Combinational Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.