High-level power estimation and the area complexity of Boolean functions

Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (RTL). This paper addresses the problem of computing the area complexity of single-output Boolean functions given only their functional description, where area complexity is measured in terms of the number of gates required for an optimal implementation of the function. We propose an area model to estimate the area based on a new complexity measure called the average cube complexity. This model has been implemented, and empirical results demonstrating its feasibility and utility are presented.

• Type: Conference
• Year: 1996
• Where: ISLPED
• Authors: Mahadevamurty Nemani, Farid N. Najm
• Keywords: Area Complexity, Boolean Functions, Functional Description, Hardware, ISLPED 1996