Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach

Authors:
S. Chattopadhyay;S. Roy;P. Pal Chaudhuri
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1996

Citing 4
Cited 0

On the Complexity of Mod-2l Sum PLA's

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

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

Specific inherent advantages of AND-XOR networks have encouraged researchers to look for efficient minimization and synthesis tools for their realization. Among several canonical representations of AND-XOR networks, the most easily testable one is the fixed polarity Consistent Generalized Reed Muller (CGRM) form. In this paper, a Genetic Algorithm (GA) formulation of the problem of finding the polarity of the variables resulting in minimum number of product terms has been proposed. The quality of the solution obtained and the high rate of convergence have established the effectiveness of the genetic algorithm in solving this particular NP-hard problem. Further, the inherent parallelism of genetic algorithm makes the proposed scheme an ideal candidate for solving the problem in a multiprocessor environment.