|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| P.D. Hortensius, R.D. McLeod, H.C. Card, "Cellular Automata-Based Signature Analysis for Built-In Self-Test," IEEE Transactions on Computers, vol. 39, no. 10, pp. 1273-1283, October, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.59857, author = {P.D. Hortensius and R.D. McLeod and H.C. Card}, title = {Cellular Automata-Based Signature Analysis for Built-In Self-Test}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {10}, issn = {0018-9340}, year = {1990}, pages = {1273-1283}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.59857}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Cellular Automata-Based Signature Analysis for Built-In Self-Test IS - 10 SN - 0018-9340 SP1273 EP1283 EPD - 1273-1283 A1 - P.D. Hortensius, A1 - R.D. McLeod, A1 - H.C. Card, PY - 1990 KW - built-in self-test; signature analysis properties; one-dimensional cellular automata; cyclic-group rules; LFSR; linear feedback shift register; CALBO; cellular automata-based logic block observation; test pattern generation; BILBO; built-in block observation; built-in self test; finite automata; logic testing. VL - 39 JA - IEEE Transactions on Computers ER - | |||
Relevant signature analysis properties for elementary one-dimensional cellular automata are presented. It is found that cellular automata with cyclic-group rules provide signature analysis properties comparable to the LFSR (linear feedback shift register). A technique of using CALBO (cellular automata-based logic block observation) for both test pattern generation and signature analysis, in a similar manner to a typical BILBO (built-in block observation) implementation, is presented.
[1] R. D. McLeod, P. D. Hortensius, W. Pries, and H. C. Card, "Design for testability using logic block observers based upon cellular automata,"IEEE Trans. Comput., to be published.
[2] P. D. Hortensius, R. D. McLeod, D. M. Miller, and H. C. Card, "Cellular automata-based pseudorandom number generators for built-in self-test,"IEEE Trans. Comput.-Aided Design, to be published.
[3] S. Wolfram, "Statistical mechanics of cellular automata,"Rev. Modern Phys., vol. 55, pp. 601-644, 1983.
[4] S. Wolfram, "Universality and complexity in cellular automata,"Physica, vol. 10D, pp. 1-35, 1984.
[5] P. D. Hortensius, H. C. Card, and R. D. McLeod, "Parallel random number generation for VLSI using cellular automata,"IEEE Trans. Comput., vol. 38, pp. 1466-1473, Oct. 1989.
[6] P. D. Hortensius, "Parallel computation of non-deterministic algorithms in VLSI," Ph.D. dissertation, Univ. of Manitoba, Winnipeg, Canada, 1987, unpublished.
[7] S. Wolfram, "Random sequence generation by cellular automata,"Advances Appl. Math., vol. 7, pp. 127-169, 1986.
[8] E. Prange, "Cyclic error-correcting codes in two symbols," AFCRCTN-57, vol. 103, Air Force Cambridge Research Center, Cambridge, MA, Sept. 1957.
[9] J. E. Meggitt, "Error correcting codes and their implementation,"IRE Trans. Inform. Theory, vol. IT-17, pp. 232-244, Oct. 1961.
[10] S. Lin and D. J. Costello,Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[11] W. W. Peterson and E. J. Weldon.Jr., Error-Correrting Codes. Cambridge, MA: MIT Press, 1972.
[12] H. Fujiwara,Logic Testing and Design for Testability. Cambridge, MA: MIT Press, 1985.
[13] F. F. Tsui,LSI/VLSI Testability Design. New York: McGraw-Hill, 1987.
[14] J. Losq, "Efficiency of random compact testing,"IEEE Trans. Comput., vol. C-27, no. 6, pp. 613-620, June 1976.
[15] R. A. Frohwerk, "Signature analysis: A new digital field service method,"Hewlett Packard J., pp. 2-8, May 1977.
[16] J. E. Smith, "Measures of the effectiveness of fault signature analysis,"IEEE Trans. Comput., vol. C-29, pp. 510-514, June 1980.
[17] J. C. Muzio, F. Ruskey, R. C. Aitken, and M. Serra, "Aliasing probabilities of some data compression techniques," inDevelopments in Integrated Circuit Testing, D. M. Miller, Ed. New York: Academic, 1987.
[18] T. W. Williams, C. W. Starke, W. Daehn, and M. Gruetzner, "Comparison of aliasing probabilities for primitive and non-primitive polynomials, " inProc. 1986 IEEE Int. Test Conf., 1986, pp. 282-288.
[19] N. Benowitz, D. F. Calhoun, G. E. Alderson, J. E. Baver, and C. T. Joeckel, "An advanced fault isolation system for digital logic,"IEEE Trans., Comput., vol. C-24, no. 5, pp. 489-497, May 1975.
[20] S. Z. Hassan, D. J. Lu, and E. J. McCluskey, "Parallel signature analyzers--Detection capabilities and extensions," inProc. COMPCON 83, 1983, pp. 440-445.
[21] R. David, "Signature analysis for multiple-output circuits,"IEEE Trans. Comput., vol. C-35, pp. 830-837, 1986.
[22] D. K. Bhavsar and R. K. Heckelman, "Self testing by polynomial division," inProc. 1981 Int. Test Conf., 1981, pp. 208-216.
[23] J. L. Carter, "The theory of signature testing for VLSI," inProc. 14th Annu. ACM. Symp. Theory Comput., 1982, pp. 66-76.
[24] W. Pries, A. Thanailakis, and H. C. Card, "Group properties of cellular automata and VLSI applications,"IEEE Trans. Comput., vol. C-35, pp. 1013-1024, Dec. 1986.