
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Damiani, P. Olivo, B. Ricco, "Analysis and Design of Linear Finite State Machines for Signature Analysis Testing," IEEE Transactions on Computers, vol. 40, no. 9, pp. 10341045, September, 1991.  
BibTex  x  
@article{ 10.1109/12.83659, author = {M. Damiani and P. Olivo and B. Ricco}, title = {Analysis and Design of Linear Finite State Machines for Signature Analysis Testing}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {9}, issn = {00189340}, year = {1991}, pages = {10341045}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83659}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Analysis and Design of Linear Finite State Machines for Signature Analysis Testing IS  9 SN  00189340 SP1034 EP1045 EPD  10341045 A1  M. Damiani, A1  P. Olivo, A1  B. Ricco, PY  1991 KW  linear finite state machines; signature analysis testing; aliasing error probability; signature analysis; finite automata; logic testing. VL  40 JA  IEEE Transactions on Computers ER   
The authors present a theoretical investigation of the aliasing error probability (AEP) in signature analysis testing by means of linear finite state machines (LFSMs). The equations of the resulting Markov chain model of the LFSM are solved to determine an exact expression of the AEP as a function of the main LFSM features and of the relevant parameters of the testing environment. This expression is used to prove criteria for the synthesis of LFSMs with minimum asymptotic and transient AEP. A fundamental lower bound on the AEP is presented, which represents the performance limit of any LFSM with respect to aliasing minimization. It is shown that the AEP in machines realizing counters mod 2/sup k/1 is the closest to such a bound, in particular periodically reaching it.
[1] R. A. Frohwerk, "Signature analysis: A new digital field services method,"HewlettPackard J., pp. 28, May 1977.
[2] B. Koenemann, J. Mucha, and G. Ziehoff, "Builtin test for complex digital integrated circuits,"IEEE J. Solid State Circuits, vol. SC15, pp. 315319, 1980.
[3] P. D. Hortensius, R. D. McLeod, and H. C. Card, "Cellular automata based logic block observers," inProc. Second Technical Workshop: New Directions for IC Testing, Apr. 1987, pp. 118.
[4] J. A. Abraham and K. Fuchs, "Fault and error models for VLSI,"Proc. IEEE, vol. 74, pp. 639654, 1986.
[5] J. E. Smith, "Measures of the effectiveness of fault signature analysis,"IEEE Trans. Comput., vol. C29, pp. 510514, 1980.
[6] R. David, "Feedback shift register testing," inProc. FTCS 1978, June 1978, pp. 103107.
[7] R. David, "Signature analysis for multipleoutput circuits,"IEEE Trans. Comput., vol. C35, pp. 830837, 1986.
[8] T. W. Williams, W. Daehn, M. Gruetzner, and C. W. Starke, "Bounds and analysis of aliasing errors in linearfeedback shiftregisters,"IEEE Trans. ComputAided Design, vol. CAD7, pp. 7583, Jan. 1988.
[9] I. Ivanov and V. K. Agrawal, "An iterative technique for calculating aliasing probability of linear feedback shift registers," inProc. 18th Int. Symp. Fault Tolerant Comput., Tokyo, Japan, 1988.
[10] M. Damiani, P. Olivo, M. Favalli, and B. Riccò, "An analytical model for aliasing probability in signature analysis testing,"IEEE Trans. Comput.Aided Design, vol. CAD8, pp. 11331144, Nov. 1989.
[11] M. Damiani, P. Olivo, M. Favalli, S. Ercolani, and B. Riccò, "Aliasing errors in signature analysis testing with multipleinput shiftregisters," inProc. IEEE Euro. Test Conf., Apr. 1989, pp. 346353.
[12] A. Hlawiczka, "Hybrid design of parallel signature analyzers," inProc. IEEE Euro. Test Conf., Apr 1989, pp. 346360.
[13] T. W. Williams and W. Daehn, "Aliasing probability for multipleinput signature analyzers with dependent inputs," inProc. IEEE COMPEURO, May 1989, pp. 120127.
[14] G. Birkhoff and S. MacLane,A Survey of Modern Algebra. New York: Macmillan, 1977.
[15] M. S. Bartlett,An Introduction to Stochastic Processes. Champaign: Matrix, 1976.
[16] W. W. Peterson and E. J. Weldon, Jr.,Error Correcting Codes. Cambridge, MA: MIT Press, 1972.
[17] S. W. Golomb,Shift Register Sequences, rev. ed. Laguna Hills, CA: Aegean Park Press, 1982.
[18] T. L. Booth,Sequential Machines and Automata Theory. New York: Wiley, 1967.
[19] L. T. Wang and E. J. McCluskey, "A hybrid design of maximumlength sequence generators," inProc. IEEE Int. Test Conf., Sept. 1987, pp. 3845.
[20] T. W. Williams and W. Daehn, "Aliasing errors in multipleinput signature analysis registers," inProc. IEEE Int. Test Conf., Apr. 1989, pp. 338345.
[21] D. K. Pradhan, S. K. Gupta, and M. G. Karpovsky, "Aliasing probability for multipleinput signature analyzer and a new compression technique," inProc. IEEE BIST Workshop, Mar. 1989.
[22] C. C. McDuffee,Vectors and Matrices, Math. Ass. of Amer., 1961.
[23] A. W. Roberts and D. E. Varberg,Convex Functions. New York: Academic, 1973.