Fast minimization of mixed-polarity AND/XOR canonical networks

Author

Perkowski, Marek A. ; Csanky, Laszlo ; Sarabi, A. ; Schafer, Iwan

Author_Institution

Portland State Univ., OR, USA

fYear

1992

Firstpage

33

Lastpage

36

Abstract

A quasi-minimal algorithm for canonical restricted mixed polarity (CRMP) AND/XOR forms is presented. These forms, which include the consistent and inconsistent generalized Reed-Muller (GRM) forms, are both very easily testable and, on average, have smaller numbers of terms than sum-of-product (SOP) expressions. The set of test vectors for detecting stuck-at and bridging faults of a function realized in CRMP forms, like that of consistent (GRM) forms, is independent of the function. This test can be of order (n+4)r, where n is the number of variables in the function and r is the number of component consistent GRMs in the CRMP. The experimental results confirm the compactness of CRMPs as compared to SOP expressions

Keywords

fault location; logic circuits; logic design; bridging faults; compactness; fast minimisation; generalised Reed-Muller forms; mixed-polarity AND/XOR canonical networks; quasi-minimal algorithm; stuck-at; test vectors; Arithmetic; Circuit faults; Circuit testing; Computer science; Fault detection; Logic design; Logic devices; Logic testing; Network synthesis; Programmable logic arrays;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 1992. ICCD '92. Proceedings, IEEE 1992 International Conference on

Conference_Location

Cambridge, MA

Print_ISBN

0-8186-3110-4

Type

conf

DOI

10.1109/ICCD.1992.276211

Filename

276211