Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 2008, Article ID 680157, 8 pages
http://dx.doi.org/10.1155/2008/680157
Research Article

A Low-Cost BIST Scheme for Test Vector Embedding in Accumulator-Generated Sequences

Department of Informatics, Technological Educational Institute of Athens, Athens 12210, Greece

Received 27 March 2007; Accepted 5 December 2007

Academic Editor: Bashir M. Al-Hashimi

Copyright © 2008 Ioannis Voyiatzis. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Abramovici, M. Breuer, and A. Freidman, Digital Systems Testing and Testable Design, Computer Science Press, Rockville, Md, USA, 1990.
  2. P. Bardell, W. McAnney, and J. Savir, Built-In Test for VLSI: Pseudorandom Techniques, John Wiley & Sons, New York, NY, USA, 1987.
  3. C. Dufaza and G. Gambon, “LFSR-based deterministic and pseudorandom test pattern generator structures,” in Proceedings of the European Test Conference, pp. 27–34, Nashville, Tenn, USA, October 1991.
  4. A. P. Stroele, “BIST patter generators using addition and subtraction operations,” Journal of Electronic Testing, vol. 11, no. 1, pp. 69–80, 1997. View at Publisher · View at Google Scholar
  5. M. Lempel, S. Gupta, and A. Breuer, “Test embedding with discrete logarithms,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 5, pp. 554–566, 1995. View at Publisher · View at Google Scholar
  6. R. Dorsch and H.-J. Wunderlich, “Accumulator based deterministic BIST,” in Proceedings of IEEE International Test Conference (TC '98), pp. 412–421, Washington, DC, USA, October 1998. View at Publisher · View at Google Scholar
  7. A. P. Stroele and F. Mayer, “Methods to reduce test application time for accumulator-based self-test,” in Proceedings of the 15th IEEE VLSI Test Symposium, pp. 48–53, Monterey, Calif, USA, April 1997. View at Publisher · View at Google Scholar
  8. S. Pohlig and M. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE Transactions and Information Theory, vol. 24, no. 1, pp. 106–110, 1978. View at Publisher · View at Google Scholar
  9. S. Akers, “Binary decision diagrams,” IEEE Transactions on Computers, vol. 27, no. 6, pp. 509–516, 1978. View at Publisher · View at Google Scholar
  10. D. Kagaris and S. Tragoudas, “On the design of optimal counter-based schemes for test set embedding,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 2, pp. 219–230, 1999. View at Publisher · View at Google Scholar
  11. I. Voyiatzis, “Test vector embedding into accumulator-generated sequences: a linear-time solution,” IEEE Transactions on Computers, vol. 54, no. 4, pp. 476–484, 2005. View at Publisher · View at Google Scholar
  12. I. Voyiatzis, “Accumulator-based compression in symmetric transparent RAM BIST,” in Proceedings of International Conference on Design and Test of Integrated Systems in Nanoscale Technology (DTIS '06), pp. 273–278, Tunis, Tunisia, September 2006.
  13. I. Voyiatzis, D. Gizopoulos, and A. Paschalis, “Accumulator-based weighted pattern generation,” in Proceedings of the 11th IEEE International On-Line Testing Symposium (IOLTS '05), pp. 215–220, St. Rafael, France, July 2005. View at Publisher · View at Google Scholar
  14. S. Manich, L. Garcia, L. Balado et al., “On the selection of efficient arithmetic additive test pattern generators,” in Proceedings of the 8th IEEE European Test Workshop (ETW '03), pp. 9–14, Maastricht, The Netherlands, May 2003.
  15. S. Manich, L. Garcia-Deiros, and J. Figueras, “Minimizing test time in arithmetic test-pattern generators with constrained memory resources,” IEEE Transactions in Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 11, pp. 2046–2058, 2007. View at Publisher · View at Google Scholar
  16. D. Nikolos, D. Kagaris, and S. Gidaros, “Diophantine-equation based arithmetic test set embedding,” in Proceedings of the 12th IEEE International On-Line Testing Symposium (IOLTS '06), pp. 193–194, Como, Italy, July 2006. View at Publisher · View at Google Scholar
  17. J. Hunter, Number Theory, Oliver and Boyd, London, UK, 1964.
  18. D. Kagaris, S. Tragoudas, and A. Majumdar, “On the use of counters for reproducing deterministic test sets,” IEEE Transactions on Computers, vol. 45, no. 12, pp. 1405–1419, 1996. View at Publisher · View at Google Scholar
  19. F. Brglez and H. Fujiwara, “A neutral netlist of 10 combinational benchmarks circuits and a target translator in FORTRAN,” in Proceedings of International Symposium on Circuits and Systems, Kyoto, Japan, June 1985.
  20. I. Pomeranz, L. N. Reddy, and S. M. Reddy, “COMPACTEST: a method to generate compact test sets for combinational circuits,” in Proceedings of IEEE International Test Conference, pp. 194–203, Nashville, Tenn, USA, October 1991.