METHOD AND DEVICE FOR ENCODING AND DECODING OF DATA IN UNIQUE NUMBER VALUES

• US 20110122003A1
• Filed: 05/25/2009
• Published: 05/26/2011
• Est. Priority Date: 05/21/2008
• Status: Active Grant

• Current Assignee: Ipo Paulus Willem Marinus Maria Van Den Boom
• Original Assignee: Ipo Paulus Willem Marinus Maria Van Den Boom
• Inventors: Van Den Boom, Ipo Paulus Willem Marinus Maria
• Granted Patent: US 8,446,299 B2
• Time in Patent Office: Days
• US Class Current: 341/106
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• CPC Class Codes: H04N 19/192 the adaptation method, adaptation tool or adaptation type being iterative or recursive
• CPC Class Codes: H04N 19/60 using transform coding
• CPC Class Codes: H04N 19/625 using discrete cosine transform [DCT]
• CPC Class Codes: H04N 19/91 Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Abstract

Systems and methods for the encoding of data in a dataset, comprising the storage of the data in an i-th temporary code list (TCL(i)); generating an i-th folder (folder(i)) from the i-th temporary code list (TCL(i)) by replacing each value by an index that refers to the same value in a reference database; generating new temporary codes, using a predetermined formula F that always combines at least two values from the i-th folder (folder(i)), and placing thereof in an (i+1)-th temporary code list (TCL(i+1)); and the recursive repetition of actions b) and c) for subsequent values of i, so long as the (i+1)-th temporary code list (TCL(i+1)) or the (i+1)-th folder (Folder(i+1)) contains one or more values more than once.

Claims

1. A method for the encoding of data in a dataset, comprising the following actions:

a) defining an integer value i=0 and a reference database;

b) the storage of the data in an i-th temporary code list (TCL(i));

c) generating an i-th folder (Folder(i)) from the i-th temporary code list (TCL(i)) by, in each position thereof containing a value, replacing said value by an index that refers to the position of the same corresponding value as stored in the reference database;

d) generating a series of new temporary codes and placing thereof in an (i+1)-th temporary code list (TCL(i+1)), in which each new temporary code is calculated using a predetermined formula F that always combines at least two values from the i-th folder (Folder(i));

e) generating an (i+1)-th folder (Folder(i+1)) from the (i+1)-th temporary code list (TCL(i+1)) by, in each position thereof containing a value, replacing said value by an index that refers to the position of the same corresponding value as stored in the reference database;

f) checking whether at least one of the (i+1)-th temporary code list (TCL(i+1)) and the (i+1)-th folder (Folder(i+1)) contains one or more values more than once;

if not, then jumping to action g);

if yes, then incrementing the value of i by 1 and jumping to action d);

g) terminating the encoding.

2. The method for the encoding of data according to claim 1, comprising the commencement of action c) with:

generating a list that only contains all unique values from the i-th temporary code list (TCL(i)) once only and the storage thereof in an i-th permanent code list (PCL(i)) which forms part of the reference database;

and action e) commencing with;

generating a subsequent list that only contains all unique values from the (i+1)-th temporary code list (TCL(i+1)) once only and the storage thereof in an (i+1)-th permanent code list (PCL(i+1)) which forms part of the reference database.

3. The method for the encoding of data according to claim 1, comprising the use of either a complete or partial universal reference database established in advance.

4. The method for the encoding of data according to claim 3, wherein the reference database is partially universal, and said method comprises the extension of said partially universal reference database by the commencement of action c) with:

the addition of values from the i-th temporary code list (TCL(i)) to the partially universal reference database if these do not yet occur therein;

and commencement of action e) with;

the addition of values from the (i+1)-th temporary code list (TCL(i+1)) to the partially universal reference database if these do not yet occur therein.

5. The method for the encoding of data according to claim 3, in which the indices that refer to a value in the reference database are arranged according to a variable bit encoding scheme.

6. The method according to claim 2, in which a lossless compression algorithm is applied to the reference database.

7. The method according to claim 2, in which each i-th and (i+1)-th permanent code list is stored separately and each i-th and (i+1)-th folder is compiled with the smallest possible integer values.

8. The method for the encoding of data according to claim 1, in which the predetermined formula at least has the following component:

9. The method for the encoding of data according to claim 8, in which the predetermined formula is the following:

10. The method according to claim 8, in which N has a constant value for each value of i.

11. The method according to claim 8, in which N has a constant value for the same value of i, but may have another value for different values of i.

12. The method according to claim 8, in which each folder comprises consecutive index values that always differ from each other by a value of 1, and the base value has a value that is at least 1 higher than the highest index value in a folder to which the predetermined formula is applied.

13. The method according to claim 1, in which, after action g), an end-code is compiled that comprises the folder (Folder(i+1)) generated ultimately, or a reference thereto, and making available the end-code, as well as data related to the formula used for calculating each i-th and (i+1)-th temporary code list, to a decoding unit.

14. The method according to claim 13, characterized in that the ultimately generated folder (Folder(i+1)) comprises index values that always differ from each other by a value of 1 and that the end-code is equal to the highest index value.

15. The method according to claim 1, in which the reference database has a series of codes sorted in order of size, and is compressed in size by replacing the series by a new series comprising only the largest value from the series and all difference values between the largest value from the series and the remaining codes from the series.

16. An encoding unit comprising a processor and a memory, in which memory data and instructions of a computer program are stored that are arranged such that these provide the processor with the ability to execute the method according to claim 1.

17. A computer program product comprising data and instructions, arranged such that these, after having been received by a processor, provide the processor with the ability to execute the method according to claim 1.

23. An encoding/decoding system, comprising an encoding unit according to claim 16 and a decoding unit according to claim 20.

25. The method according to claim 9, in which N has a constant value for each value of i.

26. The method according to claim 9, in which N has a constant value for the same value of i, but may have another value for different values of i.

18. (canceled)

19. A method for the decoding of an end-code according to the following actions:

a) receiving the end-code comprising an (i+1)-th folder (Folder(i+1)) generated ultimately by an encoding unit or a unique reference thereto, and receiving the value of i;

b) using values in the (i+1)-th folder (Folder(i+1)) as index values that refer to values in a reference database;

c) calculating values in an (i+1)-th temporary code list (TCL(i+1)) by placing, in each position in the (i+1)-th folder (Folder(i+1)), a value from the reference database having the index value corresponding to that position;

d) calculating values in an i-th folder (Folder(i)) by applying a decoding formula to the (i+1)-th temporary code list (TCL(i+1)), said decoding formula being an inverse formula of a formula that has been used by the encoding unit for calculating the (i+1)-th temporary code list from the (i)-th folder (Folder(i)), wherein the i-th folder (Folder(i)) comprises N times as many values as the (i+1)-th temporary code list (TCL(i+1)), where N≧

2;

e) using the values in the i-th folder (Folder(i)) as index values that refer to values in the reference database;

f) calculating values in an i-th temporary code list (TCL(i)) by placing, in each position in the i-th folder (Folder(i)), a value from the reference database having the index value corresponding to that position;

g) decrementing the value of i by 1;

if i≧

0, calculating values in an i-th folder (Folder(i)) by applying a decoding formula on the (i+1)-th temporary code list (TCL(i+1)), said decoding formula being an inverse formula of a formula that has been used by the encoding unit for calculating the (i+1)-th temporary code list from the (i)-th folder (Folder(i)), wherein the i-th folder (Folder(i)) comprises N times as many values as the (i+1)-th temporary code list (TCL(i+1)), where N≧

2, and jumping back to action e);

if i<

0, jumping to action h); and

h) deriving an original dataset from the i-th folder, where i=0.

20. A decoding unit comprising a processor and a memory, in which memory data and instructions of a computer program are stored that are arranged such that these provide the processor with the ability to execute the method according to claim 19.

21. A computer program product, comprising data and instructions arranged such that these, after having been received by a processor, provide the processor with the ability to execute the method according to claim 19.

22. (canceled)

24. A method of encoding comprising:

a) receiving input data elements, which input data elements are obtained from;

I. dividing data elements into M*M matrices, where M is an integer value,

II. applying a DCT process to these M*M matrices rendering M*M DCT matrices with DCT data elements, and

III. quantisation of all values in said M*M DCT matrices in values between a predetermined lower and higher limit rendering said input data element;

b) applying a predetermined formula F which has at least the following component;