Cart (Loading....) | Create Account
Close category search window
 

The Application of Ant Colony Algorithm on Automatic Testing Path Optimization in Complex Circuits

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Liu Xinmei ; Nat. Key Lab. of Electron. Test Technol., North Univ. of China, Taiyuan, China ; Liu Peng ; Yin Junling ; Hou Wen

With the maturation of a large number of bionic optimization algorithm, based on the analysis of the currently common path optimization algorithm, ant colony optimization algorithm is applied to the problem of path optimization of automatic testing in complex circuit. This paper established the relevant system models, designed the specific implementation scheme, and conducted the simulation and experiment of path optimization on moving probe tests in small circuits and complex circuits. The results show that the ant colony algorithm applied to path optimization is feasible and it is superior to the results of sequence testing on the testing speed and real-time testing ability.

Published in:

Intelligent Systems (GCIS), 2012 Third Global Congress on

Date of Conference:

6-8 Nov. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.