# US 8,279,934 B2 · Multilevel data compression using a single compression engine

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

- Number: US 8,279,934 B2
- Document ID: US8279934B2
- Status: Granted
- Kind: B2
- Application number: 11/710,721
- Filed: 2007-02-26
- Published: 2007-06-28
- Granted: 2012-10-02
- Earliest claimed: 2001-12-20
- Assignees: AT&T Intellectual Property I, L.P.
- Inventors: Brad Allen Medford; Ahmad Ansari; Pierre Costa; John Robert Erickson
- Web page: https://patentgrep.com/patent/US8279934B2

## CPC

- H04N 19/436: using parallelised computational arrangements
- H04N 19/60: using transform coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A single compression engine transmits first and second discrete cosine transform (DCT)-encoded signals. The first DCT-encoded signal uses at most t coefficient bits to represent each of a plurality of DCT coefficients. The second DCT-encoded signal uses at most u coefficient bits, where u is less than t, to represent each of the plurality of DCT coefficients.

## Claims

### Claim 1

A method comprising:
transmitting a first discrete cosine transform (DCT)-encoded signal which uses at most t coefficient bits to represent each of a plurality of DCT coefficients;
transmitting a second DCT-encoded signal which uses at most u coefficient bits, wherein u is less than t, to represent each of the plurality of DCT coefficients by removing at least one lesser-significant bit from each of the DCT coefficients having t coefficient bits;
wherein a single compression engine transmits the first DCT-encoded signal and the second DCT-encoded signal at substantially the same time; and
determining the plurality of DCT coefficients based on a discrete cosine transform of a plurality of blocks of data.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
transmitting a third DCT-encoded signal which uses at most v coefficient bits to represent each of the plurality of DCT coefficients by removing at least two lesser-significant bits from each of the DCT coefficients having t coefficient bits;
wherein v is less than u.

### Claim 3 (depends on 1)

The method of claim 1 wherein the first DCT-encoded signal uses t coefficient bits to represent each of the plurality of DCT coefficients, and wherein the second DCT-encoded signal uses u coefficient bits to represent each of the plurality of DCT coefficients.

### Claim 4 (depends on 1)

The method of claim 1 wherein the first DCT-encoded signal is transmitted via a first data communication link having a first bandwidth, wherein the second DCT-encoded signal is transmitted via a second data communication link having a second bandwidth, and wherein the first bandwidth is greater than the second bandwidth.

### Claim 5 (depends on 1)

The method of claim 1 wherein the first DCT-encoded signal has a first data rate, wherein the second DCT-encoded signal has a second data rate, and wherein the first data rate is greater than the second data rate.

### Claim 6 (depends on 1)

The method of claim 1 wherein the first DCT-encoded signal and the second DCT-encoded signal are substantially synchronized.

### Claim 7

A non-transitory computer-usable medium storing a set of instructions to direct a processor to perform acts of:
transmitting a first discrete cosine transform (DCT)-encoded signal which uses at most t coefficient bits to represent each of a plurality of DCT coefficients;
transmitting a second DCT-encoded signal which uses at most u coefficient bits, wherein u is less than t, to represent each of the plurality DCT coefficients by removing at least one lesser-significant bit from each of the DCT coefficients having t coefficient bits;
wherein a single compression engine provides the first DCT-encoded signal and the second DCT-encoded signal at substantially the same time; and
determining the plurality of DCT coefficients based on a discrete cosine transform of a plurality of blocks of data.

### Claim 8 (depends on 7)

The computer-usable medium of claim 7, wherein the first DCT-encoded signal uses t coefficient bits to represent each of the plurality of DCT coefficients, and wherein the second DCT-encoded signal uses u coefficient bits to represent each of the plurality of DCT coefficients.

### Claim 9 (depends on 7)

The computer-usable medium of claim 7 wherein the first DCT-encoded signal is transmitted via a first data communication link having a first bandwidth, wherein the second DCT-encoded signal is transmitted via a second data communication link having a second bandwidth, and wherein the first bandwidth is greater than the second bandwidth.

### Claim 10 (depends on 7)

The computer-usable medium of claim 7 wherein the first DCT-encoded signal has a first data rate, wherein the second DCT-encoded signal has a second data rate, and wherein the first data rate is greater than the second data rate.

### Claim 11 (depends on 7)

The computer-usable medium of claim 7 wherein the first DCT-encoded signal and the second DCT-encoded signal are substantially synchronized.

### Claim 12

A computer system configured to execute computer readable program code stored on a computer readable medium, the computer program code comprising code executable to implement:
a compression engine to transmit a first discrete cosine transform (DCT)-encoded signal which uses at most t coefficient bits to represent each of a plurality of DCT coefficients and to transmit a second DCT-encoded signal which uses at most u coefficient bits, wherein u is less than t, to represent each of the plurality of DCT coefficients by removing at least one lesser-significant bit from each of the DCT coefficients having t coefficient bits wherein the compression engine is operative to transmit the first DCT-encoded signal and the second DCT-encoded signal at substantially the same time;
wherein the single compression engine is further operative to determine the plurality of DCT coefficients based on a discrete cosine transform of a plurality of blocks of data.

### Claim 13 (depends on 12)

The system of claim 12, wherein the first DCT-encoded signal uses t coefficient bits to represent each of the plurality of DCT coefficients, and wherein the second DCT-encoded signal uses u coefficient bits to represent each of the plurality of DCT coefficients.

### Claim 14 (depends on 12)

The system of claim 12 wherein the first DCT-encoded signal is transmitted via a first data communication link having a first bandwidth, wherein the second DCT-encoded signal is transmitted via a second data communication link having a second bandwidth, and wherein the first bandwidth is greater than the second bandwidth.

### Claim 15 (depends on 12)

The system of claim 12 wherein the first DCT-encoded signal has a first data rate, wherein the second DCT-encoded signal has a second data rate, and wherein the first data rate is greater than the second data rate.

### Claim 16 (depends on 12)

The system of claim 12 wherein the first DCT-encoded signal and the second DCT-encoded signal are substantially synchronized.
