# Weighted Transition Based Reordering, Columnwise Bit Filling, and Difference Vector: A Power-Aware Test Data Compression Method

Authors: Usha Mehta; K. S. Dasgupta; N. M. Devashrayee
Journal: VLSI Design
 (2011)

---

## Abstract

Test data compression is the major issues for the external testing of IP core-based SoC. From a large pool of diverse available techniques for compression, run length-based schemes are most appropriate for IP cores. To improve the compression and to reduce the test power, the test data processing schemes like “don't care bit filling” and “reordering” which do not require any modification in internal structure and do not demand use of any test development tool can be used for SoC-containing IP cores with hidden structure. The proposed “Weighted Transition Based Reordering-Columnwise Bit Filling-Difference Vector (WTR-CBF-DV)” is a modification to earlier proposed “Hamming Distance based Reordering—Columnwise Bit Filling and Difference vector.” This new method aims not only at very high compression but also aims at shift in test power reduction without any significant on-chip area overhead. The experiment results on ISCAS89 benchmark circuits show that the test data compression ratio has significantly improved for each case. It is also noteworthy that, in most of the case, this scheme does not involve any extra silicon area overhead compared to the base code with which it used. For few cases, it requires an extra XOR gate and feedback path only. As application of this scheme increases run length of zeroes in test set, as a result, the number of transitions during scan shifting is reduced. This may lower scan power. The proposed scheme can be easily integrated into the existing industrial flow.


---

## Body

## 1. Introduction

The testing cost and testing power are the two well-known issues of current generation IC testing [1].The test cost is directly related to test data volume and hence test data transfer time [2]. Test data compression can solve the problem of test cost by reducing the test data transfer time. The dynamic test power plays a major role in overall test power. The switching activity during test has a large contribution in dynamic power and hence in overall test power. The extensive use of IP cores in SoC has further exaggerated the testing problem. Because of the hidden structure of IP cores, the SoCs containing large IP cores can use only those test data compression techniques and switching reduction technique which do not require any modification or insertion in architecture of IP core. These methods should not also demand the use of ATPG, scan insertion, or any such testing tools. They should be capable to use ready-to-use test data coming with IP core for data compression and power reduction. This test data may be partially specified or fully specified. Thus, the current research on IC testing can not be directly applied to the SoC because of the hidden structure of IP core.So it can be inferred that the test data compression and switching reduction in context of hidden structure of IP core is the current need for SoC testing.In literature, there are many test data compression techniques like linear decompression-based, broadcast scan-based, and code-based techniques. Considering to suitability to IP core-based SoC, code-based test data compression scheme is more appropriate. From the various code-based test data compression schemes like dictionary codes, constructive codes, statistical codes, and run length-based codes, the run length-based codes can be more suitable to IP cores because of its simple on-chip decoder and better compression capacity. The do not care bit filling methods and test vector reordering further enhance the test data compression.The switching activity reduction technique described in literature can be broadly classified in three categories: (1) techniques for built-in self-test, (2) techniques applied as design-for-test, and (3) techniques for external testing. Considering the suitability to IP cores, the techniques for external testing can be further explored. Out of various switching reduction techniques for external testing like low-power ATPG, input control, reordering, and do not care bit filling, the do not care bit filling and reordering are applicable for hidden structure of IP core.To improve the compression ratio and to reduce the switching in the most famous run length-based data compression method, in this paper, a new scheme based on three techniques: Hamming distance and weighted transition-based reordering (WTR), columnwise bit filling (CBF), and difference vector (DV) is proposed. This scheme is applied to various test set prior to apply a variety of run based codes, and it gives better result in each of the case. The experiment results show that the test data compression ratio is significantly improved. Moreover, this scheme does not require any on-chip silicon area overhead compared to base run length code with which it is used. With the help of weighted transition-based reordering, the total number of transition during scan-in is also reduced. This method may reduce the overall scan power requirement during testing. Further, the proposed scheme can be easily integrated into the existing industrial flow.The paper is organized as follows: the background for bit filling methods and test vector reordering used for test data compression and test power reduction is covered in Section2. In Section 3, the Hamming distance-based reordering is explained with a motivational example. Section 3 introduces the concept of weighted transition-based reordering. Section 3.3 include the details of run length code used for compression. Experimental results and performance comparison are presented in Section 6 followed by concluding remarks in Section 8.


## 2. Background

### 2.1. Test Data Compression

In 1998, a scheme based on run-length codes that encoded runs of 0 s using fixed-length code words [3] was proposed. The Golomb code [4] encodes runs of 0 s with variable-length code words. The optimization of Golomb is achieved using frequency-directed run-length (FDR) codes [5]. Maleh and Abaji proposed an extension of FDR (EFDR) [6]. The alternating FDR uses runs of 0 s as well as 1 s in alternating fashion [7]. An evolution in alternate run length-based FDR is shifted alternate run length-based FDR [8]. The detailed description on each run length code with one example is given in [9] which also includes the compression, power, and area overhead in case of each run length-based compression code.


#### 2.1.1. Do Not Care Bit Filling

Instead of simply filling all do not care bits with 0 s, if the do not care bits are filled considering the type of run used in particular compression scheme, the better compression can be achieved [10].


#### 2.1.2. Reordering

Stuck at fault-based test patterns can be reordered without any loss of fault coverage. In literature, a number of test vector reordering techniques are proposed for test data compression. The run-based reordering approach [11] is based on reordering the test frames to give the bigger run lengths of 0 s. As this bigger run lengths are than coded with extended FDR, it gives better compression to normal extended FDR. As this approach uses scan frame reordering, it is not suitable to IP cores with hidden structure. The same thing is applicable to [12] which requires a large amount of area overhead to compensate the 2-D reordering. The Hamming distance-based reordering used in [13] is used as the basic scheme in this paper.


### 2.2. Test Power

For the reduction of switching activity in terms of number of transitions during scan operations, the do not care bit filling and reordering techniques are widely used.


### 2.3. Ordering Techniques

The greedy algorithm based reordering process using the minimum Hamming distance between them to reduce the scan power [14]. The concept of finding Hamiltonian cycle in a complete weighted graph is used in [15]. In [16], both scan latch reordering with test vector reordering is considered. Another work [17] has also considered the Hamming distance minimization between adjacent vectors to reduce the dynamic power dissipation during testing. Test vector reordering problem as TSP and genetic algorithm (GA) has been used to generate low-power test patterns in [18]. In [19], an evaluation of different heuristic approaches has been done in terms of execution time and quality. In [20], 2-opt heuristic and a GA-based approach with reduction in fault coverage is introduced. Roy et al. has proposed a test vector reordering technique switching activity reduction in case of combinational circuit with AI [21]. An ant colony optimization-based test vector reordering problem for power reduction is described in [22]. The particle swarm approach is used in [23]. There are few other approaches available in literature for test vector reordering, but, while considering the hidden structure of IP cores, these approaches are not found suitable. For capture power reduction in case of IP core-based SoC, the artificial intelligence-based reordering of scan vector is proposed in [24].


### 2.4. Do Not Care Bit Filling

An automatic test pattern generation (ATPG) scheme for low-power launch-off-capture (LOC) transition test based on do not care bit filling is proposed in [25]. A genetic algorithm based heuristic to fill the do not cares is proposed in [26]. This approach produces an average percentage improvement in dynamic power and leakage power over 0-fill, 1-fill, and minimum transition fill (MT-fill) algorithms for do not care filling. The work in [27] proposed segment-based X-filling to reduce test power and keep the defect coverage. The scan chain configuration tries to cluster the scan flip-flops with common successors into one scan chain, in order to distribute the specified bits per pattern over a minimum number of chains. Based on the operation of a state machine, [28] elucidates a comprehensive frame for probability-based primary-input dominated X-filling methods to minimize the total weighted switching activity (WSA) during the scan capture operation. The work in [29] describes the effect of do not care filling of the patterns generated via automated test pattern generators, to make the patterns consume lesser power. It presents a tradeoff in the dynamic and static power consumption.


## 2.1. Test Data Compression

In 1998, a scheme based on run-length codes that encoded runs of 0 s using fixed-length code words [3] was proposed. The Golomb code [4] encodes runs of 0 s with variable-length code words. The optimization of Golomb is achieved using frequency-directed run-length (FDR) codes [5]. Maleh and Abaji proposed an extension of FDR (EFDR) [6]. The alternating FDR uses runs of 0 s as well as 1 s in alternating fashion [7]. An evolution in alternate run length-based FDR is shifted alternate run length-based FDR [8]. The detailed description on each run length code with one example is given in [9] which also includes the compression, power, and area overhead in case of each run length-based compression code.


### 2.1.1. Do Not Care Bit Filling

Instead of simply filling all do not care bits with 0 s, if the do not care bits are filled considering the type of run used in particular compression scheme, the better compression can be achieved [10].


### 2.1.2. Reordering

Stuck at fault-based test patterns can be reordered without any loss of fault coverage. In literature, a number of test vector reordering techniques are proposed for test data compression. The run-based reordering approach [11] is based on reordering the test frames to give the bigger run lengths of 0 s. As this bigger run lengths are than coded with extended FDR, it gives better compression to normal extended FDR. As this approach uses scan frame reordering, it is not suitable to IP cores with hidden structure. The same thing is applicable to [12] which requires a large amount of area overhead to compensate the 2-D reordering. The Hamming distance-based reordering used in [13] is used as the basic scheme in this paper.


## 2.1.1. Do Not Care Bit Filling

Instead of simply filling all do not care bits with 0 s, if the do not care bits are filled considering the type of run used in particular compression scheme, the better compression can be achieved [10].


## 2.1.2. Reordering

Stuck at fault-based test patterns can be reordered without any loss of fault coverage. In literature, a number of test vector reordering techniques are proposed for test data compression. The run-based reordering approach [11] is based on reordering the test frames to give the bigger run lengths of 0 s. As this bigger run lengths are than coded with extended FDR, it gives better compression to normal extended FDR. As this approach uses scan frame reordering, it is not suitable to IP cores with hidden structure. The same thing is applicable to [12] which requires a large amount of area overhead to compensate the 2-D reordering. The Hamming distance-based reordering used in [13] is used as the basic scheme in this paper.


## 2.2. Test Power

For the reduction of switching activity in terms of number of transitions during scan operations, the do not care bit filling and reordering techniques are widely used.


## 2.3. Ordering Techniques

The greedy algorithm based reordering process using the minimum Hamming distance between them to reduce the scan power [14]. The concept of finding Hamiltonian cycle in a complete weighted graph is used in [15]. In [16], both scan latch reordering with test vector reordering is considered. Another work [17] has also considered the Hamming distance minimization between adjacent vectors to reduce the dynamic power dissipation during testing. Test vector reordering problem as TSP and genetic algorithm (GA) has been used to generate low-power test patterns in [18]. In [19], an evaluation of different heuristic approaches has been done in terms of execution time and quality. In [20], 2-opt heuristic and a GA-based approach with reduction in fault coverage is introduced. Roy et al. has proposed a test vector reordering technique switching activity reduction in case of combinational circuit with AI [21]. An ant colony optimization-based test vector reordering problem for power reduction is described in [22]. The particle swarm approach is used in [23]. There are few other approaches available in literature for test vector reordering, but, while considering the hidden structure of IP cores, these approaches are not found suitable. For capture power reduction in case of IP core-based SoC, the artificial intelligence-based reordering of scan vector is proposed in [24].


## 2.4. Do Not Care Bit Filling

An automatic test pattern generation (ATPG) scheme for low-power launch-off-capture (LOC) transition test based on do not care bit filling is proposed in [25]. A genetic algorithm based heuristic to fill the do not cares is proposed in [26]. This approach produces an average percentage improvement in dynamic power and leakage power over 0-fill, 1-fill, and minimum transition fill (MT-fill) algorithms for do not care filling. The work in [27] proposed segment-based X-filling to reduce test power and keep the defect coverage. The scan chain configuration tries to cluster the scan flip-flops with common successors into one scan chain, in order to distribute the specified bits per pattern over a minimum number of chains. Based on the operation of a state machine, [28] elucidates a comprehensive frame for probability-based primary-input dominated X-filling methods to minimize the total weighted switching activity (WSA) during the scan capture operation. The work in [29] describes the effect of do not care filling of the patterns generated via automated test pattern generators, to make the patterns consume lesser power. It presents a tradeoff in the dynamic and static power consumption.


## 3. Weighted Transition-Based Reordering, Columnwise Bit Filling, and Difference Vector

The earlier proposed Hamming distance-based reordering, column-wise bit filling, and difference vector (HDR-CBF-DV) are taken as the basic scheme for the proposed method. This section includes the introduction to (HDR-CBF-DV) and the proposed modifications.Before continuing the further explanation, the following two terms need to be defined.Hamming Distance
The Hamming distance between two scan vectors is equal to the number of corresponding incompatible bits. This definition is similar to Hamming distance with extension of do not-care bits. For example, given two vectorsV1=(10XX01) and V2=(001X11), the distance d(V1,V2) is 2 because the first and the fifth corresponding bits in the vectors are incompatible.Weighted Transition
For a given test data set containing m vectors withn bits each, the weighted transition for each test vector is given by (1), and the total weighted transition during test is given by (2),(1)Weighted Transitions for Scan-In vectorj=∑i=1n(t(j,i)⊕t(j,i+1))*(n-i),(2)Total Weighted Transitions during test=∑j=1m∑i=1n(t(j,i)⊕t(j,i+1))*(n-i).


### 3.1. Weighted Transition-Based Reordering

If we take each test pattern as a vertex in a complete undirected graphG, and the distance between two patterns as the weight of an edge, then this problem is similar to Hamilton problem, which is NP-hard and solved by various greedy algorithms. The simplest pure greedy algorithm is choosing as the next pattern in a path the one that is closest to the current pattern, provided that it has not been visited yet. It seems that the Hamilton path of G is the solution to our reordering problem.


#### 3.1.1. Selection of First Vector for Reordered Test Set

Hamming Distance-Based Selection
In [13], for the selection of first test pattern, the heuristic that is applied in this scheme is “Hardest Path First.” The test pattern with minimum do not cares will be selected as the first test pattern of reorder list. The reason for selecting the test pattern with minimum do not care bits is that there is a minimum flexibility to stuff the bits later. If more than one test pattern have minimum do not care values than any one vector with the minimum do not care bits each will be selected.Weighted Transition-Based Selection
In WTR-CBF-DV, if there are more than one test vectors with minimum number of do not care bits, each will be evaluated for its weighted transitions, and the vector with minimum weighted transition will be selected as the first test vector of the reordered test set. Further in earlier method, the first vector is kept unfilled until all the test vectors are reordered, but, in the proposed scheme, the selected first vector is MT filled before continuing reordering to make the overall testing and selection of remaining test vectors power aware.


#### 3.1.2. Reordering and Bit Filling of Remaining Test Vector

Hamming Distance-Based Selection
For reordering of the remaining test patterns in [13], the pattern with minimum Hamming distance from first pattern of reordered set will be placed next to first pattern of reordered set. It is decided to take the next vector with minimum Hamming distance because when the further columnwise bit filling and difference vector will be done, this reordered vector sequence will generate maximum zeroes so run length, and hence the compression will increase. In HDR-CBF-DV [13], after completing the reordering of all the vectors, for the second test patterns and onwards, the do not care bit will be replaced with the same value which its upper vector has at the same position. The goal here is to get the maximum zeroes in difference vector.Weighted Transition-Based Selection
During the reordering process for various circuits, it is found that generally the test set contains more than one test vectors with same Hamming distance. This happens because of the structural behavior of faults. This tie should be broken in favor of power reduction. So in the proposed scheme, while selecting the next vector of the reordered test set, if there are more than one vector with the same Hamming distance from the last selected vector of reordered set, then the weighted transition will be taken into consideration. All these equidistance vectors will be applied columnwise bit filling (explained in Section5.2) and their weighted transitions are calculated. The vector with the minimum weighted transitions will be selected as next vector of reordered test set. The do not care bits in this vector will be replaced with the same value which its upper vector has at the same position.


### 3.2. Difference Vector

The next step is to take the difference vector of two consecutive vectors in reordered set. This will further increase the numbers of zeroes and hence data compression. Any run length code can be used to compress the difference vector sequenceTdiff. Let TD={t1;t2;…;tn} be the reordered test set. Tdiff is defined as follows: Tdiff={d1;d2;…;dn}={t1;t1⊕t2;t2⊕t3;…;tn-1⊕tn}, where a bit-wise exclusive or operation is carried out between patterns ti and ti+1. The successive test patterns in a test sequence often differ in only a small number of bits. Therefore, Tdiff contains few 1 s, and it can be efficiently compressed using the FDR code.


### 3.3. Run Length Code for Compression

For the proposed method, the test data will be first preprocessed by WTR-CBF-DV scheme, and then the frequency-directed run length code (FDR) [5, 30] will be applied to preprocess data. The equation of % compression used very frequently in this paper is as follows:(3)Testdatacompressioninpercentage=#oforiginalbits-#ofcompressedbits#oforiginalbits×100%.
The examples in Figure 1 and Table 1 demonstrate this coding style.Table 1
Frequency directed run length code.
Run lengthkGroup prefixTailCode word01000011012210001000301100141010105111011631100001100007001110001-- - -- -- - - - - -Figure 1
Example of frequency-directed run length coding.


## 3.1. Weighted Transition-Based Reordering

If we take each test pattern as a vertex in a complete undirected graphG, and the distance between two patterns as the weight of an edge, then this problem is similar to Hamilton problem, which is NP-hard and solved by various greedy algorithms. The simplest pure greedy algorithm is choosing as the next pattern in a path the one that is closest to the current pattern, provided that it has not been visited yet. It seems that the Hamilton path of G is the solution to our reordering problem.


### 3.1.1. Selection of First Vector for Reordered Test Set

Hamming Distance-Based Selection
In [13], for the selection of first test pattern, the heuristic that is applied in this scheme is “Hardest Path First.” The test pattern with minimum do not cares will be selected as the first test pattern of reorder list. The reason for selecting the test pattern with minimum do not care bits is that there is a minimum flexibility to stuff the bits later. If more than one test pattern have minimum do not care values than any one vector with the minimum do not care bits each will be selected.Weighted Transition-Based Selection
In WTR-CBF-DV, if there are more than one test vectors with minimum number of do not care bits, each will be evaluated for its weighted transitions, and the vector with minimum weighted transition will be selected as the first test vector of the reordered test set. Further in earlier method, the first vector is kept unfilled until all the test vectors are reordered, but, in the proposed scheme, the selected first vector is MT filled before continuing reordering to make the overall testing and selection of remaining test vectors power aware.


### 3.1.2. Reordering and Bit Filling of Remaining Test Vector

Hamming Distance-Based Selection
For reordering of the remaining test patterns in [13], the pattern with minimum Hamming distance from first pattern of reordered set will be placed next to first pattern of reordered set. It is decided to take the next vector with minimum Hamming distance because when the further columnwise bit filling and difference vector will be done, this reordered vector sequence will generate maximum zeroes so run length, and hence the compression will increase. In HDR-CBF-DV [13], after completing the reordering of all the vectors, for the second test patterns and onwards, the do not care bit will be replaced with the same value which its upper vector has at the same position. The goal here is to get the maximum zeroes in difference vector.Weighted Transition-Based Selection
During the reordering process for various circuits, it is found that generally the test set contains more than one test vectors with same Hamming distance. This happens because of the structural behavior of faults. This tie should be broken in favor of power reduction. So in the proposed scheme, while selecting the next vector of the reordered test set, if there are more than one vector with the same Hamming distance from the last selected vector of reordered set, then the weighted transition will be taken into consideration. All these equidistance vectors will be applied columnwise bit filling (explained in Section5.2) and their weighted transitions are calculated. The vector with the minimum weighted transitions will be selected as next vector of reordered test set. The do not care bits in this vector will be replaced with the same value which its upper vector has at the same position.


## 3.1.1. Selection of First Vector for Reordered Test Set

Hamming Distance-Based Selection
In [13], for the selection of first test pattern, the heuristic that is applied in this scheme is “Hardest Path First.” The test pattern with minimum do not cares will be selected as the first test pattern of reorder list. The reason for selecting the test pattern with minimum do not care bits is that there is a minimum flexibility to stuff the bits later. If more than one test pattern have minimum do not care values than any one vector with the minimum do not care bits each will be selected.Weighted Transition-Based Selection
In WTR-CBF-DV, if there are more than one test vectors with minimum number of do not care bits, each will be evaluated for its weighted transitions, and the vector with minimum weighted transition will be selected as the first test vector of the reordered test set. Further in earlier method, the first vector is kept unfilled until all the test vectors are reordered, but, in the proposed scheme, the selected first vector is MT filled before continuing reordering to make the overall testing and selection of remaining test vectors power aware.


## 3.1.2. Reordering and Bit Filling of Remaining Test Vector

Hamming Distance-Based Selection
For reordering of the remaining test patterns in [13], the pattern with minimum Hamming distance from first pattern of reordered set will be placed next to first pattern of reordered set. It is decided to take the next vector with minimum Hamming distance because when the further columnwise bit filling and difference vector will be done, this reordered vector sequence will generate maximum zeroes so run length, and hence the compression will increase. In HDR-CBF-DV [13], after completing the reordering of all the vectors, for the second test patterns and onwards, the do not care bit will be replaced with the same value which its upper vector has at the same position. The goal here is to get the maximum zeroes in difference vector.Weighted Transition-Based Selection
During the reordering process for various circuits, it is found that generally the test set contains more than one test vectors with same Hamming distance. This happens because of the structural behavior of faults. This tie should be broken in favor of power reduction. So in the proposed scheme, while selecting the next vector of the reordered test set, if there are more than one vector with the same Hamming distance from the last selected vector of reordered set, then the weighted transition will be taken into consideration. All these equidistance vectors will be applied columnwise bit filling (explained in Section5.2) and their weighted transitions are calculated. The vector with the minimum weighted transitions will be selected as next vector of reordered test set. The do not care bits in this vector will be replaced with the same value which its upper vector has at the same position.


## 3.2. Difference Vector

The next step is to take the difference vector of two consecutive vectors in reordered set. This will further increase the numbers of zeroes and hence data compression. Any run length code can be used to compress the difference vector sequenceTdiff. Let TD={t1;t2;…;tn} be the reordered test set. Tdiff is defined as follows: Tdiff={d1;d2;…;dn}={t1;t1⊕t2;t2⊕t3;…;tn-1⊕tn}, where a bit-wise exclusive or operation is carried out between patterns ti and ti+1. The successive test patterns in a test sequence often differ in only a small number of bits. Therefore, Tdiff contains few 1 s, and it can be efficiently compressed using the FDR code.


## 3.3. Run Length Code for Compression

For the proposed method, the test data will be first preprocessed by WTR-CBF-DV scheme, and then the frequency-directed run length code (FDR) [5, 30] will be applied to preprocess data. The equation of % compression used very frequently in this paper is as follows:(3)Testdatacompressioninpercentage=#oforiginalbits-#ofcompressedbits#oforiginalbits×100%.
The examples in Figure 1 and Table 1 demonstrate this coding style.Table 1
Frequency directed run length code.
Run lengthkGroup prefixTailCode word01000011012210001000301100141010105111011631100001100007001110001-- - -- -- - - - - -Figure 1
Example of frequency-directed run length coding.


## 4. Algorithm for WTR-CBF-DV

(1)
Consider a digital circuit withn scan flip-flops, p inputs, and q outputs. The ATPG generated partially specified test set with m scan-in test vectors, and each of n bits is the input to this algorithm.(2)
Find test vector with minimum number of do not care bits in the given test set.(3)
If there are more than one vector with minimum do not care bits, then
(i)
apply MT fill to each vector,(ii)
calculate weighted transition for each vector,(iii)
select the MT-filled vector with minimum WT as first vector of reordered set.(4)
Find the Hamming distance of remaining each vectors from the first vector of reordered set.(5)
Select the vector with minimum Hamming distance as next vector.(6)
If there are more than one vector with minimum Hamming distance, then
(i)
apply columnwise bit fill to each vector, that is, replace the do not care bit of the vector with the same position bit value of last selected vector,(ii)
calculate weighted transition for each vector, and(iii)
select the columnwise bit filled vector with minimum WT as next vector of reordered set.(7)
Repeat step (6) until all the vectors are reordered.(8)
Apply difference vector mechanism.
(i)
First vector of reordered set is kept unchanged.(ii)
From the second vector onward, if the same position bits in last vector and current vector are same, replace the bit with 0 else 1.(9)
Apply frequency-directed run length code.


## 5. Motivation Example

Considering the following test data, for example,test vector1X100XX01X00X1111X0X0X1010XX10110X00XXX0100XX0XX10XXX0XX101X1X1X10X00X11110X00XXXX00


### 5.1. Selection of First Test Vector of Reordered Set

In the above test data, vectorV3 has the minimum number of do not care bits, that is, 4. Now this vector is minimum transition (MT) filled as shown below:test vectorV310110000000010its corresponding weighted transition as per (1) is 38.


### 5.2. Reordering Remaining Test Vector with Columnwise Bit Filling

After placing theV3 at first place and V1 shifted to position of vector 3, the test set after first line selected and filled is as below:test vectors after first vector reorderedR110110000000010V2111X0X0X1010XXV31X100XX01X00X1V40XX0XX10XXX0XXV5101X1X1X10X00XV611110X00XXXX00Now the Hamming distance of remaining each test vectorV2, V3, V4, V5, and V6 from first reordered vector R1 is 3, 3, 3, 4, and 2 as described in definition of Hamming distance and emphasized in above test set with bold letter. So V6 is selected as next vector of reordered set. After placing V6 as R2, the columnwise bit filling is done.Partially reordered test vectorsR110110000000010R211110000000000V31X100XX01X00X1V40XX0XX10XXX0XXV5101X1X1X10X00XV6111X0X0X1010XXNow the Hamming distance ofV3, V4, V5, and V6 from R2 is calculated as 3, 3, 4, and 2. So V6 is selected as R3.Partially reordered test vectorsR110110000000010R211110000000000R311110000101000V40XX0XX10XXX0XXV5101X1X1X10X00XV61X100XX01X00X1Now the remaining all threeV4, V5, and V6 vectors have equal Hamming distance 3 from R3. So each vector will be tried for its weighted transition as if columnwise bit filling is applied to it.Test vectorR311110000101000V401100010101000Applying (1), the weighted transition is equal to 57 for this case.Test vectorR311110000101000V510111010101000Test vectorR311110000101000V611100000100001The same way the possible weighted transitions forV5 and V6 are 67 and 23, respectively, as shown above. So V6 is selected as the next test vector of reordered set. Repeating the reordering process until the last vector is reordered, the final reordered set is as shown bellow:reordered test vectorsR110110000000010R211110000000000R311110000101000R411100000100001R501100010100001R610101010100001


### 5.3. Difference Vector

The next step is to take the difference vector of two consecutive vectors in reordered set to increase the numbers of zeroes and hence data compression. The difference vector set is as shown below:difference test vectorsR110110000000010D201000000000010D300000000101000D400010000001001D510000010000000D611001000000000


### 5.4. Run Length Coding

The difference vector set applied the frequency directed run length coding as described in Section3.3.


## 5.1. Selection of First Test Vector of Reordered Set

In the above test data, vectorV3 has the minimum number of do not care bits, that is, 4. Now this vector is minimum transition (MT) filled as shown below:test vectorV310110000000010its corresponding weighted transition as per (1) is 38.


## 5.2. Reordering Remaining Test Vector with Columnwise Bit Filling

After placing theV3 at first place and V1 shifted to position of vector 3, the test set after first line selected and filled is as below:test vectors after first vector reorderedR110110000000010V2111X0X0X1010XXV31X100XX01X00X1V40XX0XX10XXX0XXV5101X1X1X10X00XV611110X00XXXX00Now the Hamming distance of remaining each test vectorV2, V3, V4, V5, and V6 from first reordered vector R1 is 3, 3, 3, 4, and 2 as described in definition of Hamming distance and emphasized in above test set with bold letter. So V6 is selected as next vector of reordered set. After placing V6 as R2, the columnwise bit filling is done.Partially reordered test vectorsR110110000000010R211110000000000V31X100XX01X00X1V40XX0XX10XXX0XXV5101X1X1X10X00XV6111X0X0X1010XXNow the Hamming distance ofV3, V4, V5, and V6 from R2 is calculated as 3, 3, 4, and 2. So V6 is selected as R3.Partially reordered test vectorsR110110000000010R211110000000000R311110000101000V40XX0XX10XXX0XXV5101X1X1X10X00XV61X100XX01X00X1Now the remaining all threeV4, V5, and V6 vectors have equal Hamming distance 3 from R3. So each vector will be tried for its weighted transition as if columnwise bit filling is applied to it.Test vectorR311110000101000V401100010101000Applying (1), the weighted transition is equal to 57 for this case.Test vectorR311110000101000V510111010101000Test vectorR311110000101000V611100000100001The same way the possible weighted transitions forV5 and V6 are 67 and 23, respectively, as shown above. So V6 is selected as the next test vector of reordered set. Repeating the reordering process until the last vector is reordered, the final reordered set is as shown bellow:reordered test vectorsR110110000000010R211110000000000R311110000101000R411100000100001R501100010100001R610101010100001


## 5.3. Difference Vector

The next step is to take the difference vector of two consecutive vectors in reordered set to increase the numbers of zeroes and hence data compression. The difference vector set is as shown below:difference test vectorsR110110000000010D201000000000010D300000000101000D400010000001001D510000010000000D611001000000000


## 5.4. Run Length Coding

The difference vector set applied the frequency directed run length coding as described in Section3.3.


## 6. Comparison

In Table2, the comparison of % compression, peak power, and average power for various test data processing scheme with FDR coding applied to test data of motivational example is shown in Table 2. Here the column 2 in Table 2 shows the results when test data is applied with MT filling and FDR coding. The peak power and average power is minimum in this case, but the compression is negative. Column 3 is for test data where do not care bits are filled with 0 s and without reordering, the difference vectors are created, and FDR is applied. The columns 4 and 5 represents the results of HDR-CBF-DV and WTR-CBF-DV. As it is seen from these results, the % compression is maximum in case of HDR-CBF-DV and WTR-CBF-DV, while average power is comparable in case of difference vector only, HDR-CBF-DV, and WTR-CBF-DV.Table 2
Comparison of test data processing methods.
MT FillDiff. VectorHDR-CBF-DVWTR-CBF-DV% Compression−2.3817.142916.666716.6667Peak power38818282Average power23.833336.833342.166738.6667


### 6.1. Experiment Results

For the WTR-CBF-DV, the working model is developed using MATLAB7.0 language and then for extensive experimental work, the C language is used. The experiments are conducted on a workstation with an Intel 2 GHz Core2Duo CPU T5750 with 3 GB of memory. The six largest ISCAS89 full-scan circuits have been considered for this experiment. For all ISCAS89 circuits, the test sets (with do not care) obtained from the Mintest ATPG program are used. Tables3, 4, and 5 show the comparison of % compression, average power, and peak power for various ISCAS circuits’ test data with FDR coding when test data applied the following processing prior to FDR coding. (A)
Do not care bits are MT filled, but no reordering is applied.(B)
Do not care bits are filled on the basis of run type, but no reordering is applied.(C)
Do not care bits are filled with 0 s, and difference vector is applied [30].(D)
HDR-CBF-DV applied.(E)
2-D reordering is applied.(F)
WTR-CBF-DV applied.Table 3
Comparison of % compression for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs5378−12.3148.0252.3662.3359.6662.15s9234−20.6743.5947.8061.0661.3563.31s132076.1681.3083.6587.4788.2288.04s15850−17.9166.2268.1872.8473.9673.38s38417−20.3943.2654.566.1865.1366.38s38584−8.9060.9162.4964.7966.0865.21Table 4
Comparison of average power for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs537834333526352611133793410344s9234395840224022143821332913492s1320777357887788711389078856103400s15850135141365913659824217101564275s38417117540118080118080452860486000443030s38584856568630586305410240423260329110Table 5
Comparison of peak power for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs5378115191208512085133271176912822s9234140921539515395178281610617169s132079487911012911012912863895541125392s15850708758436084360960849890396452s38417437884514716514716644262633561660096s38584481158530464530464550037532809551602


## 6.1. Experiment Results

For the WTR-CBF-DV, the working model is developed using MATLAB7.0 language and then for extensive experimental work, the C language is used. The experiments are conducted on a workstation with an Intel 2 GHz Core2Duo CPU T5750 with 3 GB of memory. The six largest ISCAS89 full-scan circuits have been considered for this experiment. For all ISCAS89 circuits, the test sets (with do not care) obtained from the Mintest ATPG program are used. Tables3, 4, and 5 show the comparison of % compression, average power, and peak power for various ISCAS circuits’ test data with FDR coding when test data applied the following processing prior to FDR coding. (A)
Do not care bits are MT filled, but no reordering is applied.(B)
Do not care bits are filled on the basis of run type, but no reordering is applied.(C)
Do not care bits are filled with 0 s, and difference vector is applied [30].(D)
HDR-CBF-DV applied.(E)
2-D reordering is applied.(F)
WTR-CBF-DV applied.Table 3
Comparison of % compression for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs5378−12.3148.0252.3662.3359.6662.15s9234−20.6743.5947.8061.0661.3563.31s132076.1681.3083.6587.4788.2288.04s15850−17.9166.2268.1872.8473.9673.38s38417−20.3943.2654.566.1865.1366.38s38584−8.9060.9162.4964.7966.0865.21Table 4
Comparison of average power for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs537834333526352611133793410344s9234395840224022143821332913492s1320777357887788711389078856103400s15850135141365913659824217101564275s38417117540118080118080452860486000443030s38584856568630586305410240423260329110Table 5
Comparison of peak power for various test data processing methods.
ISCAS circuitMinimum transition fill0 Filling + XOR [30]Run based bit fill maximum limitHDR-CBF-DV2-D ReorderingWTR-CBF-DVs5378115191208512085133271176912822s9234140921539515395178281610617169s132079487911012911012912863895541125392s15850708758436084360960849890396452s38417437884514716514716644262633561660096s38584481158530464530464550037532809551602


## 7. On-Chip Decoder

Any of test data compression methods needs an on-chip decompressor, which loads compressed data from automatic test equipment (ATE) and restores the original test data. The decompressed test data will be transmitted to design under test. The WTR-CBF-DV is a test data processing method applied in conjunction with FDR coding. The same FDR decoder described in [5, 30] is used here. Figure 2 describes the decoder described in [30]. As in this approach, the difference vector is already used, the proposed WTR-CBF-DV does not require any extra on-chip area overhead.Figure 2
On-chip decoder for WTR-CBF-DV.


## 8. Conclusion

In this paper, a scheme comprising of Hamming distance and weighted transition-based reordering (WTR), columnwise bit filling (CBF), and difference vector (DV) for test data compression is proposed. This scheme is applied to preprocess the test data before applying the FDR compression method. The proposed test data processing scheme improves the % compression compared to earlier methods described in literature. Moreover, this method increases the compression beyond the limit of maximum possible compression for run based bit filled data. The peak power and average power is a tradeoff with % compression, but still it is controlled using weighted transition-based reordering. The proposed scheme demands no extra on-chip area overhead compared to earlier methods in literature.



---

*Source: 756561-2011-10-05.xml*