Logical Network Cost and Entropy
- 1 September 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (9), 823-826
- https://doi.org/10.1109/tc.1973.5009171
Abstract
A measure of the minimum cost of a logical network is important in the evaluation of such networks. A hypothesis is investigated which states that the average minimum cost depends on both the number of input variables and the entropy (``entropy'' in this sense is based on the probability of a ``1'' in the functions' truth table) of the function realized. Some experimental results are presented to support the hypothesis.Keywords
This publication has 4 references indexed in Scilit:
- A Formula for Logical Network CostIEEE Transactions on Computers, 1968
- Statistical Complexity of Algorithms for Boolean Function MinimizationJournal of the ACM, 1965
- Average Values of Quantities Appearing in Boolean Function MinimizationIEEE Transactions on Electronic Computers, 1964
- Complexity in Electronic Switching CircuitsIRE Transactions on Electronic Computers, 1956