Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits

Engineering Applications of Artificial Intelligence

Volumn 20, Issue 2, 2007, Pages 177-184

  Venayagamoorthy, Ganesh K ^a   Smith, Scott C ^a   Singhal, Gaurav ^a  

^a University of Missouri Rolla   (United States)

Author keywords

Circuit partitioning; Particle swarm optimization; PSO PIFAN; VLSI testing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL CIRCUITS; OPTIMIZATION; VECTORS;

CIRCUIT PARTITIONING; PARTICLE SWARM OPTIMIZATION; PSO-PIFAN; VLSI TESTING;

CMOS INTEGRATED CIRCUITS;

EID: 33751393345     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2006.06.011     Document Type: Article

References (19)

1. Al-Arian S., and Bolling R. Improving the testability of VLSI circuits through partitioning. IEEE Symp. Circuits Syst. 4 (1994) 199-202
2. Archambeau, E.C., McCluskey, E.J., 1984. Fault coverage of pseudo-exhaustive testing. Digest, International Conference on Fault Tolerant Computation, Orlando, Fl, pp. 141-145.
3. Baumgartner U., Magele Ch., and Renhart W. Pareto optimality and particle swarm optimization. IEEE Trans. Magn. 40 2 (2004) 1172-1175
4. Bonabeau E., Dorigo M., and Theraulaz G. Swarm Intelligence (1999), Oxford University Press, Oxford. 0-19-513158-4
5. Brglez F., and Fujiwara H. A Neutral Netlist of 10 Combinational Benchmark circuits. Proceedings of the IEEE International Symposium on Circuits and Systems (1985), IEEE Press, Piscataway, NJ. http://www.cbl.ncsu.edu/benchmarks (pp. 695-698; see also the ISCAS-85 benchmark directory at 〈http://www.cbl.ncsu.edu/benchmarks〉)
6. Clerc M., and Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6 1 (2002) 58-73
7. Coello C.A.C., Pulido G.T., and Lechuga M.S. Handling multiple objectives with particle swarm optimization. IEEE Trans. on Evol. Comput. 8 3 (2004) 256-279
8. Doctor, S., Venayagamoorthy, G.K., Gudise, V.G., 2004. Optimal PSO for collective robotic search applications. IEEE Congress on Evolutionary Computation, June 20-23, pp. 1390-1395.
9. Gudise, V.G., Venayagamoorthy, G.K., 2004. FPGA placement and routing using particle swarm optimization. IEEE Computer Society Annual Symposium on VLSI, February 19-20, pp. 307-308.
10. Hu Xiaohui, A., Eberhart, R., 2002. Multiobjective optimization using dynamic neighborhood particle swarm optimization. In: Proceedings of the 2002 Congress on Evolutionary Computation, vol. 2, May 12-17, pp. 1677-1681.
11. Kennedy, J., Eberhart, R., 1995. Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, vol. IV, Perth, Australia, pp. 1942-1948. ISBN 1558605959.
12. Kennedy, J., Eberhart, R., 2001. Swarm Intelligence. Academic Press, San Diego, USA. ISBN 0195131592.
13. McCluskey E.J., and Bozorgui-Nesbat S. Design for autonomous test. IEEE Trans. Circuits Syst. CAS-28 11 (1981) 1070-1079
14. Shaer, B., Dib, K., 2002. An Efficient Partitioning Algorithm of Combinational CMOS Circuits. In: Proceedings of the IEEE Computer Society Annual Symposium on VLSI, pp. 142-146.
15. Shaer B., Landis D., and Al-Arian S. Partitioning algorithm to enhance pseudoexhaustive testing of digital VLSI circuits. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 8 6 (2000) 750-754
16. Shaer B., Al-Arian S., and Landis D. Partitioning sequential circuits for pseudoexhaustive testing. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 8 5 (2000) 534-541
17. Shi, Y., Eberhart, R.C., 1998. A modified particle swarm optimizer. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 69-73.
18. Shperling, I., McCluskey, E.J., 1987. Circuit segmentation for pseudo-exhaustive testing via simulated annealing. In: Proceedings of the International Test Conference, pp. 58-65.
19. Venayagamoorthy, G.K., Gudise, V.G., 2004. Swarm intelligence for digital circuits implementation on field programmable gate arrays platforms. 2004 NASA/DoD Conference on Evolvable Hardware, June 24-26, pp. 83-86.