
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Christoforos N. Hadjicostis, "Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors," IEEE Transactions on Computers, vol. 54, no. 12, pp. 16141627, December, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.189, author = {Christoforos N. Hadjicostis}, title = {Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {12}, issn = {00189340}, year = {2005}, pages = {16141627}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.189}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors IS  12 SN  00189340 SP1614 EP1627 EPD  16141627 A1  Christoforos N. Hadjicostis, PY  2005 KW  Index Terms Aliasing probability KW  compaction KW  fault activation probabilities KW  random testing. VL  54 JA  IEEE Transactions on Computers ER   
[1] M.L. Bushnell and V.D. Agrawal, Essentials of Electronic Testing. Boston: Kluwer Academic, 2000.
[2] M. Abramovici, M. Breuer, and D. Friedman, Digital Systems Testing and Testable Design. Piscataway, N.J.: IEEE Press, 1990.
[3] J. Rajski and J. Tyszer, Arithmetic BuiltIn SelfTest. Upper Saddle River, N.J.: Prentice Hall, 1998.
[4] P.H. Bardell, W.H. McAnney, and J. Savir, BuiltIn Test for VLSI: Pseudorandom Techniques. New York: John Wiley & Sons, 1987.
[5] T.W. Williams, W. Daehn, M. Gruetzner, and C.W. Starke, “Bounds and Analysis of Aliasing Errors in Linear Feedback Shift Registers,” IEEE Trans. ComputerAided Design, vol. 7, pp. 7583, Jan. 1988.
[6] S.M. Reddy, K.K. Saluja, and M.G. Karpovsky, “A Data Compression Technique for BuildIn SelfTest,” IEEE Trans. Computers, vol. 37, no. 9, pp. 11511156, Sept. 1988.
[7] A. Ivanov and V.K. Agarwal, “An Analysis of the Probabilistic Behavior of Linear Feedback Signature Registers,” IEEE Trans. ComputerAided Design, vol. 8, pp. 10741088, Oct. 1989.
[8] W. Daehn, T.W. Williams, and K.D. Wagner, “Aliasing Errors in Linear Automata Used as MultipleInput Signature Analyzers,” IBM J. Research and Development, vol. 34, pp. 363380, Mar.May 1990.
[9] D.K. Pradhan, S.K. Gupta, and M.G. Karpovsky, “Aliasing Probability for Multiple Input Signature Analyzer,” IEEE Trans. Computers, vol. 39, no. 4, pp. 586591, Apr. 1990.
[10] K. Iwasaki and F. Arakawa, “An Analysis of the Aliasing Probability of MultipleInput Signature Registers in the Case of $2m$ Ary Symmetric Channel,” IEEE Trans. ComputerAided Design, vol. 9, pp. 427438, Apr. 1990.
[11] M. Serra, T. Slater, J. Muzio, and D. Miller, “The Analysis of OneDimensional Linear Cellular Automata and Their Aliasing Properties,” IEEE Trans. ComputerAided Design, vol. 9, pp. 767778, July 1990.
[12] M. Damiani, P. Olivo, and B. Ricco, “Analysis and Design of Linear Finite State Machines for Signature Analysis Testing,” IEEE Trans. Computers, vol. 40, no. 9, pp. 10341045, Sept. 1991.
[13] D.K. Pradhan and S.K. Gupta, “A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression,” IEEE Trans. Computers, vol. 40, no. 6, pp. 743763, June 1991.
[14] M.S. Elsaholy, S.I. Shaheen, and R.H. Seireg, “A Unified Analytical Expression for Aliasing Error Probability Using SingleInput External and InternalXOR LFSR,” IEEE Trans. Computers, vol. 47, no. 12, pp. 14141417, Dec. 1998.
[15] M.S. Elsaholy, “Exact AEP Model in Signature Analysis Using LCM,” IEE Proc. E: Computers and Digital Techniques, vol. 146, pp. 247252, Sept. 1999.
[16] D. Xavier, R.C. Aitken, A. Ivanov, and V.K. Agarwal, “Using an Asymmetric Error Model to Study Aliasing in Signature Analysis Registers,” IEEE Trans. ComputerAided Design, vol. 11, pp. 1625, Jan. 1992.
[17] N. Saxena and E. McCluskey, “Parallel Signature Analysis Design with Bounds on Aliasing,” IEEE Trans. Computers, vol. 46, no. 4, pp. 425438, Apr. 1997.
[18] J.P. Hayes, “Transition Count Testing of Combinational Logic Circuits,” IEEE Trans. Computers, vol. 25, no. 6, pp. 613620, June 1976.
[19] J. Savir, “SyndromeTestable Design of Combinational Circuits,” IEEE Trans. Computers, vol. 29, no. 6, pp. 442451, June 1980.
[20] J.P. Robinson and N.R. Saxena, “A Unified View of Test Compression Methods,” IEEE Trans. Computers, vol. 36, no. 1, pp. 9499, Jan. 1987.
[21] J.P. Robinson and N.R. Saxena, “Simultaneous Signature and Syndrome Compression,” IEEE Trans. ComputerAided Design, vol. 7, pp. 584589, May 1988.
[22] S. Pilarski and K. Wiebe, “On CounterBased Compaction,” Proc. ISCAS 1991, the 1991 IEEE Int'l Symp. Circuits and Systems, vol. 3, pp. 18851888, 1991.
[23] J. Rajski and J. Tyszer, “Test Responses Compaction in Accumulators with Rotate Carry Adders,” IEEE Trans. ComputerAided Design, vol. 12, pp. 531539, Apr. 1993.
[24] J. Rajski and J. Tyszer, “AccumulatorBased Compaction of Test Responses,” IEEE Trans. Computers, vol. 42, no. 6, pp. 643650, June 1993.
[25] K. Chakrabarty and J.P. Hayes, “On the Quality of AccumulatorBased Compaction of Test Responses,” IEEE Trans. ComputerAided Design, vol. 16, pp. 916922, Aug. 1997.
[26] S. Sastry and A. Majumdar, “Test Efficiency Analysis of Random SelfTest of Sequential Circuits,” IEEE Trans. ComputerAided Design, vol. 10, pp. 390398, Mar. 1991.
[27] S. Pilarski, “Comments on `Test Efficiency Analysis of Random SelfTest of Sequential Circuits',” IEEE Trans. ComputerAided Design, vol. 14, pp. 10441045, Aug. 1995.
[28] S. Pilarski, T. Kameda, and A. Ivanov, “Sequential Faults and Aliasing,” IEEE Trans. ComputerAided Design, vol. 12, pp. 10681074, July 1993.
[29] S. Pilarski and K.J. Wiebe, “CounterBased Compaction: Delay and StuckOpen Faults,” IEEE Trans. Computers, vol. 44, no. 6, pp. 780791, June 1995.
[30] G. Edirisooriya and J.P. Robinson, “Performance of Signature Registers in the Presence of Correlated Errors,” IEE Proc. E: Computers and Digital Techniques, vol. 139, pp. 393400, Sept. 1992.
[31] D. Xavier, R.C. Aitken, A. Ivanov, and V.K. Agarwal, “Experiments on Aliasing in Signature Analysis Registers,” Proc. Int'l Test Conf., pp. 344354, 1989.
[32] M. Kopec, “Can Nonlinear Compactors Be Better than Linear Ones?” IEEE Trans. Computers, vol. 44, no. 11, pp. 12751282, Nov. 1995.
[33] V.D. Agrawal, “An Information Theoretic Approach to Digital Fault Testing,” IEEE Trans. Computers, vol. 30, no. 8, pp. 582587, Aug. 1981.
[34] J.G. Kemeny, J.L. Snell, and A.W. Knapp, Denumerable Markov Chains. New York: SpringerVerlag, 1976.
[35] P. Bremaud, Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. New York: SpringerVerlag, 1999.
[36] A. Graham, Kronecker Products and Matrix Calculus with Applications. Math. and Its Applications, Chichester, U.K.: Ellis Horwood Ltd., 1981.
[37] G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, “Markovian Analysis of Large Finite State Machines,” IEEE Trans. ComputerAided Design, vol. 15, pp. 14791493, Dec. 1996.
[38] S. Meyn and R. Tweedie, Markov Chains and Stochastic Stability. New York: SpringerVerlag, 1993.
[39] P.W. Glynn and D. Ormoneit, “Hoeffding's Inequality for Uniformly Ergodic Markov Chains,” Statistics and Probability Letters, vol. 56, pp. 143146, 2002.
[40] N. Saxena, P. Franco, and E. McCluskey, “Simple Bounds on Serial Signature Analysis Aliasing for Random Testing,” IEEE Trans. Computers, vol. 41, no. 5, pp. 638645, May 1992.
[41] E.J. McCluskey, S. Makar, S. Mourad, and K.D. Wagner, “Probability Models for Pseudorandom Test Sequences,” IEEE Trans. ComputerAided Design, vol. 7, pp. 6874, Jan. 1988.
[42] F. Brglez, “On Testability Analysis of Combinational Circuits,” Proc. ISCAS 1984, the 1984 IEEE Int'l Symp. Circuits and Systems, pp. 221225, May 1984.
[43] S.K. Jain and V.D. Agrawal, “Statistical Fault Analysis,” IEEE Design and Test of Computers, vol. 2, no. 1, pp. 3844, Feb. 1985.
[44] S.C. Seth, L. Pan, and V.D. Agrawal, “PREDICT— Probabilistic Estimation of Digital Circuit Testability,” Proc. 15th Int'l Symp. FaultTolerant Computing, Digest of Papers, pp. 220225, June 1985.
[45] S.C. Seth, V.D. Agrawal, and H. Farhat, “A Statistical Theory of Digital Circuit Testability,” IEEE Trans. Computers, vol. 39, vol. 6, pp. 582586, Apr. 1990.
[46] H.A. Farhat and H. Saidian, “Testability Profile Estimation of VLSI Circuits from Fault Coverage,” Proc. First Great Lakes Symp. VLSI, pp. 238242, 1991.
[47] H.A. Farhat and S.G. From, “A Beta Model for Estimating the Testability and Coverage Distributions of a VLSI Circuit,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 12, pp. 550554, Apr. 1993.
[48] M. Dalpasso, M. Favalli, P. Olivo, and J.P. Teixeira, “Realistic Testability Estimates for CMOS IC's,” Electronics Letters, vol. 30, pp. 15931595, Sept. 1994.
[49] H. Farhat, A. Lioy, and M. Poncino, “Computation of Exact Random Pattern Detection Probability,” Proc. IEEE 1993 Custom Integrated Circuit Conf., pp. 26.7.126.7.4, 1993.
[50] F. Brglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran,” Proc. ISCAS 1985, the 1985 IEEE Int'l Symp. Circuits and Systems, pp. 663698, June 1985.
[51] Y. Zorian and V.K. Agarwal, “Optimizing Error Masking in BIST by Output Data Modification,” J. Electronic Testing: Theory and Applications, vol. 1, pp. 5971, 1990.
[52] H.D. Schnurmann, E. Lindbloom, and R.G. Carpenter, “The Weighted Random TestGenerator,” IEEE Trans. Computers, vol. 24, no. 7, pp. 695700, July 1975.
[53] F. Siavoshi, “WTPGA: A Novel Weighted TestPattern Generation Approach for VLSI BuiltIn Self Test,” Proc. Int'l Test Conf., pp. 256262, 1988.
[54] S. BouGhazale and P.N. Marinos, “Testing with Correlated Test Vectors,” Proc. 22nd Int'l Symp. FaultTolerant Computing, Digest of Papers, pp. 256262, 1992.
[55] J. Savir, “Distributed Generation of Weighted Random Patterns,” IEEE Trans. Computers, vol. 48, no. 12, pp. 13641368, Dec. 1999.
[56] J. Savir, G.S. Ditlow, and P.H. Bardell, “Random Pattern Testability,” IEEE Trans. Computers, vol. 33, no. 1, pp. 7989, Jan. 1980.
[57] C.N. Hadjicostis, “Probabilistic Fault Detection in FiniteState Machines Based on State Occupancy Measurements,” Proc. CDC 2002, the 41st IEEE Conf. Decision and Control, vol. 4, pp. 39943999, Dec. 2002.
[58] E. Athanasopoulou and C.N. Hadjicostis, “Aliasing Probability Calculations in Testing Sequential Circuits,” Proc. MED 2003, the 11th Mediterranean Conf. Control and Automation, June 2003.