CN105629155A - Test data dictionary coding method - Google Patents
Test data dictionary coding method Download PDFInfo
- Publication number
- CN105629155A CN105629155A CN201511000161.1A CN201511000161A CN105629155A CN 105629155 A CN105629155 A CN 105629155A CN 201511000161 A CN201511000161 A CN 201511000161A CN 105629155 A CN105629155 A CN 105629155A
- Authority
- CN
- China
- Prior art keywords
- summit
- dictionary entry
- subgraph
- compatible
- maximum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/28—Testing of electronic circuits, e.g. by signal tracer
- G01R31/2851—Testing of integrated circuits [IC]
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/28—Testing of electronic circuits, e.g. by signal tracer
- G01R31/317—Testing of digital circuits
- G01R31/3181—Functional testing
- G01R31/3185—Reconfiguring for testing, e.g. LSSD, partitioning
- G01R31/318533—Reconfiguring for testing, e.g. LSSD, partitioning using scanning techniques, e.g. LSSD, Boundary Scan, JTAG
- G01R31/318544—Scanning methods, algorithms and patterns
- G01R31/318547—Data generators or compressors
Abstract
The invention relates to a test data dictionary coding method which includes the following steps of: generating dictionary entries; aiming at each dictionary entry, performing reverse compatibility analysis, and determining scanning sections reverse compatible with the dictionary entries; and coding each scanning section according to a set rule. The method of generating the dictionary entries also includes the steps that: an undirected graph G is established by taking each scanning section as a vertex, if any two scanning sections are compatible, an edge is formed between the vertexes corresponding to the scanning sections; m maximum complete subgraphes are obtained through a heuristic algorithm, m being the number of default dictionary entries; and the dictionary entry corresponding to each maximum complete subgraph is generated. When the reverse compatibility analysis is performed on the dictionary entries, the heuristic algorithm is introduced. The maximum complete subgraph of the graph formed by the scanning sections reverse compatible with the dictionary entries is found, the coding rule is combined, and a compression ratio of the test data is improved.
Description
Technical field
The present invention relates to digital processing technology field, particularly relate to the dictionary coding method of a kind of test data.
Background technology
Along with the increase of integrated circuit (IC) design scale, amount of test data is level growth exponentially, which results in conventional external automatic test equipment (ATE) and face that memory space inadequate, I/O bandwidth be limited and the test duration crosses the severe problems such as long, testing cost is more and more higher. One of effective ways solved the problem during test data compression, can reduce data transmission period by compression and reduce the requirement to ATE storage capacity.
Usually comprising a large amount of unrelated positions (X-bit) in test data, these unrelated positions can be 0 or 1 by any assignment and can not affect fault fraction of coverage. Therefore adopt suitable encryption algorithm and in conjunction with corresponding unrelated position filling Strategy, it is possible to realize data compression and improve rate of compression. Coding method mainly comprises distance of swimming coding, dictionary encoding and statistical coding three class.
The article " Testdatacompressionusingdictionarieswithselectiveentries andfix-lengthindices " that the people such as L.Li in 2003 deliver proposes dictionary coding method has been carried out mathematical modeling, the problem of choosing of dictionary entry is modeled as the maximum complete subgraph problem finding a undirected figure. The article " adopting the test data compression of dictionary entry spin-off model " that the people such as Liu Jie in 2012 deliver is on this basis, the dictionary entry generated is passed through negate, the modes such as ring shift produce derivative entry, taking increase certain peripheral circuit complexity as cost, it is to increase data compression rate.
The people such as L.Li propose and dictionary coding method are carried out mathematical modeling, only could realize compression when scan slice and dictionary entry are compatible, be directed to not compatible with dictionary entry scan slice, and its coded data does not possess compressibility.
It is compatible with dictionary entry that the people such as Liu Jie consider scan slice to be encoded, oppositely compatible, be shifted the compatible and displacement oppositely situation such as compatible, but when carrying out the differentiation of oppositely compatible and the situation such as compatible that is shifted, do not consider when the utilization of this dictionary entry oppositely compatible (or it is compatible to be shifted) multiple scan slice can be encoded time, how to realize encoding maximum scan slice to realize the problem of high compression rate; And the possibility existed due to consistency is a lot, causes the prefix encoding code word also a lot, rate of compression can be had certain influence.
Summary of the invention
It is an object of the invention to utilize the reverse Analysis of Compatibility result of dictionary entry, and use heuritic approach to find maximum complete subgraph, it is possible to realize high data compression rate.
For achieving the above object, the present invention provides the dictionary coding method of a kind of test data. Comprise the following steps:
Generate dictionary entry; Reverse Analysis of Compatibility is carried out, it is determined that the scan slice oppositely compatible with dictionary entry for each dictionary entry; Encode for scan slice according to the rule of setting.
It should be noted that, all scan slices compatible with above-mentioned dictionary entry are set X1, for each dictionary entry, to itself and the scan slice in set X2, carry out reverse Analysis of Compatibility, it is determined that the scan slice oppositely compatible with dictionary entry, wherein, the supplementary set that X2 is set X1 is gathered.
Preferably, generate dictionary entry step to comprise:
Taking each scan slice as summit, setting up a undirected figure G, any two scan slices if compatible, then have a limit between summit corresponding to them; By heuritic approach, obtaining m maximum complete subgraph, m is the number of default dictionary entry; Each maximum complete word figure is generated the dictionary entry of its correspondence.
Preferably, reverse Analysis of Compatibility is carried out for each dictionary entry, it is determined that the scan slice step oppositely compatible with dictionary entry comprises:
According to dictionary entry, obtain reverse dictionary entry; A figure G is set up taking each reverse dictionary entry as summitd; If the scan slice being included in m maximum complete subgraph forms point set C, from figure G, delete point set C and all limits being connected with point set C, obtain figure G1; At figure GdWith figure G1Between carry out line form limit, find out figure GdThe summit V that middle limit number is maximum1, from GdMiddle deletion summit V1, with all and V1The figure G being connected1In summit form the first figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the first figure1��
From figure G1Middle deletion subgraph C1In all points and coupled limit, judge delete summit V1After figure GdOr delete subgraph C1After figure G1Whether it is empty; If deleting subgraph C1In figure G behind all points and coupled limit1For sky, if or deleting summit VdAfter figure G1For sky, terminate analysis process, it is determined that the scan slice oppositely compatible with dictionary entry is subgraph C1��
Preferably, if deleting subgraph C1In figure G behind all points and coupled limit1It is not empty, if or deleting summit VdAfter figure G1It is not empty, then continues from figure GdIn select the maximum summit V of next limit number2, from GdMiddle deletion summit V2, with all and V2The figure G being connected1In summit form the 2nd figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the 2nd figure2; Subgraph C2Oppositely compatible with dictionary entry; From deletion subgraph C1In figure G behind all points and coupled limit1Middle deletion subgraph C2In all points and coupled limit, judge delete summit V1And V2After figure GdOr delete subgraph C1And C2After figure G1Whether it is empty.
Preferably, subgraph C1In all summits all with summit V1Corresponding reverse dictionary entry is compatible, namely oppositely compatible with dictionary entry.
Preferably, the step obtaining m maximum complete subgraph comprises:
Finding out the summit that in undirected figure G, limit number is maximum, be set to the first summit, other summits compatible with described first summit in undirected figure G form the first point set; Find out the summit that described first concentrated limit number is maximum, it is set to the 2nd summit, concentrate other summit compatible with described 2nd summit to form second point collection at described first; Judge whether described second point collection is empty, if being empty, then extract the scan slice of described first summit, the 2nd vertex correspondence, obtain the first maximum complete subgraph; The first maximum complete subgraph and coupled limit is deleted from undirected figure G, judge whether the undirected figure G behind the maximum complete subgraph of described deletion first and coupled limit is empty, if not being empty, according to the step extracting the first maximum complete subgraph, continue to extract other m-1 maximum complete subgraphs.
Preferably, if second point collection is not empty, finding out the 3rd summit that second point concentrates limit number maximum, second point concentrates other summit compatible with the 3rd summit to form the 3rd point set; Judge whether the 3rd point set is empty, if the 3rd point set is empty, extracts the 3rd summit and put into the first maximum complete subgraph; If the 3rd point set is not empty, repeat said process, until S point set is empty, and extracts S summit and put into the first maximum complete subgraph; Wherein S be greater than 3 integer.
Preferably, if it is empty for deleting the undirected figure G behind the first maximum complete subgraph and coupled limit, then analysis process is terminated.
Preferably, encode for scan slice according to the rule of setting, comprising: coding comprises prefix and data two portions; Scan slice is divided into three types, and the first kind and dictionary entry are compatible, and the 2nd class and dictionary entry are oppositely compatible, and the 3rd class and dictionary entry do not exist consistency relation.
Preferably, first kind scan slice, its coding prefix is " 0 ", and coded data is the index of the dictionary entry compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m; 2nd class scan slice, its coding prefix is " 10 ", and coded data is the index of the dictionary entry oppositely compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m; 3rd its prefix of class scan slice is " 11 ", and data are the raw data in scan slice, and its length is scanning chain number Nscbits.
The present invention aligns and carries out suitable computing to dictionary entry so that it is derives and other entries, is equivalent to add the number of dictionary entry, adds the possibility that scan slice to be encoded is compatible with dictionary entry; Meanwhile, when carrying out the reverse Analysis of Compatibility of dictionary entry, introduce heuritic approach, find out the maximum complete subgraph of the figure that the scan slice oppositely compatible with described each dictionary entry is formed, in conjunction with coding rule, it is to increase the rate of compression of test data.
Accompanying drawing explanation
In order to more clearly demonstrate the technical scheme of the embodiment of the present invention, below the accompanying drawing used required in embodiment being described is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the dictionary coding method schematic flow sheet of existing test data;
Fig. 2 is the dictionary coding method example schematic of existing test data;
The dictionary coding method schematic flow sheet of a kind of test data that Fig. 3 provides for the embodiment of the present invention;
The establishment method schematic flow sheet of the reverse dictionary entry of a kind of test data that Fig. 4 provides for the embodiment of the present invention;
The dictionary encoding example schematic of a kind of test data that Fig. 5 provides for the embodiment of the present invention;
The dictionary encoding example schematic of another test data that Fig. 6 provides for the embodiment of the present invention.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments. Based on the embodiment in the present invention, those of ordinary skill in the art, not making other embodiments all obtained under creative work prerequisite, belong to the scope of protection of the invention.
For ease of the understanding to the embodiment of the present invention, it is further explained explanation below in conjunction with accompanying drawing with specific embodiment.
In order to understand the difference of the present invention and prior art more clearly, the dictionary coding method of test data in prior art is described by Fig. 1, Fig. 2 below.
Fig. 1 is existing test data compressing method schematic flow sheet. As shown in Figure 1, the dictionary coding method of existing test data comprises step 100-105.
In step 100, taking each scan slice as summit, set up undirected figure G, between compatible summit, have a limit.
Taking each scan slice as summit, setting up a undirected figure G, any two scan slices if compatible, then have a limit between summit corresponding to them;
Test data divides three kinds of situations: 0,1 or unrelated position X. Data compatibility judges according to such as under type:
Test data is made up of multi-strip scanning chain, and the data of each scanning identical position of chain form a scan slice, and namely test data comprises at least one scan slice, it is assumed that the scan slice of two at least one bit positions is: the first data and the 2nd data.
When the first data are equal with the data on each corresponding position of the 2nd data or one of them is X, the first data are compatible with the 2nd data; First data are with, when the data on each corresponding position of the 2nd data are contrary or one of them is X, the first data are compatible with the 2nd data back; In other situations, data are incompatible.
It should be noted that, first data and the 2nd data are oppositely compatible, the phase converse value being equivalent to the first data and the 2nd data is compatible, the phase converse value and the 2nd data that are equivalent to the first data are compatible, the method of calculation of the phase converse value of one of them data are, the position that this data all values is 0 is turned into 1, all values be 1 position turn into 0, the position that all values is X remains unchanged.
Taking each scan slice as summit, if there is a limit between compatible two scan slices.
In step 101, from undirected figure, find out the summit a that limit number is maximum11, with scan slice a11Compatible all summits form point set C1��
Taking each scan slice as summit, find out the first summit a that limit number is maximum11, the first summit is scan slice a11. With scan slice a in undirected figure11Other compatible summits form the first point set C1��
In step 102, from point set C1In find out the maximum summit a of limit number12, with scan slice a12Compatible all summits form point set C2��
Find out first concentrated C1The 2nd summit a that limit number is maximum12, the first point set C1In with scan slice a12Other compatible summits form second point collection C2��
In step 103, according to aforesaid method, obtain summit a successively13��a14��a15����a1n��
According to heuritic approach, obtain scan slice a successively13��a14��a15����a1n. Wherein, scan slice a11��a12������a1nIt is all compatible between any two.
It should be noted that, heuritic approach (heuristicalgorithm) proposes relative to optimization algorithm. The optimal algorithm of a problem tries to achieve the optimum solution of this each example of problem. Heuritic approach is defined as: one based on algorithm that is directly perceived or experience structure, providing a feasible solution of each example of combinatorial optimization problem to be solved under acceptable cost (referring to computing time and space), the departure degree of this feasible solution and optimum solution generally can not be estimated. In the embodiment of the present invention, heuritic approach correspondence finds the iteration cycle process of N number of maximum complete subgraph, also the corresponding iteration cycle process finding all summits in each maximum complete subgraph.
In step 104, scan slice a11��a12������a1nForm subset a1��
Extract the first summit a11, the 2nd summit a12, the n-th summit a1nCorresponding scan slice, obtains the first maximum complete subgraph a1��
Scan slice a11��a12������a1nForm subset a1, subset a1It it is a maximum complete subgraph of undirected figure G.
It should be noted that, maximum complete subgraph can be understood as: has bar limit between all summits in this subgraph, the summit outside this subgraph, it is impossible to the Dou You limit, all summits in subgraph.
In step 105, according to aforesaid method, obtain m-1 the maximum complete subgraph a of undirected figure G successively2��a3������am��
According to aforesaid method, first, obtain except subset a1Another subset a in outer test data2, such as: undirected figure G has scan slice 1000, through the subset a that step 101-104 obtains1Comprise scan slice 150, so in remaining 850 scan slices, again according to step 101-step 104, obtain another subset a2, analogize with this, obtain m the maximum complete subgraph of undirected figure G altogether.
In step 106, according to subset a1��a2������amGenerate dictionary entry d1��d2������dm��
Use heuritic approach, obtain m maximum complete subgraph a1��a2������am, wherein m is the number of default dictionary entry.
Each maximum complete subgraph generates the dictionary entry of its correspondence, and its rule is as follows: assume in each maximum complete subgraph that the scan slice corresponding to each summit is followed successively by
a1=(a11,a12,��a1n),a2=(a21,a22,��a2n),��,am=(am1,am2,��amn), and set dictionary entry as d=(d1, d2..., dm):
And if only if travels through j from 1 to n, aijWhen the data of correspondence position are 1 or X, diThe data of correspondence position be 1 (j=1,2 ... n; I=1,2 ... m);
And if only if travels through j from 1 to n, aijWhen the data of correspondence position are 0 or X, diThe data of correspondence position be 0 (j=1,2 ... n; I=1,2 ... m);
And if only if travels through j from 1 to n, when the data of correspondence position are X, and diThe data of correspondence position be X (j=1,2 ... n; I=1,2 ... m).
Surface sweeping slice numbers n in each maximum complete subgraph is not fixing.
It should be noted that, the data of each scanning identical position of chain form a scan slice, namely scan slice comprises many bit data, data figure place by scanning chain number determine, the data of the scan slice correspondence position in each maximum complete subgraph, according to rule traversal recited above, are also the equal of the data in maximum complete subgraph carried out and computing.
Namely to all maximum complete subgraph a1��a2������amIn the data of scan slice carry out and computing, obtain dictionary entry d1��d2������dm��
Fig. 2 is the dictionary encoding example schematic of existing test data. As shown in Figure 2, this example comprises step 200-220.
In step 200, test data may comprise scanning chain: 0X1X0XX1 ... / X01X010X ... / 1X001X1X ... / X01X010X ... / ... etc. data; And respectively scan the data of the identical position of chain, form a scan slice, such as, comprise scan slice g in the test data shown in Fig. 21:0X1X��/g2:X0X0��/g3:1101��/g4:XX0X��/g5:0010��/g6:X1X1��/g7:X010��/g8:1XXX��/��/gN����
Scan slice g1/g2/g3/g4/g5/g6/g7/g8/��/gNForm a undirected figure G of test data.
In step 210, find out m the maximum complete subgraph a of test data undirected figure G successively1��a2������am, wherein: a1=(a11,a12,��a1n),a2=(a21,a22,��a2n),��,am=(am1,am2,��amn), m maximum complete subgraph a1��a2������amIn the data of scan slice carry out and computing, corresponding dictionary entry is: d1��d2������dm��
In step 220, the residue test data (scan slice) in undirected figure G: gh/gi/gj/gk/ ... Wherein, remaining data is in test data to remove the data after m maximum complete subgraph.
It should be noted that, the dictionary coding method of the prior art test data described in Fig. 1 and Fig. 2, also comprises the steps:
After obtaining m maximum complete subgraph, test data corresponding for individual for m maximum complete subgraph being encoded to further " prefix 0+ data ", its coding prefix is " 0 ", and coded data is the index of the dictionary entry compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m.
Represent after the test data compatible with dictionary entry is encoded, after encoding with the test data of dictionary entry consistent part, total (1+log2M) bit position (have compressed test data), and concrete " log2M number of bits certificate " it is corresponding dictionary index.
Preferably, the positive integer power that dictionary entry number m is 2 can be set usually.
The dictionary coding method schematic flow sheet of a kind of test data that Fig. 3 provides for the embodiment of the present invention. As shown in Figure 3, step 300-302 is comprised.
In step 300, generate dictionary entry.
Taking each scan slice as summit, setting up a undirected figure G, any two scan slices if compatible, then have a limit between summit corresponding to them; By heuritic approach, obtaining m maximum complete subgraph, m is the number of default dictionary entry; Each maximum complete word figure is generated the dictionary entry of its correspondence.
Wherein, the step obtaining m maximum complete subgraph comprises: finding out the summit that in undirected figure G, limit number is maximum, be set to the first summit, other summits compatible with described first summit in undirected figure G form the first point set; Find out the summit that described first concentrated limit number is maximum, it is set to the 2nd summit, concentrate other summit compatible with the 2nd summit to form second point collection at first; Judge whether second point collection is empty, if being empty, then extract the scan slice of the first summit, the 2nd vertex correspondence, obtain first maximum complete subgraph.
The first maximum complete subgraph and coupled limit is deleted from undirected figure G, judge whether the undirected figure G after deleting the first maximum complete subgraph and coupled limit is empty, if not being empty, according to the step extracting the first maximum complete subgraph, continue to extract other m-1 maximum complete subgraphs.
Preferably, if second point collection is not empty, finding out the 3rd summit that second point concentrates limit number maximum, second point concentrates other summit compatible with the 3rd summit to form the 3rd point set; Judge whether the 3rd point set is empty, if the 3rd point set is empty, extracts described 3rd summit and put into the first maximum complete subgraph; If the 3rd point set is not empty, repeat said process, until S point set is empty, and extracts S summit and put into described first maximum complete subgraph; Wherein S be greater than 3 integer.
If it is empty for deleting the undirected figure G behind the first maximum complete subgraph and coupled limit, then terminate analysis process.
It should be noted that, namely step 300 is the process of step 100-106 in Fig. 1, and step 106 obtains dictionary entry d1��d2������dmIt is the dictionary entry that this step obtains, no longer repeats at this.
In step 301, carry out reverse Analysis of Compatibility for described dictionary entry, it is determined that the scan slice oppositely compatible with described dictionary entry.
According to dictionary entry, obtain reverse dictionary entry; A figure G is set up taking each reverse dictionary entry as summitd; If the scan slice being included in N number of maximum complete subgraph forms point set C, from figure G, delete point set C and all limits being connected with point set C, obtain figure G1; At figure GdWith figure G1Between carry out line form limit; Find out figure GdThe summit V that middle limit number is maximum1, from GdMiddle deletion summit V1, with all and V1The figure G being connected1In summit form the first figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the first figure1. Subgraph C1In all summits all with summit V1Corresponding reverse dictionary entry is compatible, namely oppositely compatible with this dictionary entry.
From figure G1Middle deletion subgraph C1In all points and coupled limit, judge delete summit V1After figure GdOr delete subgraph C1After figure G1Whether it is empty.
If deleting subgraph C1In figure G behind all points and coupled limit1For sky, if or deleting summit VdAfter figure G1For sky, terminate analysis process, it is determined that the scan slice oppositely compatible with described dictionary entry is subgraph C1��
If deleting subgraph C1In figure G behind all points and coupled limit1It is not empty, if or deleting summit VdAfter figure G1It is not empty, then continues from figure GdIn select the maximum summit V of next limit number2, from GdMiddle deletion summit V2, with all and V2The figure G being connected1In summit form the 2nd figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the 2nd figure2; Described subgraph C2Oppositely compatible with dictionary entry;
From deletion subgraph C1In figure G behind all points and coupled limit1Middle deletion subgraph C2In all points and coupled limit, judge delete summit V1And V2After figure GdOr delete subgraph C1And C2After figure G1Whether it is empty.
Dictionary entry negate step 300 obtained, obtains reverse dictionary entry. Such as, if step 300 obtain just to dictionary entry be d=(d1,d2��dm), and the first of its correspondence the reverse dictionary entry is D=(D1,D2��Dm), wherein, if djIn the data of certain position be 1, then DjThe data of middle correspondence position are 0; If djIn the data of certain position be 0, then DjThe data of middle correspondence position are 1; If djIn the data of certain position be X, then DjThe data of middle correspondence position are X (j=1,2 ... m).
Consistency according to data, at reverse dictionary entry D1With the test data G except the data corresponding to dictionary entry1Between carry out line, find out the summit A that limit number in reverse dictionary entry is maximum1, at test data G1Middle deletion summit A1, with all and A1The test data G being connected1In summit form a figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of this figure1, subgraph C1In all summits all with summit A1Corresponding reverse dictionary entry is compatible, namely oppositely compatible with this dictionary entry.
At test data G1Middle deletion subgraph C1, obtain test data G2, reverse dictionary entry is deleted summit A1, obtain D2, equally, at D2And G2Between carry out line, find out D2The summit A that middle limit number is maximum2, with all and A2The test data G being connected2In summit form a figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of this figure2, analogize successively. This process is circulated to test data GnOr reverse dictionary entry DnFor sky, then terminate dictionary entry is carried out reverse Analysis of Compatibility, it is determined that the scan slice C oppositely compatible with described dictionary entry1��C2������
In step 302, encode for scan slice according to the rule of setting.
Described coding comprises prefix and data two portions;
Scan slice is divided into three types, and the first kind is compatible with dictionary entry, and the 2nd class is oppositely compatible with dictionary entry, and the 3rd class is not for all to exist consistency relation with each dictionary entry.
First kind scan slice, its coding prefix is " 0 ", and coded data is the index of the dictionary entry compatible with it, and its length is { log2M}bits, m are the number of default dictionary entry, { log2M} represents and is not less than log2The minimum integer of m;
Described 2nd class scan slice, its coding prefix is " 10 ", and coded data is the index of the dictionary entry oppositely compatible with it, and its length is { log2M}bits, m are the number of default dictionary entry, { log2M} represents and is not less than log2The minimum integer of m;
Described 3rd its prefix of class scan slice is " 11 ", and data are the raw data in scan slice, and its length is scanning chain number Nscbits.
It should be noted that, the test data after step 300-302 compresses, it is possible to comprise two portions: first kind scan slice and the 2nd class scan slice; Also may also comprise the 3rd class scan slice, namely there is not the original data portion of any compatible relation with dictionary entry.
The establishment method schematic flow sheet of the reverse dictionary entry of a kind of test data that Fig. 4 provides for the embodiment of the present invention. As shown in Figure 4, the method comprising the steps of 400-406.
In step 400, set up a figure G taking each reverse dictionary entry as summitd��
In step 401, if the point (scan slice) being included in m maximum complete subgraph forms point set D, from figure G, delete point set D and limit that all and in point set D point is connected, obtain figure G1��
In step 402, according to the consistency of data, at figure GdWith figure G1Between carry out line form limit.
In step 403, find out figure GdThe summit V that middle limit number is maximum1, from GdMiddle deletion summit V1, with all and V1The figure G being connected1In summit form a figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of this figure1. Subgraph C1In all summits all with summit V1Corresponding reverse dictionary entry is compatible, namely oppositely compatible with this dictionary entry.
In step 404, from figure G1Middle deletion subgraph C1In all points and coupled limit.
In step 405, judge GdOr G1Whether it is empty. If GdOr G1It is be sky, enters step 406.
If GdOr G1It is not all empty, then jumps to step 402, at figure GdAnd G1Between carry out line form limit, find figure GdThe summit V that middle next limit number is maximum2, from GdMiddle deletion summit V2, with all and V2The figure G being connected1In summit form a figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of this figure2. Analogize successively, do not repeat again at this.
In step 406, then terminate dictionary entry is carried out reverse Analysis of Compatibility, it is determined that the scan slice C oppositely compatible with described dictionary entry1��C2������Cn��
The dictionary coding method example schematic of a kind of test data that Fig. 5 provides for the embodiment of the present invention, as shown in Figure 5, this example comprises step 500-550.
In step 500, find out m the maximum complete subgraph a of test data undirected figure G1��a2������am, wherein: a1=(a11,a12,��a1n),a2=(a21,a22,��a2n),��,am=(am1,am2,��amn), to m maximum complete subgraph a1��a2������amIn the data of scan slice carry out and computing, obtaining dictionary entry is: d1��d2������dm��
In step 510, to dictionary entry d1��d2������dmNegate by turn, obtains reverse dictionary entry D1��D2������Dm��
In step 520, the residue test data (scan slice) in undirected figure G is: gh/gi/gj/gk/ ... if, gh/gi/gj/gk/ ... for figure G1��
In step 530, according to the consistency of data, at reverse dictionary entry D1��D2������DmWith residue test data gh/gi/gj/gk/ ... between carry out line.
In step 540, find out reverse dictionary entry D1��D2������DmThe summit that in corresponding each summit, limit number is maximum, is set to DM, and the maximum complete subgraph C of all figure having the summit being connected to be formed with this summitM. D is deleted from reverse dictionary entryMRepresentative entry, from figure G1Middle deletion subgraph CM. Repeat this step, until oppositely dictionary entry is empty, or figure G1For sky.
It should be noted that, in Fig. 5, find out m maximum complete subgraph C1��C2������Cm. Instance graph 5 is each summit V of deletion described in step 405 in Fig. 41��V2After reverse dictionary entry GdFor the situation of sky.
In step 550, residue test data (scan slice): gx/gy/gz/ ..., wherein, gx/gy/gz/ ... for undirected figure G removes the test data outside the data corresponding to dictionary entry and reverse dictionary entry.
Another test data dictionary coding method example schematic that Fig. 6 provides for the embodiment of the present invention, as shown in Figure 6, this example comprises step 600-640.
In step 600, find out m the maximum complete subgraph a of test data undirected figure G1��a2������am, wherein: a1=(a11,a12,��a1n),a2=(a21,a22,��a2n),��,am=(am1,am2,��amn), to m maximum complete subgraph a1��a2������amIn the data of scan slice carry out and computing, obtaining dictionary entry is: d1��d2������dm��
In step 610, to dictionary entry d1��d2������dmNegate, obtains reverse dictionary entry D1��D2������Dm��
In step 620, the residue test data (scan slice) in undirected figure G: gh/gi/gj/gk/ ... if, gh/gi/gj/gk/ ... for figure G1��
In step 630, according to data compatibility, at reverse dictionary entry D1��D2������DmWith the test data g except the data corresponding to dictionary entryh/gi/gj/gk/ ... between carry out line.
In step 640, find out reverse dictionary entry D1��D2������DmThe summit that in corresponding each summit, limit number is maximum, is set to DM, and the maximum complete subgraph C of all figure having the summit being connected to be formed with this summitM. D is deleted from reverse dictionary entryMRepresentative entry, from figure G1Middle deletion subgraph CM. Repeat this step, until oppositely dictionary entry is empty, or figure G1For sky.
It should be noted that, in Fig. 6, find out t maximum complete subgraph C1��C2������Ct. Wherein, C1Comprise scan slice C11��C12, t��m, instance graph 6 is each subgraph C of deletion described in step 405 in Fig. 41��C2After residue test data G1For the situation of sky.
Further, the test data embodiment of the present invention provided carries out compression coding, and setting code word is made up of " prefix " and " data " two part. After the data compression flow process of Fig. 3-Fig. 6, all scan slices can be divided into three types, be respectively:
I type: compatible with certain dictionary entry; II type: oppositely compatible with certain dictionary entry; Type III: there is not consistency relation with dictionary entry (forwards/reverse).
In order to fully use the index of dictionary that dictionary entry is carried out addressing, the entry number usually arranging dictionary is the positive integer power of 2. So the scan slice of three types can the rule described by table 1 encode, wherein m is selected dictionary entry number, and Nsc scans chain number, is also the bit number of single scan slice.
Table 1
In Table 1, test data compression coding comprises prefix and data two portions, wherein:
First kind scan slice, i.e. I type, its coding prefix is " 0 ", and coded data is the index of the dictionary entry compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m;
2nd class scan slice, i.e. II type, its coding prefix is " 10 ", and coded data is the index of the dictionary entry oppositely compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m;
Such as, if to Fig. 5, Fig. 6 test data coding, to, when I, II type data encode, pre-set dictionary entry number is m.
3rd its prefix of class scan slice is " 11 ", and data are the raw data in scan slice, and its length is scanning chain number Nscbits. Such as, if to Fig. 5 test data coding, its III type, namely remains test data gx/gy/gz/ ..., after coding, all will at original test data gx/gy/gz/ ... front prefixing " 11 "; And to Fig. 6, then there is not the 3rd class scan slice.
When namely compressing test data, taking full advantage of the compatible of dictionary entry and reverse compatible properties, during decompression, each dictionary entry is to there being the scan slice compatible with it, also to there being the scan slice oppositely compatible with it, the rate of compression of test data may be substantially increased.
It should be noted that, the unknown numbers such as n, m, t that this specification sheets is mentioned, are natural number.
Embodiments providing the compression method of a kind of test data, problem of first dictionary entry being chosen is modeled as the maximum complete subgraph problem finding undirected figure, and uses heuritic approach to solve, and finds out required dictionary entry; Then each dictionary entry and scan slice are carried out reverse Analysis of Compatibility, and utilize further heuritic approach find out can be oppositely compatible with dictionary entry maximum scan slice number; Finally design corresponding form of codewords, different classes of scan slice is encoded according to the rule of setting. The method, on existing scholar's research working foundation, utilizes dictionary entry reverse Analysis of Compatibility result and uses heuritic approach to solve the method finding maximum complete subgraph, it is possible to realize the lifting of rate of compression.
Above-described embodiment; the object of the present invention, technical scheme and useful effect have been further described; it is it should be understood that; the foregoing is only the specific embodiment of the present invention; the protection domain being not intended to limit the present invention; within the spirit and principles in the present invention all, any amendment of making, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. the dictionary coding method of a test data, it is characterised in that, comprise the following steps:
Generate dictionary entry;
Reverse Analysis of Compatibility is carried out, it is determined that the scan slice oppositely compatible with described dictionary entry for each dictionary entry;
According to the rule of setting, each scan slice is encoded.
2. method according to claim 1, it is characterised in that, described generation dictionary entry step comprises:
Taking each scan slice as summit, setting up a undirected figure G, any two scan slices if compatible, then have a limit between summit corresponding to them; By heuritic approach, obtaining m maximum complete subgraph, described m is the number of default dictionary entry;
Each maximum complete word figure is generated the dictionary entry of its correspondence.
3. method according to claim 2, it is characterised in that, described carry out reverse Analysis of Compatibility for each dictionary entry, it is determined that the scan slice step oppositely compatible with described dictionary entry comprises:
According to described dictionary entry, obtain reverse dictionary entry;
A figure G is set up taking each reverse dictionary entry as summitd;
If the summit being included in m maximum complete subgraph forms point set C, from figure G, delete point set C and all limits being connected with point set C, obtain figure G1;
At figure GdWith figure G1Between carry out line form limit, find out figure GdThe summit V that middle limit number is maximum1, from GdMiddle deletion summit V1, with all and V1The figure G being connected1In summit form the first figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the first figure1;
From figure G1Middle deletion subgraph C1In all points and coupled limit, judge delete summit V1After figure GdOr delete subgraph C1After figure G1Whether it is empty;
If deleting subgraph C1In figure G behind all points and coupled limit1For sky, if or deleting summit VdAfter figure G1For sky, terminate analysis process, it is determined that the scan slice oppositely compatible with described dictionary entry is subgraph C1��
4. method according to claim 3, it is characterised in that, if deleting subgraph C1In figure G behind all points and coupled limit1It is not empty, if or deleting summit VdAfter figure G1It is not empty, then continues from figure GdIn select the maximum summit V of next limit number2, from GdMiddle deletion summit V2, with all and V2The figure G being connected1In summit form the 2nd figure, it may also be useful to heuritic approach, find out the maximum complete subgraph C of the 2nd figure2; Described subgraph C2Oppositely compatible with dictionary entry;
From deletion subgraph C1In figure G behind all points and coupled limit1Middle deletion subgraph C2In all points and coupled limit, judge delete summit V1And V2After figure GdOr delete subgraph C1And C2After figure G1Whether it is empty.
5. method according to claim 4, it is characterised in that, subgraph C1In all summits all with summit V1Corresponding reverse dictionary entry is compatible, namely oppositely compatible with described dictionary entry.
6. according to the method in claim 2 or 3, it is characterised in that, described in obtain a undirected figure G the step of m maximum complete subgraph comprise:
Finding out the summit that in undirected figure G, limit number is maximum, be set to the first summit, other summits compatible with described first summit in undirected figure G form the first point set;
Find out the summit that described first concentrated limit number is maximum, it is set to the 2nd summit, concentrate other summit compatible with described 2nd summit to form second point collection at described first;
Judge whether described second point collection is empty, if being empty, then extract the scan slice of described first summit, the 2nd vertex correspondence, obtain the first maximum complete subgraph;
The first maximum complete subgraph and coupled limit is deleted from undirected figure G, judge whether the undirected figure G behind the maximum complete subgraph of described deletion first and coupled limit is empty, if not being empty, according to the step extracting the first maximum complete subgraph, continue to extract other m-1 maximum complete subgraphs.
7. method according to claim 6, it is characterised in that, if described second point collection is not empty, to find out the summit that described second point concentrates limit number maximum, it is set to the 3rd summit, second point concentrates other summit compatible with described 3rd summit to form the 3rd point set;
Judge whether described 3rd point set is empty, if described 3rd point set is empty, extracts described 3rd summit and put into described first maximum complete subgraph;
If described 3rd point set is not empty, repeat said process, until S point set is empty, and extracts S summit and put into described first maximum complete subgraph; Wherein S be greater than 3 integer.
8. method according to claim 7, it is characterised in that, if the undirected figure G behind the maximum complete subgraph of described deletion first and coupled limit is empty, then terminate analysis process.
9. according to method described in any claim in claim 1-5,7 or 8, it is characterised in that, described encode for scan slice according to the rule of setting, comprising:
Described coding comprises prefix and data two portions;
Scan slice is divided into three types, and the first kind and dictionary entry are compatible, and the 2nd class and dictionary entry are oppositely compatible, and the 3rd class and each dictionary entry all do not exist consistency relation.
10. method according to claim 9, it is characterised in that, described first kind scan slice, its coding prefix is " 0 ", and coded data is the index of the dictionary entry compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m;
Described 2nd class scan slice, its coding prefix is " 10 ", and coded data is the index of the dictionary entry oppositely compatible with it, and its length is { log2M}bits, m are the number of the described dictionary entry preset, { log2M} represents and is not less than log2The minimum integer of m;
Described 3rd its prefix of class scan slice is " 11 ", and data are the raw data in scan slice, and its length is scanning chain number Nscbits.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511000161.1A CN105629155B (en) | 2015-12-28 | 2015-12-28 | A kind of dictionary coding method of test data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511000161.1A CN105629155B (en) | 2015-12-28 | 2015-12-28 | A kind of dictionary coding method of test data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105629155A true CN105629155A (en) | 2016-06-01 |
| CN105629155B CN105629155B (en) | 2018-08-17 |
Family
ID=56044273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511000161.1A Expired - Fee Related CN105629155B (en) | 2015-12-28 | 2015-12-28 | A kind of dictionary coding method of test data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105629155B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04265020A (en) * | 1991-02-20 | 1992-09-21 | Fujitsu Ltd | Data compressing system |
| US20050097413A1 (en) * | 2003-10-17 | 2005-05-05 | Srivaths Ravi | System-level test architecture for delivery of compressed tests |
| CN101042714A (en) * | 2007-04-29 | 2007-09-26 | 哈尔滨工业大学 | Compressing method for SOC testing data suitable for suitable for multi-scanning chain designing core |
| CN101158706A (en) * | 2007-11-16 | 2008-04-09 | 哈尔滨工业大学 | Large scale integrated circuit test data and method for testing power consumption cooperate optimization |
| CN101968528A (en) * | 2010-08-19 | 2011-02-09 | 詹文法 | Test data compression method of integrated circuit test |
| US7961959B2 (en) * | 2006-08-24 | 2011-06-14 | Dell Products L.P. | Methods and apparatus for reducing storage size |
| CN102323541A (en) * | 2011-05-25 | 2012-01-18 | 哈尔滨工业大学 | Test method for SOC (System On Chip) based on reference vector and bit mask |
| CN102353894A (en) * | 2011-08-26 | 2012-02-15 | 哈尔滨工业大学 | Method for testing SOC (System On Chip) based on reference vector and bit mask |
| CN102567294A (en) * | 2010-12-09 | 2012-07-11 | 北京大学 | Text data processing method and text data processing device |
| CN103258030A (en) * | 2013-05-09 | 2013-08-21 | 西安电子科技大学 | Mobile device memory compression method based on dictionary encoding and run-length encoding |
-
2015
- 2015-12-28 CN CN201511000161.1A patent/CN105629155B/en not_active Expired - Fee Related
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04265020A (en) * | 1991-02-20 | 1992-09-21 | Fujitsu Ltd | Data compressing system |
| US20050097413A1 (en) * | 2003-10-17 | 2005-05-05 | Srivaths Ravi | System-level test architecture for delivery of compressed tests |
| US7961959B2 (en) * | 2006-08-24 | 2011-06-14 | Dell Products L.P. | Methods and apparatus for reducing storage size |
| CN101042714A (en) * | 2007-04-29 | 2007-09-26 | 哈尔滨工业大学 | Compressing method for SOC testing data suitable for suitable for multi-scanning chain designing core |
| CN101158706A (en) * | 2007-11-16 | 2008-04-09 | 哈尔滨工业大学 | Large scale integrated circuit test data and method for testing power consumption cooperate optimization |
| CN101968528A (en) * | 2010-08-19 | 2011-02-09 | 詹文法 | Test data compression method of integrated circuit test |
| CN102567294A (en) * | 2010-12-09 | 2012-07-11 | 北京大学 | Text data processing method and text data processing device |
| CN102323541A (en) * | 2011-05-25 | 2012-01-18 | 哈尔滨工业大学 | Test method for SOC (System On Chip) based on reference vector and bit mask |
| CN102353894A (en) * | 2011-08-26 | 2012-02-15 | 哈尔滨工业大学 | Method for testing SOC (System On Chip) based on reference vector and bit mask |
| CN103258030A (en) * | 2013-05-09 | 2013-08-21 | 西安电子科技大学 | Mobile device memory compression method based on dictionary encoding and run-length encoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105629155B (en) | 2018-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108833927B (en) | A kind of point cloud genera compression method based on 0 element in deletion quantization matrix | |
| CN108335335B (en) | A kind of point cloud genera compression method based on enhancing figure transformation | |
| CN102353894B (en) | Method for testing SOC (System On Chip) based on reference vector and bit mask | |
| JP5456903B2 (en) | Method and apparatus for encoding mesh model, encoded mesh model, and method and apparatus for decoding mesh model | |
| CN106253913B (en) | The block encoder of polarization code and its coding method | |
| CN107113445A (en) | Probability updating method for binary arithmetic coding/decoding and the entropy coding/decoding device using this method | |
| CN104115189A (en) | Local feature amount extraction device, local feature amount extraction method, and program | |
| Ausbeck | The piecewise-constant image model | |
| CN106452825A (en) | Power distribution and utilization communication network alarm correlation analysis method based on improved decision tree | |
| EP3343446A1 (en) | Method and apparatus for encoding and decoding lists of pixels | |
| CN105049860A (en) | Image encoding device | |
| CN102592682A (en) | Test data encoding compression method | |
| CN105629155A (en) | Test data dictionary coding method | |
| CN109547160A (en) | A kind of cyclic shift network code construction method | |
| CN103124356A (en) | Self-adaptive space domain error concealment method based on direction information | |
| CN102323541A (en) | Test method for SOC (System On Chip) based on reference vector and bit mask | |
| Mohamed et al. | Speeding up fractal image compression by genetic algorithms | |
| CN105137321A (en) | Approximate compatible compression method based on grouping test vectors | |
| CN104268034B (en) | A kind of data back up method and device and data reconstruction method and device | |
| CN102316324B (en) | Image coding prediction method based on local minimum entropy | |
| CN107248930B (en) | Based on k2Web service composition method of MDD | |
| Hareedy et al. | The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memories | |
| CN103297766B (en) | The compression method of vertex data and device in a kind of 3 d image data | |
| Matos et al. | Compression of microarray images using a binary tree decomposition | |
| CN105389852B (en) | Sphere Voronoi diagram generation method based on QTM bilateral scannings |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180817 Termination date: 20201228 |