Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital logic testing
Reexamination Certificate
2000-11-15
2004-01-27
Decady, Albert (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital logic testing
C714S735000, C714S738000, C714S728000
Reexamination Certificate
active
06684358
ABSTRACT:
TECHNICAL FIELD
This invention relates generally to testing of integrated circuits and, more particularly, to the generation and application of test data in the form of patterns, or vectors, to scan chains within a circuit-under-test.
BACKGROUND
Built-in self-test (BIST) is emerging as an attractive alternative to conventional methods of testing microelectronics devices at time of manufacture. In BIST, additional circuitry is added to a circuit-under-test to provide on-chip test-pattern generation, test-response evaluation, and test control. Consequently, BIST is significantly changing the way that integrated circuits are tested. It reduces testing cost by shortening test application time, minimizing the amount of test data that must be stored by an external tester, and reducing tester costs. Its implementation can result in a reduction of the product development cycle and a reduction in the cost of system maintenance.
The basic BIST objectives are on-chip test-pattern generation and test-response compaction. By far the most commonly-used means for generating test patterns on chip are pseudo-random test pattern generators (PRPGs). A PRPG generates a set of test patterns based on an initial value, or seed, loaded into memory elements within the PRPG. The popularity of pseudo-random tests stems from the very simple hardware required to implement the test generation. The two principal forms of PRPGs, which evolved over time and are now commonly in use, are both linear finite state machines: linear feedback shift registers (LFSRs) and one-dimensional linear hybrid cellular automata (LHCAs).
Typically, an LFSR consists of interconnected memory elements (also referred to as flip-flops, stages, cells, etc.) and linear logic elements (such as XOR or XNOR gates). An LFSR of length n can be also represented by its characteristic polynomial h
n
x
n
+h
n−1
x
n−1
+. . . +h
0
, where the term h
i
x
i
refers to the ith flip-flop of the register, such that, if h
i
=1, then there is a feedback tap taken from this flip-flop. Also, h
0
=1.
FIG. 1A
shows a type I LFSR, or Fibonacci generator.
FIG. 1B
shows a type II LFSR, or Galois generator, which uses a shift register with interspersed XOR gates. If an LFSR (of either type) is initialized to a nonzero value, then it can cycle through a number of states before coming back to the initial state. A characteristic polynomial which causes an n-bit LFSR to go through all possible 2
n
−1 nonzero states is called a primitive characteristic polynomial. The corresponding LFSR is often referred to as a maximum-length LFSR, and the resultant output sequence is termed a maximum-length sequence or m-sequence.
An LHCA is a collection of memory cells connected in such a way that each cell is restricted to local neighborhood interactions. These relationships are expressed by rules that determine the next state of a given cell based on information received from its neighbors. For example, if cell c can communicate only with its two neighbors, C−1 and c+1, the so-called rules
90
and
150
are usually employed. The rule
90
can be implemented by a linear logic according to the formula x
c
(t+1)=x
c−1
(t)⊕x
c+1
(t), while the rule
150
satisfies the equation x
c
(t+1)=x
c−1
(t)⊕x
c
(t)⊕x
c+1
(t), where x
c
(t) represents the state of cell c at time t. An example of an LHCA is shown in FIG.
1
C. This automaton features null boundary conditions. That is, the conditions behave as if the boundary always supplies a zero from beyond the automaton to the inputs to the exterior cells. In an alternative embodiment, the LHCA has cyclic boundary conditions in which the inputs to the exterior cells are connected so that the automaton forms a circle. Contrary to the LHCA with null boundary conditions, the LHCA with cyclic boundary conditions is unable to produce an m-sequence.
Although LFSRs and LHCAs can generate a large set of pseudo-random test patterns from one seed, this set seldom provides sufficient fault coverage for a circuit-under-test. At best, 95-96% coverage of stuck-at faults can be achieved, even if test points are added to the circuit-under-test to address random pattern-resistant faults. If higher fault coverage is desired, the pseudo-random test patterns must be supplemented in some way. One supplementing technique is to provide from an external tester additional seeds to the PRPG that target specific faults not detected by the initial seed. Each additional seed generates a set of patterns. Each set, however takes considerable time to generate. Another supplementing technique is to provide fully specified deterministic patterns that bypass the PRPG and target directly the remaining, random pattern resistant faults. This reduces testing time, but increases memory requirements because the external tester memory required to store these “top-up” patterns is significant, often exceeding 50% of the memory required for a complete set of deterministic patterns.
SUMMARY
In accordance with the invention, a method for applying test patterns to scan chains in a circuit-under-test is described and shown herein. The method comprises, in a pseudo-random phase of operation, providing an initial value; generating from the initial value a set of pseudo-random test patterns; and applying the pseudo-random test patterns to the scan chains in the circuit-under-test. In a deterministic phase of operation, the method comprises providing a set of compressed deterministic test patterns; decompressing the compressed deterministic test patterns into decompressed deterministic test patterns; and applying the decompressed deterministic test patterns to the scan chains in the circuit-under-test. The decompressing of a compressed deterministic test pattern into a decompressed test pattern of bits occurs as the compressed deterministic test pattern is being provided. The applying of a decompressed deterministic test pattern to scan chains of the circuit-under-test may occur as a compressed deterministic test pattern is being provided.
In one aspect of the invention, the method may be applied to a circuit comprising a decompressor/PRPG, control circuitry, circuit logic, and scan chains. The control circuitry is coupled to the decompressor/PRPG and operable to cause the decompressor/PRPG to generate, in a pseudo-random phase of operation, a set of pseudo-random patterns and to generate, in a deterministic phase of operation, a set of deterministic test patterns. The scan chains are coupled to the circuit logic and operable to receive test patterns generated by the decompressor/PRPG and to capture responses to the test patterns generated by the circuit logic.
The decompressor/PRPG may include a linear finite state machine that can take various forms, such as a linear feedback shift register or a cellular automaton. The decompressor/PRPG may also include a phase shifter, which may be constructed of linear logic gates.
REFERENCES:
patent: 3614400 (1971-10-01), Farnett
patent: 3700869 (1972-10-01), Low et al.
patent: 4503537 (1985-03-01), McAnney
patent: 4513418 (1985-04-01), Bardell, Jr. et al.
patent: 4602210 (1986-07-01), Fasang et al.
patent: 4687988 (1987-08-01), Eichelberger et al.
patent: 4754215 (1988-06-01), Kawai
patent: 4785410 (1988-11-01), Hamatsu et al.
patent: 4801870 (1989-01-01), Eichelberger et al.
patent: 4860236 (1989-08-01), McLeod et al.
patent: 4959832 (1990-09-01), Bardell, Jr.
patent: 4974184 (1990-11-01), Avra
patent: 5090035 (1992-02-01), Murase
patent: 5138619 (1992-08-01), Fasang et al.
patent: 5173906 (1992-12-01), Dreibelbis et al.
patent: 5268949 (1993-12-01), Watanabe
patent: 5301199 (1994-04-01), Ikenaga et al.
patent: 5325367 (1994-06-01), Dekker et al.
patent: 5349587 (1994-09-01), Nadeau-Dostie et al.
patent: 5369648 (1994-11-01), Nelson
patent: 5394405 (1995-02-01), Savir
patent: 5412665 (1995-05-01), Gruodis et al.
patent: 5414716 (1995-05-01), Bershteyn
patent: 5416783 (1995-05-01), Broseghini et al.
patent: 5446683 (1995-08-0
Kassab Mark
Mukherjee Nilanjan
Rajski Janusz
Tyszer Jerzy
Chaudry Mujtaba
De'cady Albert
Klarquist & Sparkman, LLP
LandOfFree
Decompressor/PRPG for applying pseudo-random and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Decompressor/PRPG for applying pseudo-random and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decompressor/PRPG for applying pseudo-random and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3224509