210 likes | 364 Views
Spectral RTL Test Generation for Microprocessors. Nitin Yogi and Vishwani D. Agrawal Auburn University Department of ECE Auburn, AL 36849, USA. Outline. Microprocessor testing Issues Problem and Approach RTL faults Spectral analysis & test generation Test set compaction RTL DFT
E N D
Spectral RTL Test Generation for Microprocessors Nitin Yogi and Vishwani D. Agrawal Auburn University Department of ECE Auburn, AL 36849, USA VLSI Design Conference 2007
Outline • Microprocessor testing Issues • Problem and Approach • RTL faults • Spectral analysis & test generation • Test set compaction • RTL DFT • Experimental Results • Conclusion VLSI Design Conference 2007
Microprocessor Testing Issues Issues arising from Increased Design Complexity • Increased Test Generation Complexity • Viable Test Method: RTL test generation • Advantages: • Low testing complexity • Early detection of testability issues • Increased Demands on Testing • Viable Test Method: Functional at-speed tests • Advantages: • Better defect coverage • Detection of delay faults VLSI Design Conference 2007
Problem and Approach • The problem is … • Develop an RTL-based ATPG method to generate functional at-speed tests. • And our approach is … • Circuit characterization using RTL: • RTL test generation • Analysis of information content and noise in RTL vectors. • Test generation for gate-level implementation: • Generation of spectral vectors • Fault simulation and vector compaction VLSI Design Conference 2007
Faults Modeled for an RTL Module CombinationalLogic Inputs Outputs RTL stuck-at fault sites FF FF A circuit is an interconnect of several RTL modules. VLSI Design Conference 2007
Walsh Functions and Hadamard Spectrum w0 • Walsh functions form an orthogonal and complete set of basis functions that can represent any arbitrary bit-stream. • Walsh functions are the rows of the Hadamard matrix. • Example of Hadamard matrix of order 8: w1 w2 w3 Walsh functions (order 8) H8 = 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 w4 w5 w6 w7 VLSI Design Conference 2007
Analyzing Bit-Streams Input 1 Input 2 . . . Vector 1 Vector 2 . . . Bit-stream 0 to -1 Bit-stream of Input 2 VLSI Design Conference 2007
Spectral Characterization of a Bit-Stream Bit stream to analyze Correlating with Walsh functions by multiplying with Hadamard matrix. Bit stream Spectral coeffs. Essential component (others regarded noise) Hadamard Matrix VLSI Design Conference 2007
Generation of New Bit-Streams Perturbation Spectral components Generation of new bit-stream by multiplying with Hadamard matrix Essential component retained; noise components randomly perturbed Sign function New bit stream -1 to 0 Bits changed VLSI Design Conference 2007
PARWAN Processor Reference: Z. Navabi, Analysis and Modeling of Digital Systems. New York: McGraw-Hill, 1993. VLSI Design Conference 2007
Power Spectrum for “Interrupt” Bit-Stream Analysis of 128 test vectors. Essential components Some noise components Normalized Power Randomlevel(1/128) Spectral Coefficients VLSI Design Conference 2007
Power Spectrum for “DataIn[5]” Signal Analysis of 128 test vectors. Some essential components Some noise components Normalized Power Theoretical random noiselevel(1/128) Spectral Coefficients VLSI Design Conference 2007
Power Spectrum for Random Signal Analysis of 128 random vectors. Normalized Power Theoretical random noiselevel(1/128) Spectral Coefficients VLSI Design Conference 2007
Selecting Minimal Vector Sequences Using ILP • Fault simulation of new sequences • A set of perturbation vector sequences {V1, V2, .. , VM} is generated. • Vector sequences are simulated and all gate-level faults detected by each are obtained. • Compaction problem • Find minimum set of vector sequences that cover all detected faults. • Minimize Count{V1, … ,VM} to obtain compressed seq. {V1,… ,VC}, where {V1, … ,VC}{V1, … , VM}, andFault Coverage{V1, … ,VC} = Fault Coverage{V1, … ,VM} • Compaction problem is formulated as an Integer Linear Program (ILP) [1]. [1] P. Drineas and Y. Makris, “Independent Test Sequence Compaction through Integer Programming," Proc. ICCD’03, pp. 380-386. VLSI Design Conference 2007
RTL DFT • Goals of DFT: • Improve controllability and observability • Most hard-to-detect faults were experimentally found to have poor observability • XOR tree as DFT • Low area overhead • Low performance penalty • Hard-to-detect RTL faults used for observation test points • 10 observation test points selected XOR tree To test output Hard-to-detect RTL faults VLSI Design Conference 2007
Experimental Results RTL characterization PARWAN processor VLSI Design Conference 2007
Experimental Results Gate-level Fault Coverage *Sun Ultra 5, 256MB RAM VLSI Design Conference 2007
Experimental Results VLSI Design Conference 2007
Experimental Results VLSI Design Conference 2007
Conclusion • Spectral RTL ATPG technique applied to PARWAN processor. • Proposed ATPG method provides: • Good quality “almost” functional at-speed tests • Lower test generation complexity • Enables testability appraisal at RTL • RTL based XOR tree as DFT was found to improve results. • An alternative approach: Use functional vectors instead of RTL vectors. • Yogi and Agrawal, “Spectral Characterization of Functional Vcetors for Gate-Level Fault Coverage Tests,” Proc. VDAT, August 2006 VLSI Design Conference 2007
Thank You ! Questions ? VLSI Design Conference 2007