This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach
April 1996 (vol. 45 no. 4)
pp. 487-490

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.

[1] I.S. Reed, “A Class of Multiple-Error-Correcting Codes and Their Decoding Scheme,” IRE Trans. Information Theory, vol. 4, pp. 38-42, 1954.
[2] D. Muller,"Application of Boolean Algebra to Switching Circuit Design and to Error Detection," IRE Trans. Electronic Computers, vol. EC-3, pp. 6-12, 1954.
[3] M. Helliwell and M.A. Perkowski,"A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms," Proc. 25th ACM/IEEE Design Automation Conf., pp. 427-432, 1988.
[4] S.M. Reddy,"Easily Testable Realizations for Logic Functions," IEEE Trans. Computers, vol. 21, no. 11, pp. 1,183-1,188, Nov. 1972.
[5] D.K. Pradhan,"Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays," IEEE Trans. Computers, vol. 27, no. 2, pp. 181-187, 1978.
[6] T. Sasao and P. Besslich, “On the Complexity of mod-2 Sum PLA's,” IEEE Trans. Computers, vol. 39, no. 2, pp. 262-266, Feb. 1990.
[7] M. Davio,J.P. Deschamps, and A. Thayse,Discrete and Switching Functions. Mc-Graw-Hill, 1978.
[8] P.W. Besslich and M. Riege,"An Efficient Program for Logic Synthesis of Mod-2 Sum Expressions," Euro ASIC, pp. 136-141, 1991.
[9] A. Sarabi and M.A. Perkowski, "Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/EXOR Canonical Networks," Proc. 29th ACM/IEEE DAC, pp. 30-35, 1992.
[10] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.

Index Terms:
Reed Muller form, AND-XOR network synthesis, fixed-polarity canonical expansion, genetic algorithm.
Citation:
S. Chattopadhyay, S. Roy, P. Pal Chaudhuri, "Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach," IEEE Transactions on Computers, vol. 45, no. 4, pp. 487-490, April 1996, doi:10.1109/12.494107
Usage of this product signifies your acceptance of the Terms of Use.