# US 2015/0146785 A1 · Video decoder memory bandwidth compression

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

- Number: US 2015/0146785 A1
- Document ID: US20150146785A1
- Status: Published application
- Kind: A1
- Application number: 14/175,774
- Filed: 2014-02-07
- Published: 2015-05-28
- Earliest claimed: 2013-11-25
- Assignees: Entropic Communications, Inc.
- Applicants: Entropic Communications, Inc.
- Inventors: Matthew Damian Bates; Mark Alan Baur
- Web page: https://patentgrep.com/patent/US20150146785A1

## CPC

- H04N 19/426: using memory downsizing methods
- G06F 12/00: Accessing, addressing or allocating within memory systems or architectures (digital input from, or digital output to record carriers, e.g. to disk storage units, G06F3/06)
- G06F 12/02: Addressing or allocation; Relocation (program address sequencing G06F9/00; arrangements for selecting an address in a digital store G11C8/00)
- G06F 12/06: Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication (G06F12/08 takes precedence)
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/423: characterised by memory arrangements (H04N19/433 takes precedence)
- H04N 19/428: {Recompression, e.g. by spatial or temporal decimation}
- H04N 19/433: characterised by techniques for memory access
- H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence)
- H04N 19/48: using compressed domain processing techniques other than decoding, e.g. modification of transform coefficients, variable length coding [VLC] data or run-length data (motion estimation in a transform domain H04N19/547; processing of decoded motion vectors H04N19/513)
- H04N 19/91: Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, system and computer program for decompressing video data, storing the compressed video data in such a way that random access is possible and the data can be mapped efficiently into existing memory systems and interface protocols. The compression is accomplished via lossless compression using an algorithm optimized for video data. Due to the compressed format, data transmission consumes less bandwidth than using uncompressed data and prevents degradation in the decoded video.

## Claims

### Claim 1

A method for interfacing between a main processing unit (SOC) and an external memory in a video processing system, the method comprising the steps of:
a) dividing video data into separable video data chunks;
b) losslessly compressing the separable video data chunks individually, wherein the compressed video data chunks comprise a percentage of uncompressed video data;
c) storing the compressed video data chunks at a same memory location as an uncompressed video chunk would occupy;
d) reading the stored compressed video data from memory; and
e) decoding and displaying the video.

### Claim 2 (depends on 1)

The method of claim 1 wherein the step of reading comprises linear reading.

### Claim 3 (depends on 1)

The method of claim 1 wherein the step of reading comprises random access reading.

### Claim 4 (depends on 1)

The method of claim 1 further comprising a next level of losslessly compressing comprising compressing at a member from the group consisting of eighty seven and a half percent (87.5%), seventy five percent (75%) and fifty prevent (50%).

### Claim 5 (depends on 1)

The method of claim 1 further comprising the step of randomly accessing the video data chunks from a buffer.

### Claim 6 (depends on 1)

The method of claim 1 further comprising the step of fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 7 (depends on 1)

The method of claim 1 wherein each video data chunk comprises multiple four by four (4×4) blocks.

### Claim 8 (depends on 1)

The method of claim 1 further comprising the step of indicating whether the video data chunks are compressed.

### Claim 9

A method of compressing and decompressing digital video, the method comprising the steps of:
a) dividing a video image into a two dimensional block structure;
b) determining a surface map generated from a difference of a mean of data values within the two dimensional block minus a mean of data values within subblocks within the two dimensional block by:
M
=
1
16

∑
y
=
0
3

∑
x
=
0
3

P
yx
a
=
1
4

∑
y
=
0
1

∑
x
=
0
1

P
yx
,
b
=
1
4

∑
y
=
0
1

∑
x
=
2
3

P
yx
,
c
=
1
4

∑
y
=
2
3

∑
x
=
0
1

P
yx
,

S
a
=
sign

(
M
-
a
)
,
S
b
=
sign

(
M
-
b
)
,
S
c
=
sign

(
M
-
c
)
,

d
=
1
4

∑
y
=
2
3

∑
x
=
2
3

P
yx
S
a
=
sign

(
M
-
d
)
,
c) applying a best fit factor, weighting to the surface map to minimize differences;
d) generating of VLC codes representing encoding levels, weighting, surface maps and error terms for each level of mapping; and
e) collecting VLC terms into a linear group of data losslessly representing a chunk of video data.

### Claim 10 (depends on 9)

The method of claim 9 further comprising the step of iterating on processing of resulting error terms for additional surface mapping and reduction of resultant bit encoding.

### Claim 11 (depends on 9)

The method of claim 9 further comprising the step of randomly accessing the chunk of video data from a buffer.

### Claim 12 (depends on 9)

The method of claim 9 further comprising the step of fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 13 (depends on 9)

The method of claim 9 further comprising the step of indicating whether the video data chunk is compressed.

### Claim 14

A system for interfacing between a main processing unit (SOC) and an external memory in a video processing system comprising:
means for dividing video data into separable video data chunks;
means for losslessly compressing the separable video data chunks individually, wherein the compressed video data chunks comprise a percentage of uncompressed video data;
means for storing the compressed video data chunks at a same memory location as an uncompressed video chunk would occupy;
means for reading the stored compressed video data from memory; and
means for decoding and displaying the video.

### Claim 15 (depends on 14)

The system of claim 14 wherein the means for reading comprises linear reading.

### Claim 16 (depends on 14)

The system of claim 14 wherein the means for reading comprises random access reading.

### Claim 17 (depends on 14)

The system of claim 14 further comprising a means for a next level of losslessly compressing comprising compressing at a member from the group consisting of eighty seven and a half percent (87.5%), seventy five percent (75%) and fifty prevent (50%).

### Claim 18 (depends on 14)

The system of claim 14 further comprising a means for randomly accessing the video data chunks from a buffer.

### Claim 19 (depends on 14)

The system of claim 14 further comprising a means for fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 20 (depends on 14)

The system of claim 14 wherein each video data chunk comprises multiple four by four (4×4) blocks.

### Claim 21 (depends on 14)

The system of claim 14 further comprising a means for indicating whether the video data chunks are compressed.

### Claim 22

A system for compressing and decompressing digital video comprising:
means for dividing a video image into a two dimensional block structure;
means for determining a surface map generated from a difference of a mean of data values within the two dimensional block minus a mean of data values within subblocks within the two dimensional block by:
M
=
1
16

∑
y
=
0
3

∑
x
=
0
3

P
yx
a
=
1
4

∑
y
=
0
1

∑
x
=
0
1

P
yx
,
b
=
1
4

∑
y
=
0
1

∑
x
=
2
3

P
yx
,
c
=
1
4

∑
y
=
2
3

∑
x
=
0
1

P
yx
,

S
a
=
sign

(
M
-
a
)
,
S
b
=
sign

(
M
-
b
)
,
S
c
=
sign

(
M
-
c
)
,

d
=
1
4

∑
y
=
2
3

∑
x
=
2
3

P
yx
S
a
=
sign

(
M
-
d
)
,
means for applying a best fit factor, weighting to the surface map to minimize differences;
means for generating of VLC codes representing encoding levels, weighting, surface maps and error terms for each level of mapping; and
means for collecting VLC terms into a linear group of data losslessly representing a chunk of video data.

### Claim 23 (depends on 22)

The system of claim 22 further comprising a means for iterating on processing of resulting error terms for additional surface mapping and reduction of resultant bit encoding.

### Claim 24 (depends on 22)

The system of claim 22 further comprising a means for randomly accessing the chunk of video data from a buffer.

### Claim 25 (depends on 22)

The system of claim 22 further comprising a means for fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 26 (depends on 22)

The system of claim 22 further comprising a means for indicating whether the video data chunk is compressed.

### Claim 27

A non-transitory computer-executable storage medium comprising program instructions which are computer-executable to implement an interface between a main processing unit (SOC) and an external memory in a video processing system comprising:
program instructions that cause a division of video data into separable video data chunks;
program instructions that cause lossless compression of the separable video data chunks individually, wherein the compressed video data chunks comprise a percentage of uncompressed video data;
program instructions that cause a storage of the compressed video data chunks at a same memory location as an uncompressed video chunk would occupy;
program instructions that cause the stored compressed video data be read from memory; and
program instructions that cause the video to be decoded and displayed.

### Claim 28 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 wherein the program instructions that cause the stored compressed video data be read from memory comprises linear reading.

### Claim 29 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 wherein the program instructions that cause the stored compressed video data be read from memory comprises random access reading.

### Claim 30 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 further comprising program instructions that cause next level of losslessly compressing comprising compressing at a member from the group consisting of eighty seven and a half percent (87.5%), seventy five percent (75%) and fifty prevent (50%).

### Claim 31 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 further comprising program instructions that cause randomly accessing the video data chunks from a buffer.

### Claim 32 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 further comprising program instructions that cause fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 33 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 wherein each video data chunk comprises multiple four by four (4×4) blocks.

### Claim 34 (depends on 27)

The non-transitory computer-executable storage medium of claim 27 further comprising program instructions that cause an indicator whether the video data chunks are compressed.

### Claim 35

A non-transitory computer-executable storage medium comprising program instructions which are computer-executable to implement compressing and decompressing digital video comprising:
program instructions that cause a division of a video image into a two dimensional block structure;
program instructions that cause a determination of a surface map generated from a difference of a mean of data values within the two dimensional block minus a mean of data values within subblocks within the two dimensional block by:
M
=
1
16

∑
y
=
0
3

∑
x
=
0
3

P
yx
a
=
1
4

∑
y
=
0
1

∑
x
=
0
1

P
yx
,
b
=
1
4

∑
y
=
0
1

∑
x
=
2
3

P
yx
,
c
=
1
4

∑
y
=
2
3

∑
x
=
0
1

P
yx
,

S
a
=
sign

(
M
-
a
)
,
S
b
=
sign

(
M
-
b
)
,
S
c
=
sign

(
M
-
c
)
,

d
=
1
4

∑
y
=
2
3

∑
x
=
2
3

P
yx
S
a
=
sign

(
M
-
d
)
,
program instructions that cause an application of a best fit factor, weighted to the surface map to minimize differences;
program instructions that cause a generation of VLC codes representing encoding levels, weighting, surface maps and error terms for each level of mapping; and
program instructions that cause a collection of VLC terms into a linear group of data losslessly representing a chunk of video data.

### Claim 36 (depends on 35)

The non-transitory computer-executable storage medium of claim 35 further comprising program instructions that cause an iteration on processing of resulting error terms for additional surface mapping and reduction of resultant bit encoding.

### Claim 37 (depends on 35)

The non-transitory computer-executable storage medium of claim 35 further comprising program instructions that cause a random access of the chunk of video data from a buffer.

### Claim 38 (depends on 35)

The non-transitory computer-executable storage medium of claim 35 further comprising program instructions that cause fetching a first part of the video data chunk in a read operation and fetching a second part of the video data chunk if it is present.

### Claim 39 (depends on 35)

The non-transitory computer-executable storage medium of claim 35 further comprising program instructions that cause an indicator of whether the video data chunk is compressed.
