EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions

Authors:
T. Sasao
Affiliations:
Dept. of Comput. Sci. & Electron. Eng., Kyushu Inst. of Technol., Iizuka
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 3

An efficient approach for designing and minimizing reversible programmable logic arrays

Proceedings of the great lakes symposium on VLSI
Compact DSOP and Partial DSOP Forms

Theory of Computing Systems
Upper bounds for reversible circuits based on Young subgroups

Information Processing Letters

Quantified Score

Hi-index	0.03

Visualization

Abstract

Minimization of AND-EXOR programmable logic arrays (PLAs) with input decoders corresponds to minimization of the number of products in Exclusive-OR sum-of-products expressions (ESOPs) for multiple-valued-input two-valued-output functions. A simplification algorithm for ESOPs that iteratively reduces the number of the products in ESOPs and then reduces the number of the literals is presented. Various rules are used to replace a pair of products with another one. Many AND-EXOR PLAs for arithmetic circuits have been simplified. In most cases, AND-EXOR PLAs required fewer products than AND-OR PLAs