An efficient program for logic synthesis of mod-2 sum expressions

Author

Besslich, Ph.W. ; Riege, M.W.

Author_Institution

DIGSY, Bremen Univ., Germany

fYear

1991

fDate

27-31 May 1991

Firstpage

136

Lastpage

141

Abstract

Resurrected interest in mod-2 sum logic requires efficient algorithms for synthesis of incompletely specified multiple-output functions. The authors report on a program based on new algorithms: Quasi-minimum covering is obtained in a polarized Reed-Muller domain using a modified disjoint sharp operator. Since a new algorithm for cubewise RMT is applied, and since no iterative procedures are employed, the program performs about an order of magnitude faster than other algorithms. The new program can handle functions of hundreds of variables on a personal computer. Solutions are (on average) superior to those of other methods.<>

Keywords

logic CAD; ESOP; Reed Muller transformation; cubewise RMT; exclusive-OR sums-of-products; hundreds of variables; incompletely specified multiple-output functions; logic synthesis; mod-2 sum expressions; mod-2 sum logic; modified disjoint sharp operator; personal computer; polarized Reed-Muller domain; quasiminimum covering; Area measurement; Computational complexity; Costs; Hamming distance; Heuristic algorithms; Iterative algorithms; Logic; Microcomputers; Minimization methods; Polarization;

fLanguage

English

Publisher

ieee

Conference_Titel

Euro ASIC '91

Conference_Location

Paris, France

Print_ISBN

0-8186-2185-0

Type

conf

DOI

10.1109/EUASIC.1991.212878

Filename

212878