CN101042714A - Compressing method for SOC testing data suitable for suitable for multi-scanning chain designing core - Google Patents

Abstract

This invention relates to one SOC test data compression method for multi-scanning linkage design in SOC test technique, which solves the problems of current method for large volume of data and non-module fault coverage rate with high cost and comprises the following steps: a, ranking the test set TD according to multiple links; b, using similar group to divide formula set; c, ranking each set of decreasing order; d, setting dictionary items number; e, zero plus index code, one plus test section to express each test section to get compressed test set TE.

Description

Be applicable to the compression method of the SOC test data of multi-scanning chain design core

Technical field

What the present invention relates to is the technical field of SOC test of reusable IP (Intellectual Property) core of multi-scanning chain design.

Background technology

Fast development along with microelectric technique, integrated circuit has entered the sub-micro epoch, the size of electron device is more and more littler, chip-scale is increasing, this feasible complication system is integrated on the single chip becomes possibility, in this case, System on Chip/SoC SOC (System on a chip) arises at the historic moment.SOC can be integrated in IP (Intellectual Property) nuclear of multiple function on the independent chip as microprocessor, storer etc., realizes complete systemic-function, thereby has greatly dwindled system bulk, has improved the performance of system.Meanwhile, in SOC integrated, use and to improve design efficiency greatly, shorten the design cycle, reduce the Time To Market of product through the reuse IP core that designs in advance and verify.This new Design Mode has shortened the design cycle for the SOC system integration, has reduced the design risk, but has brought great challenge also for the test of SOC.

In the integrating process of SOC; for to protection of Intellectual Property Rights; core provider can not provide the internal structural information of core usually for SOC integrator; system integration person can only handle it as black box; therefore be difficult to adopt traditional test generation and test compression method to develop practical testing scheme, caused the difficulty of test optimization design.

Meanwhile, in order to reduce design and testing cost, the test of SOC must be rapid and effective, and time and its amount of test data that test a slice SOC is spent are closely-related.Along with the increase of the inner integrated core number of SOC and the complexity of function, corresponding amount of test data also increases sharply thereupon, and the growth of the data storage degree of depth of automatic test equipment (ATE), work clock is comparatively slow, and contradiction between the two is more and more outstanding.Therefore, how effectively reducing amount of test data, shorten the test duration, to improve productive capacity, to reduce testing cost, is the challenge that must face in the SOC test.

In order to solve the test difficult problem of SOC,, has crucial meaning for practical application to the test problem expansion correlation theory of SOC and the research of method.In achievement in research in recent years, the test resource division (Test Resource Partition is a kind of solution more with practical value TRP), mainly can reduce three aspects:

1, (Test Compaction) tightened in test.It mainly is to reduce amount of test data by handling the don't-care bit that test vector concentrates (Don ' t-care bit) that test is tightened, and is divided into two kinds of dynamic consolidation methods and static consolidation methods.Dynamically tighten and be in the process that test generates, to carry out, need to revise the test maker, may in test generates, repeatedly recall, thereby the time that causes testing generation is longer; The static deflation then is to carry out after testing generation, just the test set that generates carried out fault simulation usually, adopt the quantity of corresponding method minimizing test vector, but the coverage rate of non-model fault is affected possibly.

2, built-in self-test (Built-In Self-Test, BIST).BIST also is a kind of method of reduction amount of test data commonly used, is usually used in the test of memory core.Its basic thought is that the test maker that utilizes chip self directly generates test vector on sheet, finishes test, and commonly used have based on linear feedback shift register (LFSR) with based on the method for cellular machine (CA).Because mostly the test vector that BIST generates is pseudo-random vector, so fault coverage is not high, cycle tests is longer.Though can further improve testing efficiency by methods such as Weighted random vector test, mixed mode BIST, along with the expansion of circuit scale, the difficult fault of surveying gets more and more, and the hardware spending that need pay also significantly increases.Therefore the BIST method has only obtained using widely at present in the test of storer, the test of other core that realizes logic function for DSP etc. is still immature, and have only when core possesses the BIST structure, SOC just may consider to adopt the testing scheme of BIST.

3, test compression (Test Compression).The main thought of test compression is to be stored among the ATE through overcompression obtaining test vector in advance, during test, carries out decompress(ion) by the demoder on the chip.This is a kind of lossless compressiong, can guarantee that fault coverage does not reduce.This method is moved into some test resources the chip from ATE, the purpose that reduce amount of test data to reach, shortens the test duration.Achievement in research in this respect mainly contains based on methods such as statistical coding, Run-Length Coding, Golomb coding, FDR coding and VIHC codings at present.When adopting these coding methods to carry out data compression, a hardware decoders cost is generally tens gate leves.Core for the single scan chain design only increases a demoder, and the hardware costs of decoding is little, so these methods are more effective.

In sum, more than three kinds of methods all have separately advantage, in the Test Application scope that it was fit to, all be more effective.Yet when multi-scanning chain was designed the test of core, because of its amount of test data is very big, and existence was for the problem that coverage rate is not high or the decoder hardware cost is excessive of non-model fault.

Summary of the invention

The present invention is for solving existing method of testing when the core to the multi-scanning chain design detects, because of its amount of test data very big, and have the problem that coverage rate is not high or the decoder hardware cost is excessive of non-model fault, and then a kind of compression method that is applicable to the SOC test data of multi-scanning chain design core that provides.

Test data compressing method step of the present invention is:

Step 1, test set TD is arranged according to the multi-scanning chain form, promptly represent that with the form of test fragment test vector gathers according to core internal scan chain quantity;

Step 2, adopt approximate partitioning algorithm (MDCP), test fragment is divided into groups, make that all test vectors in same group can represent that each organizes usefulness with same test fragment according to the compatibility of test fragment based on the maximal degree summit $G_i=\{s_{i1},s_{i2},\mathrm{LL},s_{i{n}_i}\}$ Expression is divided into the group into k, 1≤i≤k, wherein s _IjRepresent j test fragment in the i group, the i group comprises n _iIndividual test fragment, i, j, k is integer;

Step 3, according to each the group in test fragment number n _iEach group is pressed descending sort;

Step 4, set dictionary entry quantity E,, determine a dictionary index and dictionary entry for every group, finish the establishment of dictionary for the preceding E group test fragment after the ordering according to the hardware capabilities of decompression circuit;

Step 5, for the group of the preceding E after ordering test fragment, each fragment is with " 0+ index coding " expression, for back K-E group test fragment, each fragment is represented with " 1+ test fragment ", and the test set T after obtaining compressing _E

The test data that the present invention can directly utilize core manufacturer to provide, and be indifferent to circuit inner structure, do not needing to carry out under the condition that fault simulation and test generate and can compress the test data that multi-scanning chain designs core.This method can guarantee that the test set after the compression still has higher fault coverage,, and the decoder hardware scale is less.The present invention is applicable to the test based on the SOC of reuse IP core design; After using this test data compressing method, only need a passage to drive the multi-strip scanning chain of core inside between ATE and the hardware decompression circuit, reduced the ATE number of channels; The present invention indicates the index dictionary with frequency and organically combines based on the test fragment group technology of MDCP, can reduce amount of test data effectively, improves efficiency of data compression.

Embodiment

Embodiment one:

The test data compressing method step of present embodiment is:

Step 1, test set TD is arranged according to the multi-scanning chain form, promptly represent that with the form of test fragment test vector gathers according to core internal scan chain quantity;

Step 2, adopt approximate partitioning algorithm (MDCP), test fragment is divided into groups, make that all test vectors in same group can represent that each organizes usefulness with same test fragment according to the compatibility of test fragment based on the maximal degree summit $G_i=\{s_{i1},s_{i2},\mathrm{LL},s_{i{n}_i}\}$ Expression is divided into the group into k, 1≤i≤k, wherein s _IjRepresent j test fragment in the i group, the i group comprises n _iIndividual test fragment, i, j, k is integer;

Step 3, according to each the group in test fragment number n _iEach group is sorted by falling power;

Step 4, set dictionary entry quantity E,, determine a dictionary index and dictionary entry for every group, finish the establishment of dictionary for the preceding E group test fragment after the ordering according to the hardware capabilities of decompression circuit;

Step 5, for the group of the preceding E after ordering test fragment, each fragment is with " 0+ index coding " expression, for back K-E group test fragment, each fragment is represented with " 1+ test fragment ", and the test set T after obtaining compressing _E

The step based on approximate the partitioning algorithm (MDCP) on maximal degree summit described in the test data compressing method step 2 of this embodiment is:

Step 1, according to the compatibility relation between the test fragment set up non-directed graph G=(V, E), wherein a test fragment is represented on each summit, if having compatibility relation between certain two test fragment, then between these two points with the connection of nonoriented edge;

Step 2, in G, seek the some v of number of degrees maximum;

Step 3, set up subgraph H, H is made of the summit that all link to each other with v;

Step 4, that search has maximum neighbours' public vertex in subgraph H is right, and it is right to merge this summit, all limits of promptly deleting these two points and drawing, all limits that increase a super node and draw;

Step 5, renewal subgraph H, figure G;

Step 6, if still there is the limit in figure among the G, i.e. E ≠ Φ, then repeating step 2, otherwise stop computing, obtain k super node.

The test fragment method of grouping: for the frequency of occurrences that makes each test fragment concentrated relatively, promptly more in order to guarantee the number of times that is cited than short index, a crucial step is that test fragment is divided into groups, make same group of interior test fragment perhaps identical mutually in twos, test fragment on the same group can be merged into a new segment, and it is the least possible always to organize number.We are referred to as test fragment grouping problem this problem, can abstractly be the group's partition problem (Clique-Partition) in the graph theory.(V E) represents each test fragment and correlativity thereof, and the formation of G is carried out according to following rule: a test fragment is represented on each summit of figure G, so vertex set { v with non-directed graph G=for we ₁, v ₂..., v _lRepresented l test fragment; If there is perhaps identical relation mutually between certain two test fragment, then have a limit between Dui Ying two summits, so the set E on limit has embodied the correlativity between the test vector.If subgraph H=(S, the E of G _H) in all have a limit between any two summits, claim that then subgraph H is the complete subgraph of G, the vertex set S of subgraph H is the group of G.The task of group's partition problem will be schemed G exactly and be divided into several groups, the minimum number of diplomatic corps.

Claims (2)

1, be applicable to the compression method of the SOC test data of multi-scanning chain design core, it is characterized in that its test data compressing method step is:

Step 1, according to core internal scan chain quantity with test set T _DArrange according to the multi-scanning chain form, promptly represent the test vector set with the form of test fragment;

Step 2, adopt approximate partitioning algorithm (MDCP), test fragment is divided into groups, make that all test vectors in same group can represent that each organizes usefulness with same test fragment according to the compatibility of test fragment based on the maximal degree summit $G_i={\{s}_{i1},s_{i2},\mathrm{L\; L},s_{{\mathrm{in}}_i}\}$ Expression is divided into the group into k, 1≤i≤k, wherein s _Ij, represent j test fragment in the i group, the i group comprises n _iIndividual test fragment, i, j, k is integer;

Step 3, according to each the group in test fragment number n _iEach group is pressed descending sort;

Step 4, set dictionary entry quantity E,, determine a dictionary index and dictionary entry for every group, finish the establishment of dictionary for the preceding E group test fragment after the ordering according to the hardware capabilities of decompression circuit;

Step 5, for the group of the preceding E after ordering test fragment, each fragment is with " 0+ index coding " expression, for back K-E group test fragment, each fragment is represented with " 1+ test fragment ", and the test set T after obtaining compressing _E

2, the compression method that is applicable to the SOC test data of multi-scanning chain design core according to claim 1 is characterized in that the step based on approximate the partitioning algorithm (MDCP) on maximal degree summit described in the test data compressing method step 2 is:

Step 1, according to the compatibility relation between the test fragment set up non-directed graph G=(V, E), wherein a test fragment is represented on each summit, if having compatibility relation between certain two test fragment, then between these two points with the connection of nonoriented edge;

Step 2, in G, seek the some v of number of degrees maximum;

Step 3, set up subgraph H, H is made of the summit that all link to each other with v;

Step 4, that search has maximum neighbours' public vertex in subgraph H is right, and it is right to merge this summit, all limits of promptly deleting these two points and drawing, all limits that increase a super node and draw;

Step 5, renewal subgraph H, figure G;

Step 6, if still there is the limit in figure among the G, i.e. E ≠ Ф, then repeating step 2, otherwise stop computing, obtain k super node.