# US 2024/0187572 A1 · Coding algorithm for realizing distributed Gradual Decoding Refresh

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

- Number: US 2024/0187572 A1
- Document ID: US20240187572A1
- Status: Published application
- Kind: A1
- Application number: 18/075,934
- Filed: 2022-12-06
- Published: 2024-06-06
- Earliest claimed: 2022-12-06
- Assignees: Realtek Semiconductor Corp.
- Applicants: Realtek Semiconductor Corp.
- Inventors: WEI-MIN ZENG; CHI-WANG CHAI; WU-JUN CHEN; WEI LI; RONG ZHANG
- Web page: https://patentgrep.com/patent/US20240187572A1

## CPC

- H04N 19/107: between spatial and temporal predictive coding, e.g. picture refresh
- H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
- H04N 19/167: Position within a video image, e.g. region of interest [ROI]
- H04N 19/172: the region being a picture, frame or field
- H04N 19/174: the region being a slice, e.g. a line of blocks or a group of blocks
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A coding algorithm encodes consecutive frames of a video sequence and realizes distributed Gradual Decoding Refresh. The consecutive frames include a first frame, a second frame, and a third frame, and each frame is composed of (X+Y+Z) columns of coding tree units. The algorithm includes: coding X columns of the first frame in an intra coding manner and coding the other columns of the first frame in an inter coding manner and/or the intra coding manner; coding X columns of the second frame in the inter coding manner, coding Y columns of the second frame in the intra coding manner, and coding Z columns of the second frame in the inter and/or intra coding manner(s); and coding X and Y columns of the third frame in the inter coding manner, and coding Z columns of the third frame in the intra coding manner. The X/Y/Z columns (intra-coded columns) are inconsecutive.

## Claims

### Claim 1

A coding algorithm for encoding consecutive frames of a video sequence and thereby realizing distributed Gradual Decoding Refresh (GDR), wherein the consecutive frames include a first frame, a second frame, and a third frame in sequence, each of the first frame, the second frame, and the third frame is composed of N columns of coding tree units (CTUs), and the coding algorithm comprises:
coding X columns of CTUs of the first frame in an intra coding manner and coding (N−X) columns of CTUs of the first frame in one or both of an inter coding manner and the intra coding manner, and thereby generating a first distributed GDR frame, wherein the X columns of CTUs of the first frame are inconsecutive columns;
coding X columns of CTUs of the second frame in the inter coding manner, coding Y columns of CTUs of the second frame in the intra coding manner, and coding (N−X−Y) columns of CTUs of the second frame in one or both of the inter coding manner and the intra coding manner, and thereby generating a second distributed GDR frame, wherein positions of the X columns of CTUs of the second frame are corresponding to positions of the X columns of CTUs of the first frame and the Y columns of CTUs of the second frame are inconsecutive columns; and
coding X columns of CTUs of the third frame in the inter coding manner, coding Y columns of CTUs of the third frame in the inter coding manner, and coding Z columns of CTUs of the third frame in the intra coding manner, and thereby generating a third distributed GDR frame, wherein positions of the X columns of CTUs of the third frame are corresponding to the positions of the X columns of CTUs of the second frame, positions of the Y columns of CTUs of the third frame are corresponding to positions of the Y columns of CTUs of the second frame, and the Z columns of CTUs of the third frame are inconsecutive columns,
wherein the N is an integer equal to or greater than six, each of the X, the Y, and the Z is an integer equal to or greater than two.

### Claim 2 (depends on 1)

The coding algorithm of claim 1, wherein the N is equal to (X+Y+Z) and the first distributed GDR frame, the second distributed GDR frame, and the third distributed GDR frame are used to replace three Instantaneous Decoding Refresh (IDR) frames composed of an intra frame and two consecutive inter frames following the intra frame.

### Claim 3 (depends on 1)

The coding algorithm of claim 1, wherein the X, the Y, and the Z are the same.

### Claim 4 (depends on 1)

The coding algorithm of claim 1, wherein the X columns of CTUs of the first frame are coded without referring to data of the (N−X) columns of CTUs of the first frame, and the Y columns of CTUs of the second frame are coded without referring to data of the (N−X−Y) columns of CTUs of the second frame.

### Claim 5 (depends on 1)

The coding algorithm of claim 1, wherein a process for coding the X columns of CTUs of the first frame is only allowed to refer to data of the X columns of CTUs of the first frame;
a process for coding the Y columns of CTUs of the second frame is only allowed to refer to data of the X columns of CTUs of the second distributed GDR frame and data of the Y columns of CTUs of the second frame; and a process for coding the Z columns of CTUs of the third frame is only allowed to refer to data of the X columns of CTUs of the third distributed GDR frame, data of the Y columns of CTUs of the third distributed GDR frame, and data of the Z columns of CTUs of the third frame.

### Claim 6 (depends on 1)

The coding algorithm of claim 1, wherein the X columns of CTUs of the second frame are coded without referring to data of the (N−X) columns of CTUs of the first frame, and the X columns of CTUs of the third frame and the Y columns of CTUs of the third frame are coded without referring to data of the (N−X−Y) columns of CTUs of the second frame.

### Claim 7 (depends on 1)

The coding algorithm of claim 1, wherein a process for coding the X columns of CTUs of the second frame is only allowed to refer to data of the X columns of CTUs of the first distributed GDR frame, and a processing for coding the X columns of CTUs of the third frame and the Y columns of CTUs of the third frame is only allowed to refer to data of the X columns of CTUs of the second distributed GDR frame and data of the Y columns of CTUs of the second distributed GDR frame.

### Claim 8 (depends on 1)

The coding algorithm of claim 1, wherein any two columns of the X columns of CTUs of the first frame are inconsecutive; any two columns of the Y columns of CTUs of the second frame are inconsecutive; and any two columns of the Z columns of CTUs of the third frame are inconsecutive.

### Claim 9 (depends on 1)

The coding algorithm of claim 1, wherein an amount of data of the first distributed GDR frame is less than an amount of data of the first frame; an amount of data of the second distributed GDR frame is less than an amount of data of the second frame; and an amount of data of the third distributed GDR frame is less than an amount of data of the third frame.

### Claim 10 (depends on 1)

The coding algorithm of claim 1, wherein when the N is greater than (X+Y+Z), the third distributed GDR frame is generated with an additional step including: coding (N−X−Y−Z) column(s) of CTUs of the third frame in one or both of the inter coding manner and the intra coding manner.

### Claim 11

A coding algorithm for encoding consecutive frames of a video sequence and thereby realizing distributed Gradual Decoding Refresh (GDR), wherein the consecutive frames include a first frame and a second frame in sequence, each of the first frame and the second frame is composed of N columns of coding tree units (CTUs), and the coding algorithm comprises:
coding X columns of CTUs of the first frame in an intra coding manner and coding (N−X) columns of CTUs of the first frame in one or both of an inter coding manner and the intra coding manner, and thereby generating a first distributed GDR frame, wherein the X columns of CTUs of the first frame as a whole is inconsecutive; and
coding X columns of CTUs of the second frame in the inter coding manner and coding Y columns of CTUs of the second frame in the intra coding manner, and thereby generating a second distributed GDR frame, wherein positions of the X columns of CTUs of the second frame are corresponding to positions of the X columns of CTUs of the first frame, and the Y columns of CTUs of the second frame as a whole is inconsecutive,
wherein the N is an integer equal to or greater than four, each of the X and the Y is an integer equal to or greater than two.

### Claim 12 (depends on 11)

The coding algorithm of claim 11, wherein the N is equal to (X+Y), and the first distributed GDR frame and the second distributed GDR frame are used to replace two Instantaneous Decoding Refresh (IDR) frames composed of an intra frame and an inter frame following the intra frame.

### Claim 13 (depends on 11)

The coding algorithm of claim 11, wherein the X and the Y are the same.

### Claim 14 (depends on 11)

The coding algorithm of claim 11, wherein the X columns of CTUs of the first frame are coded without referring to data of the (N−X) columns of CTUs of the first frame, and the X columns of CTUs of the second frame are coded without referring to the data of the (N−X) columns of CTUs of the first distributed GDR frame.

### Claim 15 (depends on 11)

The coding algorithm of claim 11, wherein a process for coding the X columns of CTUs of the first frame is only allowed to refer to data of the X columns of CTUs of the first frame;
a process for coding the X columns of CTUs of the second frame is only allowed to refer the data of the X columns of CTUs of the first distributed GDR frame; and a process for coding the Y columns of CTUs of the second frame is only allowed to refer to data of the X columns of CTUs of the second distributed GDR frame and data of the Y columns of CTUs of the second frame.

### Claim 16 (depends on 11)

The coding algorithm of claim 11, wherein any two columns of the X columns of CTUs of the first frame are inconsecutive, and any two columns of the Y columns of CTUs of the second frame are inconsecutive.

### Claim 17 (depends on 11)

The coding algorithm of claim 11, wherein an amount of data of the first distributed GDR frame is less than an amount of data of the first frame, and an amount of data of the second distributed GDR frame is less than an amount of data of the second frame.

### Claim 18 (depends on 11)

The coding algorithm of claim 11, wherein when the N is greater than (X+Y), the second distributed GDR frame is generated with an additional step including: coding (N−X−Y) column(s) of CTUs of the second frame in one or both of the inter coding manner and the intra coding manner.
