
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tatyana D. Roziner, Mark G. Karpovsky, Claudio Moraga, "Fault Detection in Multiprocessor Systems and Array Processors," IEEE Transactions on Computers, vol. 44, no. 3, pp. 383393, March, 1995.  
BibTex  x  
@article{ 10.1109/12.372031, author = {Tatyana D. Roziner and Mark G. Karpovsky and Claudio Moraga}, title = {Fault Detection in Multiprocessor Systems and Array Processors}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {3}, issn = {00189340}, year = {1995}, pages = {383393}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.372031}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fault Detection in Multiprocessor Systems and Array Processors IS  3 SN  00189340 SP383 EP393 EPD  383393 A1  Tatyana D. Roziner, A1  Mark G. Karpovsky, A1  Claudio Moraga, PY  1995 KW  Fourier transform networks KW  fault detection in VLSI devices KW  data compression (compaction) KW  integrated circuits testing KW  offline testing; VLSI devices testing. VL  44 JA  IEEE Transactions on Computers ER   
We formulate the rules of design for a space compaction matrix for the topology of the circuitundertest (CUT) modeled by an arbitrary acyclic graph. Tree arrays and Fourier transform networks are considered as examples. The lower and upper bounds on the number of space compactor outputs are obtained, and optimal space compaction matrices are determined for above mentioned CUT topologies. Simple procedures for design of offline testing devices with builtin selftesting are presented. Estimations on a complexity of proposed designs are given.
[1] T. Beth., “Verfahren der Schnellen FourierTransformazionen,” Leitfaden der Angewandten Mathematik und Mechanik LAMM, Bd. 61. Stuttgart: B.Teubner, 1984.
[2] J. Bentley and H.T. Kung., “A tree machine for searching problems.” Proc. Int’l. Conf. Parallel Processing, pp.257266, 1979.
[3] M. Damiani,P. Olivio,, and B. Ricco., “Analysis and design of linear finite state machines for signature analysistesting,” IEEE Trans. Computers, vol. 40, pp. 10341045, Sept. 1991.
[4] L. Dornhoff,Group Representation Theory,New York: Marcel Dekker, 1971.
[5] D.F. Elliot and K.R. Rao, Fast Transforms: Algorithms, Analysis, Applications. London: Academic Press, 1982.
[6] H. Fujiwara, Logic Testing and Design for Testability. MIT Press, 1985.
[7] R.A. Frohwerk., “Signature Analysis: a new digital field services method.” HewlettPackard Journal, pp.28, May 1977.
[8] J.P. Hayes., “Transition count testing of combinational logic circuits,” IEEE Trans. Computers, vol. 23, pp. 613620, June 1976.
[9] M.C. Howells and V.K. Agrawal., “A reconfiguration scheme for yield enhancement of large area binary treearchitectures.” IEEE Trans. Computers, vol. 37, pp.463468, April 1988.
[10] T.C. Hsiao and S.C. Seth., “An analysis of the use of RademacherWalsh spectrum in compacttesting.” IEEE Trans. Computers, vol. 33, pp.934937, Oct. 1984.
[11] M.G. Karpovsky., Finite Orthogonal Series in the Design of Digital Devices,New York: Wiley, 1976.
[12] M.G. Karpovsky and P. Nagvajara, “BoardLevel Diagnosis by Signature Analysis,” Proc. Int'l Test Conf., pp. 4753, 1988.
[13] M.G. Karpovsky and P. Nagvajara., “Design of selfdiagnostic boards by signature analysis,” IEEE Trans. Industrial Electronics, vol. 36, pp. 241245, February 1989.
[14] M.G. Karpovsky,L.B. Levitin,, and F.S. Vainstein., “Diagnosis by signature analysis of test responses,” IEEE Trans. Computers, vol. C43, pp.141153, February 1994.
[15] J.C. Muzio,D.M. Miller., “Spectral techniques for fault detection,” Proc. 12th Int’l. Symp. Fault Tolerant Computing, pp. 297302, 1982.
[16] F.J. MacWilliams and N.J.A. Sloane., Theory of ErrorCorrecting Codes, North Holland Publishing, 1978.
[17] C.A. Mead and L.A. Conway., “Hierarchically organized machines.” Introduction to VLSI Systems, Ch. 8, Reading, Mass: Addison  Wesley, 1980.
[18] E.J. McCluskey., “Builtin selftest techniques”and“Builtin selftest structures,” IEEE Design and Test of Computers, pp. 2136, April 1985.
[19] E.J. McCluskey. Digital test principles, Stanford Logical Systems Institute, 1991.
[20] J. O’Brien,J. Mather,, and B. Holland., “A 200 MIPS singlechip 1K FFT processor,” IEEE Int’l. SolidState Circuits Conf., 1989, THPM 12.5.
[21] S. Pilarsky and K. Wiebe., “Counterbased compaction: an analysis for BIST,” Technical Report CSS/LCCR TR 9102, Simon Fraser University, Feb. 1991.
[22] D.K. Pradhan,S.K. Gupta,, and M.G. Karpovsky., “Aliasing probability in multiple input signature analyzer,” IEEE Trans. Computers, vol. 37, pp. 11511156, Sept. 1988.
[23] T.D. Roziner,M.G. Karpovsky, and L.A. Trachtenberg,"Fast Fourier Transforms Over Finite Groups by Multiprocessor Systems," IEEE Trans. Acc., Speech&Sign. Proc., vol. 38, no. 2, pp. 226240, Feb. 1990.
[24] S.M. Reddy,K.K. Saluja,, and M.G. Karpovsky., “A data compression technique for builtin self test,” Proc. of Int’l. Symp. on Fault  Tolerant Computing, pp. 294299, 1985.
[25] J. Rajski,J. Tyszer,, and B. Salimi., “On the diagnostic resolution of signature analysis,” Proc. ICCAD’90,Santa Clara, Calif, pp. 364367, 1990.
[26] J. Smith., “Measure of effectiveness of fault signature analysis,” IEEE Trans. Computers, vol. 29, pp.510514, June 1980.
[27] A.K. Somani,V.K. Agrawal., “An efficient unsorted VLSI dictionary machine.” IEEE Trans. Computers, vol. 34, pp.841852, Sept. 1985.
[28] J. Savir,“Syndrometestable design of combinational circuits,” IEEE Trans. Computers, vol. 29, pp. 442451, June 1980.
[29] M. Serra et al., "The Analysis of OneDimensional Linear Cellular Automata and Their Aliasing Properties," IEEE Trans. ComputerAided Design, vol. 9, no. 7, pp. 767778, July 1990.
[30] N.R. Saxena and J.P. Robinson, "Accumulator Compression Testing," IEEE Trans. Computers, vol. 35, no. 4, pp. 317321, Apr. 1986.
[31] A.K. Susskind., “Testing by verifying Walsh coefficients,” Proc. of 11th Int’l. Symp. on FaultTolerant Computing, pp. 206  208, 1981.
[32] D.L. Tao, C.R.P. Hartmann, and Y.S. Chen, A Novel Concurrent Error Detection Scheme for FFT Networks IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 198221, Feb. 1993.
[33] E.A. Trachtenberg and M.G. Karpovsky., “Filtering in a communication channel by Fourier transforms over finitegroups,” Spectral Techniques and Fault Detection, M. Karpovsky, ed., New York: Academic, 1985.
[34] J. Van Sas,F. Catthoor,S. Vernalde,M. Wouters,, and H. De Man., “IC realization of a cellular automata based selftest strategy forprogrammable data paths.” Proc. 2nd European Test Conf.,Munich, Ger., pp.3544, 1991.