Abstract: | The simplification of logic functions plays an important role in the design of logic circuits. These functions may be represented in an AND-EXOR form. The synthesis of AND-EXOR logic expressions is affected by the variable ordering. Finding an optional ordering can be considered a combinatorial optimization problem. This dissertation describes and empirical investigation into the application of Neighbourhood Search Techniques to obtain a good variable ordering along with the effects of using different representations.
|