论文信息 - On Combinational Networks with Restricted Fan-Out

On Combinational Networks with Restricted Fan-Out

Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions.

Sharad C. Seth | Kolar L. Kodandapani

[1] Rodolfo Betancourt. Derivation of Minimum Test Sets for Unate Logical Circuits , 1971, IEEE Transactions on Computers.

[2] Zvi Kohavi,et al. Fault Detection in Fanout-Free Combinational Networks , 1973, IEEE Transactions on Computers.

[3] Otto Kolp,et al. Fan-In Constrained Tree Networks of Flexibe Cells , 1974, IEEE Transactions on Computers.

[4] F. F. Sellers,et al. Analyzing Errors with the Boolean Difference , 1968, IEEE Transactions on Computers.

[5] John P. Hayes. Enumeration of Fanout-Free Boolean Functions , 1976, JACM.

[6] H. A. Curtis,et al. A new approach to The design of switching circuits , 1962 .

[7] Jr. Sheldon B. Akers,et al. On a Theory of Boolean Functions , 1959 .

[8] Jon T. Butler,et al. On the Number of Functions Realized by Cascades and Disjunctive Networks , 1975, IEEE Transactions on Computers.

[9] John P. Hayes. The Fanout Structure of Switching Functions , 1975, JACM.

[10] Sharad C. Seth,et al. Diagnosis of Faults in Linear Tree Networks , 1977, IEEE Transactions on Computers.