# US 6,731,686 B1 · Apparatus and method for pipelining variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,731,686 B1
- Document ID: US6731686B1
- Status: Granted
- Kind: B1
- Application number: 09/584,834
- Filed: 2000-05-31
- Granted: 2004-05-04
- Earliest claimed: 2000-05-31
- Assignees: Sun Microsystems, Inc.
- Inventors: Subramania I. Sudharsanan; Parthasarathy Sriram; Amit Gulati
- Web page: https://patentgrep.com/patent/US6731686B1

## CPC

- H03M 7/425: {for the decoding process only}
- H04N 19/42: characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation (H04N19/635 takes precedence)
- H04N 19/61: in combination with predictive coding
- H04N 19/91: Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method for pipelining variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder includes the step of mapping a new code word to a look-up table to retrieve a code word length, a zero-run length, and a quantized level. A new linear, zig-zagged position of a current coefficient is identified from the zero-run length and a previous zero-run length. The code word length is added to a current bitstream position to yield a new bitstream position. A quantization matrix coefficient from the new linear, zig-zagged position of the current coefficient is selected. The quantized level is multiplied by a predetermined value to produce a quantization product. In the case of inter block processing, a quantized level sign value is added to the quantization product. In the case of intra block processing, the quantization product does not include the quantization level sign. The quantization product is multiplied by a quantization matrix coefficient to form a derived quantization value. The derived quantization value is divided by a predetermined word length to produce a final quantization value. The new linear, zig-zagged position of the current coefficient is converted to a two-dimensional display position. The final quantization value is written at the display position.

## Claims

### Claim 1

A method for pipelining variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder, said method comprising the steps of:
mapping a new code word to a look-up table to retrieve a code word length, a zero-run length, and a quantized level;
identifying a new linear, zig-zagged position of a current coefficient from said zero-run length and a previous zero-run length;
adding said code word length and a current bitstream position to Yield a new bitstream position;
identifying when a run length escape code exists; and
selectively performing escape processing in response to said identifying step.

### Claim 2 (depends on 1)

The method of claim 1, further comprising the steps of:
determining when a new code word is required; and
selectively retrieving a new code word in response to said determining step.

### Claim 3 (depends on 1)

The method of claim 1, further comprising the step of selecting a quantization matrix coefficient from said new linear, zig-zagged position of said current coefficient.

### Claim 4

A method for pipelining variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder, said method comprising the steps of:
mapping a new code word to a look-up table to retrieve a code word length, a zero-run length, and a quantized level;
identifying a new linear, zig-zagged position of a current coefficient from said zero-run length and a previous zero-run length;
adding said code word length and a current bitstream position to yield a new bitstream position;
locating an end of block code; and
terminating processing in response to said locating step.

### Claim 5 (depends on 4)

The method of claim 4, further comprising the steps of:
determining when a new code word is required; and
selectively retrieving a new code word in response to said determining step.

### Claim 6 (depends on 4)

The method of claim 4, further comprising the step of selecting a quantization matrix coefficient from said new linear, zig-zagged position of said current coefficient.

### Claim 7

A method for pipelining variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder, said method comprising the steps of:
mapping a new code word to a look-up table to retrieve a code word length, a zero-run length, and a quantized level;
identifying a new linear, zig-zagged position of a current coefficient from said zero-run length and a previous zero-run length;
adding said code word length and a current bitstream position to yield a new bitstream position;
determining a sign value for said quantized level;
multiplying said quantized level by a predetermined value to produce a quantization product; and
adding, in the case of inter block processing, said sign value to said quantization product.

### Claim 8 (depends on 7)

The method of claim 7 further comprising the step of multiplying said quantization product by a quantization matrix coefficient to from a derived quantization value.

### Claim 9 (depends on 8)

The method of claim 8 further comprising the step of dividing said derived quantization value by a predetermined word length to produce a final quantization value.

### Claim 10 (depends on 9)

The method of claim 9 further comprising the step of converting said new linear, zig-zagged position of said current coefficient to a two-dimensional display position.

### Claim 11 (depends on 10)

The method of claim 10 further comprising the step of writing said final quantization value at said display position.

### Claim 12

An apparatus to pipeline variable length decode and inverse quantization operations in a hybrid motion-compensated and transform coded video decoder, comprising:
a counter to identify a leading bit count in a variable length code;
a multiplexer with multiplexer input nodes configured to receive buffered look-up table segments and select nodes to receive said leading bit count, said multiplexer generating a multiplexer output signal;
an adder to add said multiplexer output signal and an offset signal to yield a look-up table address; and
a look-up table to return a level signal, a length signal, and a run signal corresponding to said look-up table address.

### Claim 13 (depends on 12)

The apparatus of claim 12 further comprising:
a register to store an offset value; and
a shift circuit to right shift said offset value an amount specified by said multiplexer output signal and thereby produce said offset signal.

### Claim 14 (depends on 12)

The apparatus of claim 12 further comprising:
a shift circuit to left shift said level signal one bit position to produce a shifted level signal; and
a multiplier to multiply said shifted level signal and a quantization scale factor.

### Claim 15 (depends on 12)

The apparatus of claim 12 further comprising an adder to add said length signal with a previous offset value to produce a new offset value.

### Claim 16 (depends on 15)

The apparatus of claim 15 wherein said adder produces a carry signal.

### Claim 17 (depends on 16)

The apparatus of claim 16 further comprising a new word multiplexer with a select signal node responsive to said carry signal to load a new word.

### Claim 18 (depends on 12)

The apparatus of claim 12 farther comprising a bit count circuit to produce an escape signal when said run signal corresponds to a predetermined value.

### Claim 19 (depends on 12)

The apparatus of claim 12 further comprising a bit count circuit to produce an end-of-block signal when said run signal corresponds to a predetermined value.

### Claim 20 (depends on 12)

The apparatus of claim 12 wherein said look-up table stores a subset of a total look-up table expression, said subset being facilitated by said leading bit count from said counter.
