Abstract.
Testing of VLSI circuits is still a NP hard problem. Existing conventional methods are unable to achieve the required breakthrough in terms of complexity, time and cost. This paper deals with testing the VLSI circuits using natural computing methods. Two prototypical algorithms named as DATPG and QATPG are developed utilizing the properties of DNA computing and Quantum computing, respectively. The effectiveness of these algorithms in terms of result quality, CPU requirements, fault detection and number of iterations is experimentally compared with some of existing classical approaches like exhaustive search and Genetic algorithms, etc. The algorithms developed are so efficient that they require only √ N (where N is the total number of vectors) iterations to find the desired test vector whereas in classical computing, it takes N/2 iterations. The extendibility of new approach enables users to easily find out the test vector from VLSI circuits and can be adept for testing the VLSI chips.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L Adleman (1994) ArticleTitleMolecular computation of solutions to combinatorial problems Science 266 1021–1024 Occurrence Handle1:CAS:528:DyaK2MXitFSjs7k%3D Occurrence Handle7973651
VD Agrawal KT Cheng P Agrawal (1988) CONTEST: A Concurrent Test Generator for Sequential Circuits. In: IEEE/ACM Design Automation Conference Anahaim CA, USA 84–89
N Ajit (1995) Bimolecular cognitive science. In: Proceedings of Foundations of Cognitive Science Workshop AISB95 Sheffield, UK 100–103
Apoorva P (2001) Quantum Database Search can do without sorting, quant-ph/0012149 Phys. Rev. A64 034303.
ST Chakradhar ML Bushnell VD Agrawal (1990a) Automatic Test Generation using quadratic 0-1 programming. In: Conference Proceedings on 27th ACM/IEEE Design Automation Conference Orlando Florida, United States 654–659
Chakradhar ST, Bushnell ML and Agrawal VD (1990b) Neural Models and Algorithms for Digital testing, pp. 85–92. Kluwer Academic Publishers.
R Cleve A Ekert C Macchiavello M Mosca (1998) Quantum Algorithms Revisited Clarendon Laboratory, Department of Physics, University of Oxford Parks Road, Oxford, OX1 3PU, UK 86–89
Corno F Prinetto P Rebaudengo M Sonza Reorda M Mosca R (1996) Advanced Techniques for GA-based sequential ATPGs. In: Proceedings of European Design and Test Conference Paris France 375–379
PC Dong K Jinsoo (1999a) Quantum Computation Department of Mathematics Seoul National University
PC Dong K Jinsoo (1999b) Quantum Database search by a single query Department of Mathematics Seoul National University
A Geist A Beguelin J Dongarra W Jiang R Mancheck V Sunderam (1994) PVM: Parallel Virtual Machine MIT Press Cambridge, MA 148–158
Goong C, Stephen AF and Marlan OS (2001) Grover’s algorithm for multiobject search in quantum computing, Lecture notes in Physics, Vol. 561, pp. 162–165. Springer Verlag, Heidelberg
OH Ibarra SK Sahni (1975) ArticleTitlePolynomially complete fault detection problems IEEE Transactions on Computer C-24 IssueID3 242–249
Lov KG (1997a) Quantum Mechanics Helps in Searching for a Needle in a Haystack. 3C-404A Bell Labs, 600 Mountain Avenue, Murray Hill NJ 07974
KG Lov (1997b) A Fast Quantum Mechanical Algorithm for Database Search. 3C-404A Bell Labs 600 Mountain Avenue Murray Hill NJ 07974
R Lipton (1995a) ArticleTitleMolecular computation of solutions to combinatorial problems Science 266 1021–1024
R Lipton (1995b) ArticleTitleDNA solution of hard computational problems Science 268 542–545
Michael AN and Isaac LC (2001) Quantum Computation and Quantum Information, pp. 80–89. Cambridge University Press.
P W Shor (1994) Algorithms for quantum computation: Discrete logarithms and factoring In: Proceedings of the 35th Annual Symposium on the Foundation of Computer IEEE Computer Society Press Los Alamitos, CA 124–134
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Singh, A., Bharadwaj, L.M. & Harpreet, S. DNA and quantum based algorithms for VLSI circuits testing. Nat Comput 4, 53–72 (2005). https://doi.org/10.1007/s11047-004-3591-1
Issue Date:
DOI: https://doi.org/10.1007/s11047-004-3591-1