Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach
Issue No. 04 - April (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.494107
<p><b>Abstract</b>—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.</p>
Reed Muller form, AND-XOR network synthesis, fixed-polarity canonical expansion, genetic algorithm.
S. Chattopadhyay, S. Roy and P. P. Chaudhuri, "Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach," in IEEE Transactions on Computers, vol. 45, no. , pp. 487-490, 1996.