# US 6,731,290 B2 · Window idle frame memory compression

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

- Number: US 6,731,290 B2
- Document ID: US6731290B2
- Status: Granted
- Kind: B2
- Application number: 09/968,166
- Filed: 2001-09-28
- Published: 2003-04-10
- Granted: 2004-05-04
- Earliest claimed: 2001-09-28
- Assignees: Intel Corporation
- Inventors: Ying Cui
- Web page: https://patentgrep.com/patent/US6731290B2

## CPC

- G06T 9/005: {Statistical coding, e.g. Huffman, run length coding}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Idle frames received by a graphics controller are compressed by evaluating two idle frames to create an encoding table used to replace selected pixel byte values in subsequent idle frames with codes. Possible pixel byte values are associated with a first set of counters, with each counter counting several different byte values as they occur with the first idle frame. A first subset of the possible pixel byte values is selected based on the counts in the first counters and each byte value in the first subset is associated with a second counter. The occurrences of the first subset of pixel byte values are counted in the second idle frame, and a second subset of pixel byte values is selected based on the counts in the second counters and used to create the encoding table. In one aspect, the encoding table is created when the second set of pixel byte values satisfy a threshold.

## Claims

### Claim 1

A method comprising:
associating a plurality of first counters with a plurality of pixel byte values, each counter associated with several pixel byte values;
incrementing a count in each first counter upon an occurrence of an associated pixel byte value in a first idle frame;
selecting a first set of pixel byte values based on the counts in the first counters;
associating each of the first set of pixel byte values with one of a plurality of second counters;
incrementing a count in each second counter upon an occurrence of the associated pixel byte value in a second idle frame;
selecting a second set of pixel byte values based on the counts in the second counters;
associating each of the second set of pixel byte values with a code; and
compressing a subsequent idle frame by replacing at least a minimum number of the second set of pixel byte values in the subsequent idle frame with the associated code.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the second set of pixel byte values is associated with a code if the second set of pixel byte values satisfies a threshold.

### Claim 3 (depends on 1)

The method of claim 1 further comprising:
decompressing a compressed idle frame by replacing a code with the associated pixel byte value.

### Claim 4 (depends on 1)

The method of claim 1 further comprising:
compressing a non-idle frame by replacing at least one of the second set of pixel byte values in the non-idle frame with the associated code.

### Claim 5 (depends on 4)

The method of claim 4 further comprising:
decompressing a compressed non-idle frame by replacing a code with the associated pixel byte value.

### Claim 6 (depends on 1)

The method of claim 1, wherein compressing a subsequent idle frame formats the subsequent idle frame as plurality of data blocks, each data block comprising:
a data field containing data representing a plurality of pixel bytes;
an encoding key that specifies which pixel bytes are represented by codes in the data field; and
a mode field that specifies a compression mode for the data field.

### Claim 7 (depends on 6)

The method of claim 6, wherein the mode field determines lengths for the data field and the encoding key.

### Claim 8 (depends on 6)

The method of claim 6 further comprising:
determining the compression mode based on patterns of the second set of pixel byte values in the subsequent idle frame.

### Claim 9 (depends on 1)

The method of claim 1 further comprising:
receiving an idle notification prior to receiving the first idle frame.

### Claim 10

A machine-readable medium providing instructions, which when executed by a machine, causes the machine to perform operations comprising:
associating a plurality of first counters with a plurality of pixel byte values, each counter associated with several pixel byte values;
incrementing a count in each first counter upon an occurrence of an associated pixel byte value in a first idle frame;
selecting a first set of pixel byte values based on the counts in the first counters;
associating each of the first set of pixel byte values with one of a plurality of second counters;
incrementing a count in each second counter upon an occurrence of the associated pixel byte value in a second idle frame;
selecting a second set of pixel byte values based on the counts in the second counters;
associating each of the second set of pixel byte values with a code; and
compressing a subsequent idle frame by replacing at least a minimum number of the second set of pixel byte values in the subsequent idle frame with the associated code.

### Claim 11 (depends on 10)

The machine-readable medium of claim 10, wherein each of the second set of pixel byte values is associated with a code if the second set of pixel byte values satisfies a threshold.

### Claim 12 (depends on 10)

The machine-readable medium of claim 10 further comprising:
decompressing a compressed idle frame by replacing a code with the associated pixel byte value.

### Claim 13 (depends on 10)

The machine-readable medium of claim 10 further comprising:
compressing a non-idle frame by replacing at least one of the second set of pixel byte values in the non-idle frame with the associated code.

### Claim 14 (depends on 13)

The machine-readable medium of claim 13 further comprising:
decompressing a compressed non-idle frame by replacing a code with the associated pixel byte value.

### Claim 15 (depends on 10)

The machine-readable medium of claim 10, wherein compressing a subsequent idle frame formats the subsequent idle frame as plurality of data blocks, each data block comprising:
a data field containing data representing a plurality of pixel bytes;
an encoding key that specifies which pixel bytes are represented by codes in the data field; and
a mode field that specifies a compression mode for the data field.

### Claim 16 (depends on 15)

The machine-readable medium of claim 15, wherein the mode field determines lengths for the data field and the encoding key.

### Claim 17 (depends on 15)

The machine-readable medium of claim 15 further comprising:
determining the compression mode based on detecting patterns of the second set of pixel byte values in the subsequent idle frame.

### Claim 18 (depends on 10)

The machine-readable medium of claim 10 further comprising:
receiving an idle notification prior to receiving the first idle frame.

### Claim 19

An computer system comprising:
a processor coupled to a memory through a bus;
a graphics controller coupled to the processor through the bus; and
a compression process executed by the graphics controller to cause the graphics controller to;
associate a plurality of first counters with a plurality of pixel byte values, each counter associated with several pixel byte values,
increment a count in each first counter upon an occurrence of an associated pixel byte value in a first idle frame received from the processor,
select a first set of pixel byte values based on the counts in the first counters,
associate each of the first set of pixel byte values with one of a plurality of second counters,
increment a count in each second counter upon an occurrence of the associated pixel byte value in a second idle frame received from the processor,
select a second set of pixel byte values based on the counts in the second counters,
associate each of the second set of pixel byte values with a code, and
compress a subsequent idle frame received from the processor by replacing at least a minimum number of the second set of pixel byte values in the subsequent idle frame with the associated code.

### Claim 20 (depends on 19)

The system of claim 19, wherein the compression process further causes the graphics controller to associate each of the second set of pixel byte values with a code if the second set of pixel byte values satisfies a threshold.

### Claim 21 (depends on 19)

The system of claim 19, wherein the compression process further causes the graphics controller to compress a non-idle frame received from the processor by replacing at least a minimum number of the second set of pixel byte values in the non-idle frame with the associated code upon receiving an override indicator from the processor.

### Claim 22 (depends on 19)

The system of claim 19, wherein the graphics controller executes the compression process upon receiving an idle notification from the processor.

### Claim 23 (depends on 19)

The system of claim 19, wherein the compression process further causes the graphics controller to store the compressed subsequent idle frame to the memory as plurality of data blocks, each data block comprising:
a data field containing data representing a plurality of pixel bytes;
an encoding key that specifies which pixel bytes are represented by codes in the data field; and
a mode field that specifies a compression mode for the data field.

### Claim 24 (depends on 23)

The system of claim 23 further comprising a graphics memory coupled to the graphics controller and wherein the graphics controller stores the plurality of data blocks to the graphics memory.

### Claim 25 (depends on 19)

The system of claim 19, wherein the compression process is embedded in logic within the graphics controller.

### Claim 26 (depends on 19)

The system of claim 19 further comprising a decompression process executed by the graphics controller to cause the graphics controller to decompress a compressed idle frame by replacing a code with the associated pixel byte value.

### Claim 27

An apparatus comprising:
a first set of comparators coupled to a set of accumulators, each comparator to increment a corresponding accumulator when a pixel byte value in an idle frame satisfies a parameter for the comparator, wherein the parameter is a value range for a first pass;
a statistics register coupled to the set of accumulators to determine a subset of the accumulators based on accumulator counts;
a second set of comparators coupled to the set of accumulators and the statistics register to determine a set of pixel byte values corresponding to the subset of the accumulators, wherein the set of pixel byte values are used as the parameters for the first set of comparators for a second pass; and
a set of registers coupled to the second set of comparators to hold the set of pixel byte values upon completion of the second pass.

### Claim 28 (depends on 27)

The apparatus of claim 27 further comprising:
logic to separate pixels in the idle frame into pixel bytes.

### Claim 29 (depends on 27)

The apparatus of claim 27, wherein the first pass processes a first idle frame and the second pass processes a second idle frame.
