Patent Publication Number: US-5027353-A

Title: Method for testing interconnections

Description:
TECHNICAL FIELD 
     This invention relates to a technique for generating a set of signals (test vectors) for input to a circuit to cause the circuit to generate a response signal indicative of the integrity of the interconnections therein. 
     BACKGROUND OF THE INVENTION 
     Each circuit on a printed wiring board is tested by applying a test signal to a first set of circuit nodes and then measuring the response at a second set of nodes, each connected to one of the first set along a circuit path. The circuit path between nodes typically includes a &#34;net&#34; which is defined as an equipotential surface (e.g., a metallized path on the board) which connects at least one signal transmitter (&#34;driver&#34;) to at least one signal receiver (&#34;receiver&#34;). If the circuit is operating properly, i.e., the receivers and drivers are functioning properly and the nets are not shorted or open, then the response or signature of the circuit to the test signal should correspond to the test signal itself. On the other hand, if the circuit operation is faulty because two or more nets are shorted or one or more nets is open, then the circuit generates a signature which does not correspond to the test signal. 
     Typically, each test signal applied to the first set of circuit nodes usually takes the form of a parallel test vector comprised of n bits (ones or zeros), where n is the number of nets. Each of the bits in the test vector is applied to a separate one of the nodes in unison or parallel with the other bits, hence the reason for using the term parallel to describe the test vector. The particular sequences of the bits in the parallel test vectors is selected to reveal the shorts and opens among the nets as well as any &#34;stuck-at&#34; faults at the receivers or drivers. A stuck-at fault is present if the driver or receiver always produces a one or zero at its output regardless of whether a one or zero is at its inputs. 
     It is well known in the art that at least  log (n) separate parallel test vectors are required to determine the integrity of the n nets. At least log (n+2) vectors are required if the stuck-at faults are to be detected as well. The reason for the additional two vectors is that detection of a stuck-at fault requires that both a zero and one must be applied (in sequence) to the net. A sequential test vector (as defined hereafter) which contains all zeroes or all ones will not satisfy this constraint. 
     A simple set of parallel test vectors, which will test the integrity of a set of n nets as well as the stuck-at faults, is given by the following matrix where each parallel test vector comprises a separate matrix column. ##STR1## Each row of the above matrix of parallel test vectors corresponds to a sequence of bits applied to each net over time. For this reason, each matrix row is often referred to as a sequential test vector. As may be appreciated, the sequential test vectors of this set monotonically increase in value; hence, the above set of parallel test vectors id described as a &#34;counting&#34; sequence. 
     The counting sequence of parallel test vectors, while compact in terms of the numbers of vectors it contains, does not afford good diagnostic capability. In other words, the response of the circuit following receipt of the parallel test vectors does not yield a good determination of which of the nets is open or shorted. In particular, the counting sequence of test vectors can give rise to two different types of incorrect responses, each defined as a &#34;syndrome.&#34; The first type of syndrome, known as the &#34;aliasing&#34; syndrome, occurs when the response generated by a circuit having a faulty set of nets is the same as one having a fault-free set of nets, making it impossible to distinguish between them. The second type of syndrome is the &#34;confounding&#34; syndrome which occurs when the response of a circuit having only a single shorted net is the same as the response when several nets are shorted. These two syndromes are not mutually exclusive; both can occur. 
     The aliasing and confounding syndromes can be avoided by use of the &#34;walking one&#34; sequence of test vectors shown in matrix form below. ##STR2## 
     As with the test vector matrix which produces the counting sequence, each column in the test vector matrix which produces the walking one sequence represents a parallel test vector of n bits whereas each row represents a sequential test vector of n bits. The reason why the sequence obtained by the above matrix is described by the term &#34;walking one&#34; is that the &#34;1&#34; shifts or walks from left to right from the first to the nth sequential test vector. An important attribute of the walking one sequence of test vectors is its property of diagonal independence, i.e., the sequence of bits along the matrix diagonal is all ones. This property allows the walking one sequence to completely diagnose all faulty nets. 
     The disadvantage of the walking one sequence is that n, rather than  log (n+2) vectors are required, making this sequence very large. As a consequence, the amount f time required for testing is increased since a larger number of vectors must be input, in sequence, to the circuit. 
     Thus, there is a need for a technique for generating a reasonably compact set of test vectors which provides good diagnostic capability. 
     SUMMARY OF THE INVENTION 
     Briefly, the invention is directed to a technique for testing a circuit to verify the integrity of its n interconnections (nets) by sequentially applying each of a plurality of bits to each of the nets, and then detecting the response to each vector. Each of the sequential test vectors is generated by first selecting the number (p) of bits therein where  log (n+2) ≦p≦n. The n nets are then ordered. Thereafter, a sequential test vector is established for each of the n ordered nets by setting each of the p bits to a one or zero so that the vector&#39;s weight (i.e., the number of ones) is no greater than the weight of the test vector assigned to the next ordered net. 
     By generating each sequential test vector such that its weight is no greater than that of the sequential vector assigned to the next ordered net, the likelihood of aliasing is reduced because, when a short occurs, the weight of the resultant response vector will be greater than the weight of the individual test vectors. In other words, the response vector contains more ones than any of the test vectors assigned to a particular net. (It is assumed that the effect of the short is to logically &#34;OR&#34; the individual signals as the shorted nets. By complimenting the test vector matrix, the case for shorts which are logically &#34;ANDED&#34; can be addressed.). 
     In accordance with another aspect of the invention, a matrix of test vectors which affords better diagnostic capability can be generated from a knowledge of how many adjacent nets are likely to be shorted together. To practice this technique, the nets int eh circuit are adjacency ordered such that the net n i  is more adjacent to (i.e., is more likely to be shorted with) the net n i+1  than with the net n i+2 . After the nets have been adjacency ordered, then the length p (the number of bits) of each of the sequential test vectors (i.e., the length of each row of vectors in the test vector matrix) is established to unambiguously verify the integrity of the n nets. In practice p can be given by E where E is the maximum number of adjacent nodes that may be shorted, using the following formula: ##EQU1## Thereafter, the matrix of test vectors is established by first generating sets of unique sequential test vectors, each set comprised of a group of vectors which have the same potential weight and which are diagonally independent. The potential weight of the sequential test vector is given by j-i+1 and i and j are the lowest and highest order bits in the vector which are each a one, provided that j-i+1&gt;0; otherwise the weight is zero. Once the sets of sequential test vectors are generated, the sets are concatenated, with each set having a successively larger potential weight, until the resultant set (matrix) has n rows. 
     An advantage of this method is that for each of the E nets, complete diagnostic capabilities are assured by the diagonal independence of the vectors applied thereto. Yet, the size of the overall vector set (the value of p) is less than n, making it compact. 
    
    
     BRIEF DESCRIPTION OF THE DRAWING 
     FIG. 1 is a simplified view of a prior art circuit containing a plurality of nets to be tested; 
     FIG. 2 is a block schematic diagram of a prior art test system. 
    
    
     DETAILED DESCRIPTION 
     FIG. 1 is a block schematic diagram of a prior art circuit 10 which is carried on a circuit board 12 which may also carry other circuits (not shown). The circuit 10 is comprised of a plurality of signal-supplying elements (&#34;drivers&#34;) 14, one or more of which are coupled in parallel by a separate one of a set of nets 16 to one or more of a set of signal-receiving elements (&#34;receivers&#34;) 18. The nets 16, which are n in number (where n=4 in FIG. 1) each take the form of metallic path on the board 12, or a wire which is equipotential thereacross. In a preferred embodiment, the drivers 14 and the receivers 18 each take the form of a buffer. 
     The proper operation of the circuit 10 requires that each of the drivers 14 and the receivers 18 be functioning properly and that none of the nets 16 be open or shorted to each other. Referring now to FIG. 2, there is shown a prior art test system 20. The test system 20 comprises a test and diagnostic processor 22 which is coupled to memory 24 which stores a plurality of test signals, typically in the for of vectors which are input from the memory to the circuit 10. Upon receipt of each test signal, the circuit 10 produces a response signal which is indicative of the circuit operation. The response signals are stored in a memory 26. 
     The test vectors are each comprised of n bits (either a one or zero) which are applied in parallel to a first set of n nodes, each coupled (either directly, or through a receiver 14) to one end of a separate one of the nets 16. Since the bits of each test vector are applied in parallel, it is useful to describe the vectors as &#34;parallel&#34; vectors. When each parallel test vector is applied, the response signal appears at each of a second set of nodes, each coupled to the other end of a separate one of the nets 16. Like each test vector, each response signal comprises a vector of at least n bits which are each a one or zero. When the driver 14 and the receivers are operating correctly, and the nets 16 are fault-free (no shorts or opens), each bit in the response vector substantially mirrors or corresponds to a corresponding bit of the parallel test vector. On the other hand, if one of the n nets 16 is faulty, then the response signal will not correspond to the associated test vector. 
     The quality of the test depends on the n umber (p) of unique (different) parallel test vectors that are applied to the first set of nodes. It is known that  log (n+2) unique parallel vectors will generally suffice to detect all faults. However, using a set of  log (n+2) vectors, such as the set which yields the well-known counting sequence described at the outset of the specification, generally does not afford good diagnostic capability. In other words, this type of sequence does not afford the ability to differentiate between those responses (syndromes) which represent a faulty condition and one which is fault-free, nor the ability to detect whether one or ore of the nets 16 is shorted. 
     By employing n separate test vectors arranged in the walking one sequence described at the outset of the specification, a complete diagnosis can be had. As compared to the counting sequence, which requires  log (n+2) parallel test vectors, the walking one sequence is much less compact (i.e., more parallel test vectors are required). In many instances, constraints are placed on the time required to test the circuit 10, often making it difficult to sequentially transmit n unique parallel test vectors. Thus, the process of constructing the test vectors applied to test the circuit 10 requires a trade-off between testing speed versus fault ambiguity (i.e., the ability to detect which nets are indeed faulty). 
     In accordance with the invention, a set of unique parallel test vectors, which is both compact and which provides lower fault ambiguity, can be obtained by generating n unique sequential test vectors which have a minimum weight (i.e., a minimum number of &#34;one&#34; bits. When referring to a set (matrix) of parallel test vectors, each row of the matrix represents a separate sequential test vector, i.e., the sequence of bits applied to a corresponding net 16 over time. The number of sequential test vectors (i.e., the number of matrix rows) is generally fixed at n, the number of nets 16. 
     On the other hand, the size (number of bits) of each sequential test vector is generally a variable, and will be represented by the letter p. The number (p) of parallel test vectors (i.e., the number of bits in each sequential test vector) depends on the desired level of fault ambiguity. By providing a greater number of parallel test vectors, the fault ambiguity becomes smaller, at the cost of increasing the length of the test. The instant technique does not fix the length of the sequential test vectors (i.e., the number p of parallel test vectors). Rather, the technique serves to improve diagnostic ability of the set of p parallel test vectors regardless of the value of p. Thus, the number p of parallel test vectors can be arbitrarily chosen, provided that  log +2) ≦p≦n. 
     Once the desired number p of parallel test vectors is chosen, then the next step is to order the nets 16, i.e., assign a numerical value of identity to each one. For discussion purposes the nets 16 will be ordered 16 1 ,16 2 . . . 16 n , respectively. The reason for ordering the nets 16 is to establish an order for the n sequential test vectors to be generated since each net has an associated sequential test vector. After ordering the nets 16, a unique sequential test vector is then generated and assigned to each of the nets such that the vector assigned to the net 16 i  has a weight (a &#34;ones&#34; count) no greater than that of the vector assigned to the net 16 i+1 . The number of unique sequential test vectors that can have a given weight w is p. Thus, the maximum weight (w max ) of the assigned sequential test vectors will be given by the minimum of the w max  for which the following is true: ##EQU2## 
     Actual generation of the independent sequential test vectors can be accomplished as follows: 
     (1) first, generate a sequential test vector of a minimum weight (initially equal to one); 
     (2) generate another sequential test vector of a minimum weight which is independent of (e.g., unique from) the previously generated vector(s); 
     (3) repeat step (2) until all unique sequential test vectors of the minimum weight are obtained; 
     (4) increase the minimum weight by 1; 
     (5) repeat the steps of (1)-(4) until n sequential test vectors are obtained. 
     Generation of the first initial test vector of the minimum weight of one is easily done by setting the first bit of an n bit vector to one while the rest of the bits are set at zero. Generating each of the next p-1 independent sequential vectors can be done by &#34;walking a one&#34; across the vectors. Walking a one across the vectors is accomplished by setting the next lower order bit (going from left to right) of each succeeding vector to a one with the other bits set to a zero. 
     To obtain the next set of unique sequential test vectors of the next higher weight, the highest order bit is held at a one and then a one is walked across the vectors. Thereafter, the next highest order bit is held at a one (the highest order bit now zero) and a one is again walked across the vectors. Each successively lower order bit is held at a one (the preceding bits being zero) and a one is walked across the vectors until all unique vectors at that weight are generated. 
     The next set of unique vectors, if they need to be generated, is produced in the same say except that the first and second highest order bits are held at a one, and then a one is walked across the vectors. Then the next two highest order bits are held at a zero in exactly the same way as before. For each set of vectors of the next higher weight, the number of the higher order bits held at a one is successively increased by 1. 
     A sample set of sequential test vectors produced by the technique is reproduced below. 
     
                       TABLE 1                                                     
______________________________________                                    
Nets         p-Bit STVs  Weights                                          
______________________________________                                    
16.sub.1     1     0     0   0   1                                        
16.sub.2     0     1     0   0   1                                        
16.sub.3     0     0     1   0   1                                        
16.sub.4     0     0     0   1   1                                        
16.sub.5     1     1     0   0   2                                        
16.sub.6     1     0     1   0   2                                        
16.sub.7     1     0     0   1   2                                        
16.sub.8     0     1     1   0   2                                        
16.sub.9     0     1     0   1   2                                        
.sub. 16.sub.10                                                           
             0     0     1   1   2                                        
.sub. 16.sub.11                                                           
             1     1     1   0   3                                        
.sub. 16.sub.12                                                           
             1     1     0   1   3                                        
______________________________________                                    
 
    
     The vectors in the above table are less likely to give rise to an aliasing than the counting sequence of vectors because the weight of the response vector which is produced when a given pair of the nets 16 1 ,16 2 . . . 16 n  is shorted is far greater than the weight of the test vectors associated with each net. 
     In accordance with another aspect of the invention, a set of parallel test vectors can be produced having even further reduced diagnostic ambiguity when the maximum size or number of adjacent nets 16 which can be shorted is known. As may be appreciated, the most common way of two or more nets 16 of the circuit 10 on the board 12 are shorted is when a blob of solder (not shown) falls on them. Generally such blobs are not very large (on the other of a few centimeters at best) and only a small fraction of the nets 16 of the circuit 10 on the board 12 is spaced a distance apart smaller than the diameter of the solder blob. Thus, the maximum number (E) of the shorted nets 16 is usually only a small percentage of the total number of nets n. 
     In order to obtain such a set of parallel test vectors, it is first necessary to &#34;adjacency-order&#34; the nets 16. The nets 16 are said to be adjacency ordered when the net 16 i  is more likely to be shorted to the net 16 i+1  than to 16 i+2  for 1≦i≦n-2 and that 16 i  is more likely to be shorted to 16 i-1  than 16 i-2  for 3≦i≦n. For discussion purposes, it will be assumed that when the nets 16 are ordered at 16 i ,16 2 . . . 16 n , they are adjacency ordered. 
     Once the nets have been adjacency ordered, the next step is to establish the minimum number of p vectors in the set, given that the maximum number of shorted nets 16 is E. The value of p can be established from the following relationship: ##EQU3## After p has been established, then sets of unique sequential test vectors, having successively increasing potential weight, are generated and thereafter concatenated to yield the desired set of vectors. To understand how this is done, the term &#34;potential weight&#34; must be defined. The potential weight w of a vector is equal to j-i+1 where i and j are the lowest and highest order one bits if the vector&#39;s weight (number of ones) is greater than zero; otherwise w is zero. As an example, each of the vectors (0,1,1,1,0) and (0,1,0,1,0) have a potential weight of 3. 
     To obtain the set of n sequential test vectors, the following method is employed: 
     (1) establish the minimum potential weight (initially set to 1); 
     (2) starting with the first net (16 1 ), sequentially generate a unique vector of the minimum potential weight and assign it to each of the nets 16 in order of their adjacency until all the unique vectors of the same potential weight are generated (typically p for the first set); 
     (3) concatenate the vectors just produced with those previously produced; 
     (4) increase the minimum potential w weight by 1; 
     (5) repeat steps (1)-(4) until n vectors have been produced. For each successive set of vectors of potential weight w after the first set, there will be 2 2-2  sets of vectors each containing p-w+1sequential vectors. Each set of p-w+2 vectors is diagonally independent. 
     The vectors in each of the sets are generated as follows: The vectors in the first set are obtained by setting the highest order bit of the first vector to a &#34;one&#34; and then walking a one across the vectors until all the of p vectors of the set are obtained. The vectors of the next set are obtained by setting the first and second highest order bits equal to one and then walking not just a single one, but the block of ones across the vectors until 2 w-2  (p-w+1) vectors are obtained where w is the potential weight. For the next set, the first and third highest order bits of the first vector are set to a one with the intermediate value set to x where x {0,1}. Each unique block of 1, x,1 is walked across the vectors in succession. For each succeeding set, the initial block has additional intermediate order bit set to x, so that the blocks which are subsequently walked across the vector increase as 1,x,x,1 1, x,x,x,1 etc. 
     The table listed below contains a set of sequential test vectors produced by the above-described steps, for the condition p=4 and n=12. 
     
                       TABLE 2                                                     
______________________________________                                    
Adjacency      STVs        Potential                                      
Ordered Nets   (p bits)    Weights                                        
______________________________________                                    
16.sub.1       1     0     0   0   1                                      
16.sub.2       0     1     0   0   1                                      
16.sub.3       0     0     1   0   1                                      
16.sub.4       0     0     0   1   1                                      
16.sub.5       1     1     0   0   2                                      
16.sub.6       0     1     1   0   2                                      
16.sub.7       0     0     1   1   2                                      
16.sub.8       1     0     1   0   3                                      
16.sub.9       0     1     0   1   3                                      
.sub. 16.sub.10                                                           
               1     1     1   0   3                                      
.sub. 16.sub.11                                                           
               0     1     1   1   3                                      
.sub. 16.sub.12                                                           
               1     0     0   1   4                                      
______________________________________                                    
 
    
     Any consecutive E vectors in the matrix have the property of diagonal independence. Diagonal independence is defined such that a diagonally independent matrix A of size M×N(N≧M) enjoys the property that through some row and/or column interchange A ij , the J-th entry in the i-th row is equal to: ##EQU4## where 
     
         1≦i≦M 
    
     
         1≦j≦N 
    
     
         xε{0,1} 
    
     Test vectors are diagonally independent will always produce responses (syndromes) which are never aliasing or confounding.