Exact computation of the entropy of a logic circuit
- 1 January 1996
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. c 17, 162-167
- https://doi.org/10.1109/glsv.1996.497613
Abstract
Computing the entropy of a digital circuit has proved to be very useful for several applications in the area of VLSI system design. Recently, a method for entropy calculation has been used in the context of power estimation for logic circuits described at the register-transfer level. The technique has shown to be reasonably effective concerning the trade-off between the accuracy of the estimates produced and the execution time. However, the assumptions required to make the computation feasible are such that the obtained results are approximate. In this paper, we propose a symbolic algorithm for the exact calculation of the entropy of alogic circuit which is able to handle reasonably large examples without introducing any approximation. We present experimental data on standard benchmark designs in orderto show the eflectiweness of the new method; in addition, we compare our results to the ones obtained with the approximate approach. As a result, we observe a marginal penaltyin the performance of the symbolic procedure; on the other hand, accuracy in the calculation increases significantly.Keywords
This publication has 20 references indexed in Scilit:
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An easily computed functional level testability measurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An entropy measure for the complexity of multi-output Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient implementation of a BDD packagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Towards a high-level power estimation capabilityPublished by Association for Computing Machinery (ACM) ,1995
- Information theoretic measures of energy consumption at register transfer levelPublished by Association for Computing Machinery (ACM) ,1995
- Algebraic decision diagrams and their applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Logical Network Cost and EntropyIEEE Transactions on Computers, 1973
- A Measure of Computational WorkIEEE Transactions on Computers, 1972