Abstract:
The paper is devoted to combinational circuit optimization based on automata equation solving. We show how the flexibility of a component circuit can be calculated when using behavioral functions and propose a technique for checking whether some output functions can be simplified. For example, we show how to chek whether there exists an output function that can equal to 0 or to 1 or whether two output functions can be equal up to the inversion. The proposed technique is illustrated by a simple example.
Keywords:digital circuit, automata equation.
UDC:519.7
Received: 15.03.2008 Received in revised form: 05.06.2008 Accepted: 25.06.2008