Data coding using an exponent and a residual

• US 7,586,424 B2
• Filed: 06/05/2006
• Issued: 09/08/2009
• Est. Priority Date: 06/05/2006
• Status: Active Grant

• Current Assignee: Mineral Lassen LLC (Intellectual Ventures LLC)
• Original Assignee: Essex PA LLC (Intellectual Ventures LLC)
• Inventors: Monro, Donald Martin
• Primary Examiner(s): Nguyen; Khai M
• Application Number:
  US11/422,316
• Publication Number:
  US 20070282933A1
• Time in Patent Office: 1,191 Days
• Field of Search: 341/51, 341/65, 341/67, 341/107, 708/203
• US Class Current: 341/51
• CPC Class Codes: H03M 7/24 Conversion to or from floating-point codes
• CPC Class Codes: H03M 7/40 Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
• CPC Class Codes: H03M 7/46 Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind

Abstract

A method of coding audio and/or video data. A data symbol may be coded using an exponent and a residual, in which the exponent is coded using a variable length code, such as but not limited to a Huffman code or a Golomb code. The variable length code may be adaptive and may code according to probabilities or frequencies of occurrence of the data symbol.

Claims

1. A method comprising:

coding a data symbol using a code comprising an exponent value and a residual value;

coding the residual value using a fixed-length binary code; and

coding the exponent value using a variable length code that is based on a frequency of occurrence of the exponent value.

2. The method of claim 1, wherein the data symbol comprises a binary representation.

3. The method of claim 1, wherein the data symbol is run length encoded.

4. The method of claim 1, further comprising:

coding additional data symbols from a sequence of data symbols.

5. The method of claim 4, wherein the sequence of data symbols represents an audio and/or a video stream.

6. The method of claim 4, wherein the sequence of data symbols are included within a symbol alphabet, which ranks each symbol in the sequence according to expected probability of occurrence.

7. The method of claim 1, wherein the coding of the data symbol comprises Raw Golomb coding.

8. The method of claim 1, wherein the data symbol comprises non-numeric data.

9. The method of claim 1, wherein the data symbol is an audio signal, a video signal, a data signal, or a file.

10. The method of claim 1, further comprising:

using one of Huffman coding, Fano-Shannon coding, or Golomb coding as the variable length code.

11. The method of claim 1, wherein the variable length code is adaptive.

12. The method of claim 1, wherein the variable length code comprises a pre-defined code.

13. The method of claim 1 wherein values of the variable length code are further determined according to a probability of the data symbol or frequency of occurrence of the data symbol.

14. A method comprising:

coding a data symbol using a code comprising an exponent value and a residual value; and

coding the residual value using entropy encoding.

15. The method of claim 14, wherein the data symbol comprises a binary representation.

16. The method of claim 14, wherein the data symbol is run length encoded.

17. The method of claim 14, further comprising:

coding additional data symbols from a sequence of data symbols.

18. The method of claim 17, wherein the sequence of data symbols represents an audio and/or a video stream.

19. The method of claim 17, wherein the sequence of data symbols are included within a symbol alphabet, which ranks each symbol in the sequence according to expected probability of occurrence.

20. The method of claim 14, wherein the coding of the data symbol comprises Raw Golomb coding.

21. The method of claim 14, wherein the data symbol comprises non-numeric data.

22. The method of claim 14, wherein the data symbol is an audio signal, a video signal, a data signal, or a file.

23. The method of claim 14, further comprising:

coding the exponent value using a variable length code.

24. The method of claim 23, further comprising:

using one of Huffman coding, Fano-Shannon coding, or Golomb coding as the variable length code.

25. The method of claim 23, wherein the variable length code is adaptive.

26. The method of claim 23, wherein the variable length code comprises a pre-defined code.

27. The method of claim 23, wherein values of the variable length code are determined according to a probability of the data symbol or frequency of occurrence of the data symbol.

28. A tangible computer-readable medium having stored thereon, computer-executable instructions that, if executed by a computing device, cause the computing device to perform a method comprising:

coding a data symbol using a code comprising an exponent value and a residual value;

coding the residual value using a fixed-length binary code; and

coding the exponent value using a variable length code that is based on a frequency of occurrence of the exponent value.

29. A tangible computer-readable medium having stored thereon, computer-executable instructions that, if executed by a computing device, cause the computing device to perform a method comprising:

coding a data symbol using a code comprising an exponent value and a residual value; and

coding the residual value using entropy encoding.

30. A system comprising:

a first analyzer module configured to code a data symbol using a code comprising an exponent value and a residual value; and

a second analyzer module configured to code the residual value using a fixed-length binary code and code the exponent value using a variable length code that is based on a frequency of occurrence of the exponent value,

wherein the first and second analyzer modules execute in one or more computers.

31. A system comprising:

a first analyzer module configured to code a data symbol using a code comprising an exponent value and a residual value; and

a second analyzer module configured to code the residual value using entropy encoding,

wherein the first and second analyzer modules execute in one or more computers.

32. A system comprising:

means for coding a data symbol using a code comprising an exponent value and a residual value;

means for coding the residual value using a fixed-length binary code; and

means for coding the exponent value using a variable length code that is based on a frequency of occurrence of the exponent value.

33. A system comprising:

means for coding a data symbol using a code comprising an exponent value and a residual value; and

means for coding the residual value using entropy encoding.

34. A method comprising:

coding a data symbol using a code comprising an exponent value and a residual value;

coding the exponent value using a variable-length code; and

coding the residual value using entropy encoding.