Synthesis of highly testable fixed-polarity AND-XOR canonical networks-A genetic algorithm-based approach

Author

Chattopadhyay, S. ; Roy, S. ; Chaudhuri, P.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India

Volume

45

Issue

4

fYear

1996

fDate

4/1/1996 12:00:00 AM

Firstpage

487

Lastpage

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

Keywords

genetic algorithms; logic CAD; minimisation of switching nets; AND-XOR canonical networks; genetic algorithm; inherent parallelism; minimization; polarity of the variables; rate of convergence; synthesis; Boolean functions; Circuit testing; Codes; Field programmable gate arrays; Genetic algorithms; Logic design; Minimization methods; NP-hard problem; Network synthesis; Programmable logic arrays;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.494107

Filename

494107