Design entropy concept: a measurement for complexity

Authors:
Benjamin Menhorn;Frank Slomka
Affiliations:
Ulm University, Ulm, UNK, Germany;Ulm University, Ulm, UNK, Germany
Venue:
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Year:
2011

Citing 6
Cited 0

Software Metrics: A Rigorous and Practical Approach

Software Metrics: A Rigorous and Practical Approach
Closing the SoC Design Gap

Computer
Controlling Software Projects: Management, Measurement, and Estimates

Controlling Software Projects: Management, Measurement, and Estimates
Establishing Moore's Law

IEEE Annals of the History of Computing
Towards Industrial Strength Business Performance Management

HoloMAS '07 Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
Hardware-dependent Software: Principles and Practice

Hardware-dependent Software: Principles and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

In general, this work will deal with measuring complexity. The focus question is towards addressing complexity in an adequate way. This work concentrates on digital circuits and digital hardware. For this field of computer science the complexity for circuits will be calculated. Therefore, a new complexity measure will be introduced, called design entropy. It allows a mathematical calculation of complexity resulting in figures. These allow a direct evaluation and comparison between different systems and realizations. The application and important capabilities of this measurement will be demonstrated on different examples.