论文信息 - Test generation for combinational circuits based on DNA computing

Test generation for combinational circuits based on DNA computing

The aim of this paper is to illustrate the automatic test generation for combinational circuits based on DNA computing. In the algorithm the Chromosomes are encoded by the four bases of nucleic acid σ = {A,G,C,T} and the gene-class genetic manipulation is introduced to ensure the population diversity; In addition, the test set size produced by DNA chain is controlled at different stages of test generation so as to reduce the redundancy of test sets and accelerate the speed of test generation. The experimental results for benchmark circuit iscas'85 show that this algorithm can achieve high fault coverage and substantially reduce the size of test vector sets.

Wang Jiejun | Xu Chuan-pei

[1] K. Bo. Chaos genetic algorithm and its application in test generation , 2006 .

[2] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.

[3] Shao Shi-huang. DNA Computing and Soft Computing , 2001 .

[4] Dong Sam Ha,et al. AN EFFICIENT, FORWARD FAULT SIMULATION ALGORITHM BASED ON THE PARALLEL PATTERN SINGLE FAULT PROPAGAT , 1991, 1991, Proceedings. International Test Conference.

[5] Max H. Garzon,et al. Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

[6] Michael H. Schulz,et al. SOCRATES: a highly efficient automatic test pattern generation system , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..