Method and system for symbol binarization

• US 6,744,387 B2
• Filed: 07/10/2002
• Issued: 06/01/2004
• Est. Priority Date: 07/10/2002
• Status: Expired due to Term

• Current Assignee: Broadcom Corporation (Broadcom, Inc.)
• Original Assignee: LSI Logic Corporation (Broadcom, Inc.)
• Inventors: Winger, Lowell
• Primary Examiner(s): Young, Brian
• Application Number:
  US10/191,596
• Publication Number:
  US 20040008769A1
• Time in Patent Office: 692 Days
• Field of Search: 341/50, 341/51, 341/107, 341/106
• US Class Current: 341/50
• 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

The present invention is directed to an improved method for the binarization of data in an MPEG data stream. The invention makes use of unary binarization to create codewords up until an index threshold. Once the threshold has been met, succeeding code symbols have appended to them an exp-Golomb suffix. This hybrid binarization scheme reduces the number of binary codewords to be processed by a Binary Arithmetic Coder (BAC), thus reducing the computation required by the BAC.

Claims

1. A method of binarization,

comprising the step of:

determining if a code symbol index value;

if said code symbol index value is less than a threshold value, constructing a codeword using a unary binarization; and

if said code symbol index value is not less than said threshold value, constructing a codeword using a exp-Golomb binarization.

2. The method of claim 1, wherein said exp-Golomb binarization model comprises the steps of:

a) forming an initial prefix of 1'"'"'s, equal in number to said threshold value minus one;

b) determining the number of bits, γ

+1 required to represent v−

(N−

2) where γ

=└

log₂(v−

(N−

2))┘

, v is the code symbol index value, and N is the threshold value, and then transforming γ

into a unary representation to create a result;

c) appending the result of step b) to the result of step a);

d) determining the least significant bits, of v−

(N−

2)−

2**γ

, and

e) appending the result of step d) in its binary representation to the result of step c) to create said codeword.

3. A binarization system comprising:

means for determining if a code symbol index value is less than a threshold value

means for constructing a codeword using a unary binarization if said code symbol index value is less than a threshold value; and

means for constructing a codeword using a exp-Golomb binarization if said code symbol index value is less than a threshold value.

4. The system of claim 3, wherein said exp-Golomb binarization comprises means for:

a) forming an initial prefix of 1'"'"'s, equal in number to said threshold value minus one;

b) determining the number of bits, γ

+1 required to represent v−

(N−

2) where γ

=└

log₂(v−

(N−

2))┘

, v is the code symbol index value, and N is the threshold value, and then transforming y into a unary representation to create a result;

c) appending the result of step b) to the result of step a);

d) determining the least significant bits, of v−

(N=2)−

2**γ

; and

e) appending the result of step d) in its binary representation to the result of step c) to create said codeword.

5. A computer readable medium containing instructions for binarization, comprising instructions for:

determining if a code symbol index value;

if said code symbol index value is less than a threshold value, constructing a codeword using a unary binarization; and

if said symbol index value is not less than said threshold value constructing a codeword using a exp-Golomnb binarization.

6. The computer readable medium of claim 5, wherein said exp-Golomb binarization comprises instructions for:

a) forming an initial prefix of 1'"'"'s, equal in number to said threshold value;

b) determining the number of bits, γ

+1, required to represent v−

(N=2) where γ

=└

log₂(v−

(N−

2))┘

, v is the code symbol index value, and N is the threshold value, and then transforming γ

into a unary representation to create a result;

c) appending the result of step b) to the result of step a);

d) determining the least significant bits, of v−

(N=2)−

2**γ

; and

e) appending the result of step d) in its binary representation to the result of step c) to create said codeword.