Sign coding and decoding

• US 20050133607A1
• Filed: 12/19/2003
• Published: 06/23/2005
• Est. Priority Date: 12/19/2003
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Vavro, David K., Golla, Kumar S.
• Granted Patent: US 7,787,698 B2
• Time in Patent Office: Days
• US Class Current: 235/494
• CPC Class Codes: H04N 19/60 using transform coding
• CPC Class Codes: H04N 19/645 by grouping of coefficients into blocks after the transform
• CPC Class Codes: H04N 19/647 using significance based coding, e.g. Embedded Zerotrees of Wavelets [EZW] or Set Partitioning in Hierarchical Trees [SPIHT]

Abstract

Embodiments of the invention provide an instruction that computes the horizontal and vertical values (H,V) based upon the predefined equations. Based upon the horizontal and vertical values (H,V) and the current sign bit being processed at [m,n], the output context and decision pair (CX,D) is determined placed into a destination register.

Claims

1. A method for sign coding, comprising:

determining coefficient bits to be sign coded;

executing a sign coding instruction to generate context and decision values for the selected coefficient bits, comprising;

identifying state variables associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

identifying sign values associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

computing horizontal and vertical values in response to the state variables and sign values identified; and

generating context and decision values in response to the coefficient bit values.

2. The method claimed in claim 1, further comprising:

processing the context and decision values to generate compressed data output.

3. The method claimed in claim 1, wherein computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

computing the horizontal value in accordance with

H=min[1, max(−

1,Sigma[m,n−

1]*(1-2*Sign[m,n−

1])+(Sigma[m,n+1]*(1-2*Sign[m,n+1]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), *=multiplication.

4. The method claimed in claim 1, wherein computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

computing the vertical value in accordance with

V=min[1, max(−

1,Sigma[m−

1,n]*(−

1-2*Sign[m−

1,n])+(Sigma[m+1,n]*(1-2*Sign[m+1,n]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), *=multiplication.

5. The method claimed in claim 1, wherein the state variables are significance state variables.

6. The method claimed in claim 1, wherein the state variables correspond to an array of quantized coefficients being scanned.

7. The method claimed in claim 1, wherein the instruction is used for JPEG2000.

8. A system, comprising:

a memory;

a processor to execute an instruction to a sign coding instruction to generate context and decision values for the selected coefficient bits, comprising;

identifying state variables associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

identifying sign values associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

computing horizontal and vertical values in response to the state variables and sign values identified; and

generating context and decision values in response to the coefficient bit values

9. The system claimed in claim 8, further comprising:

processing the context and decision values to generate compressed data output.

10. The system claimed in claim 8, wherein computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

computing the horizontal values in accordance with

H=min[1, max(−

1,Sigma[m,n−

1]*(1-2*Sign[m,n−

1])+(Sigma[m,n+1]*(1-2*Sign[m,n+1]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), *=multiplication.

11. The method claimed in claim 8, wherein computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

computing the vertical values in accordance with

V=min[1, max(−

1,Sigma[m−

1,n]*(1-2*Sign[m−

1,n])+(Sigma[m+1,n]*(1-2*Sign[m+1,n]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), *=multiplication.

12. The system claimed in claim 8, wherein the state variables are significance state variables.

13. The system claimed in claim 8, wherein the state variables correspond to an array of quantized coefficients being scanned.

14. The system claimed in claim 8, wherein the instruction is used for JPEG2000.

15. A machine readable medium having stored therein a plurality of machine readable instructions executable by a processor to determine sign coding, comprising:

instructions to determine coefficient bits to be sign coded;

instructions to identify state variables associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

instructions to identify sign values associated with selected coefficient bits and horizontal and vertical neighboring bits of the selected coefficient bits to be processed;

instructions to compute horizontal and vertical values in response to the state variables and sign values identified; and

instructions to generate context and decision values in response to the coefficient bit values

16. The machine readable medium claimed in claim 15, further comprising:

instructions to processing the context and decision values to generate compressed data output.

17. The machine readable medium claimed in claim 15, wherein instructions to computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

instructions to compute the horizontal values in accordance with

H=min[1,max(−

1,Sigma[m,n−

1]*(1-2*Sign[m,n−

1])+(Sigma[m,n+1]*(1-2*Sign[m,n+1]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), * 32 multiplication.

18. The machine readable medium claimed in claim 15, wherein instructions to computing horizontal and vertical values in response to the state variables and sign values identified further comprises:

instructions to compute the vertical values in accordance with

V=min[1,max(−

1,Sigma[m−

1,n]*(1-2*Sign[m−

1,n])+(Sigma[m+1,n]*(1-2*Sign[m+1,n]))]

wherein the current coding position is [m,n] and m=row, n=column, min is the minimum of two numbers(j,k), max is the maximum of two numbers (r,s), *=multiplication.

19. The machine readable medium claimed in claim 15, wherein the state variables are significance state variables.

20. The machine readable medium claimed in claim 15, wherein the state variables correspond to an array of quantized coefficients being scanned.