Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks

Author

Sarabi, Andisheh ; Perkowski, Marek A.

Author_Institution

Dept. of Electr. Eng., Portland State Univ., OR, USA

fYear

1992

fDate

8-12 Jun 1992

Firstpage

30

Lastpage

35

Abstract

The authors introduce fast exact and quasi-minimal algorithms for minimal fixed polarity AND/XOR canonical representation of Boolean functions. The method uses features of arrays of disjoint cubes representations of functions to identify the minimal networks. These features can drastically reduce the search space and provide high quality heuristics for quasi-minimal representations. Experimental results show that these special AND/XOR networks, on the average, have a similar number of terms to Boolean AND/OR networks while there were functions for which AND/XOR circuits were much smaller. The circuits generated are much more testable

Keywords

Boolean functions; logic testing; minimisation of switching nets; Boolean functions; disjoint cubes representations; fast exact minimisation; high quality heuristics; highly testable fixed-polarity AND/XOR canonical networks; quasi-minimal minimization; search space; Arithmetic; Boolean functions; Circuit testing; Field programmable gate arrays; Logic design; Logic devices; Minimization methods; Network synthesis; Programmable logic arrays; Switching circuits;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 1992. Proceedings., 29th ACM/IEEE

Conference_Location

Anaheim, CA

ISSN

0738-100X

Print_ISBN

0-8186-2822-7

Type

conf

DOI

10.1109/DAC.1992.227867

Filename

227867