# US 2019/0379890 A1 · Residual transformation and inverse transformation in video coding systems and methods

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

- Number: US 2019/0379890 A1
- Document ID: US20190379890A1
- Status: Published application
- Kind: A1
- Application number: 16/488,220
- Filed: 2017-02-23
- Published: 2019-12-12
- Earliest claimed: 2017-02-23
- Applicants: Realnetworks, Inc.
- Inventors: Chia-Yang TSAI; Wenpeng DING; Gang WU
- Web page: https://patentgrep.com/patent/US20190379890A1

## CPC

- H04N 19/122: Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/14: Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence)
- H04N 19/157: Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A transform block processing procedure wherein a maximum coding-block size and a maximum transform-block size for an unencoded video frame is determined. The unencoded video frame is divided into a plurality of coding-blocks including a first coding-block and the first coding block is divided into at least one prediction block and a plurality of transform blocks. The size of the transform blocks depend at least in part on the size of the coding block and the corresponding prediction blocks. The transform blocks are then encoded, thereby generating a video data payload of an encoded bit-stream. A frame header of the encoded bit-stream, including a maximum coding-block size flag and a maximum-transform-block-size flag, is generated.

## Claims

### Claim at position 1

1-18. (canceled)

### Claim 19

An encoding method, comprising:
obtaining a current coding block candidate of an unencoded video frame to be encoded; and
processing the current coding block candidate by, recursively:
testing a suitability of the current coding block candidate;
in response to the coding block candidate being suitable for encoding,
indexing the current coding block candidate for encoding; and
encoding the indexed current coding block candidate;
in response to the current coding block candidate being unsuitable for encoding,
determining a coding block splitting structure to apply to the current coding block candidate;
splitting the current coding block candidate into at least two new current coding block candidates based on the coding block splitting structure; and
setting each of the at least two new current coding block candidates as the current coding block candidate for recursive processing.

### Claim 20 (depends on 19)

The encoding method of claim 19, wherein testing the suitability of the current coding block candidate includes:
determining if the current coding block candidate contains pixels of a single value.

### Claim 21 (depends on 19)

The encoding method of claim 19, wherein testing the suitability of the current coding block candidate includes:
determining if the current coding block candidate contains pixels of a predefined pattern.

### Claim 22 (depends on 19)

The encoding method of any of claim 19, wherein determining the coding block splitting structure to apply to the current coding block candidate includes:
selecting the coding block splitting structure from a vertical rectangular coding block structure, a horizontal rectangular coding structure, and a four square coding block structure.

### Claim 23 (depends on 19)

The encoding method of any of claim 19, wherein splitting the current coding block candidate into the at least two new current coding block candidates includes:
splitting the current coding block candidate along a horizontal transverse axis into a first coding block candidate and a second coding block candidate.

### Claim 24 (depends on 19)

The encoding method of any of claim 19, wherein splitting the current coding block candidate into the at least two new current coding block candidates includes:
splitting the current coding block candidate along a vertical transverse axis into a first coding block candidate and a second coding block candidate.

### Claim 25 (depends on 19)

The encoding method of any of claim 19, wherein splitting the current coding block candidate into the at least two new current coding block candidates includes:
splitting the current coding block candidate along a horizontal transverse axis and along a vertical transverse axis into four coding block candidates.

### Claim 26 (depends on 19)

The encoding method of any of claim 19, wherein encoding each indexed coding block candidate includes:
encoding each corresponding indexed coding block candidate with at least one coding block split flag to indicate how the current coding block is split to result in the corresponding indexed coding block.

### Claim 27

An encoding device, comprising:
a non-transitory memory that stores computer instructions; and
at least one processor that executes the computer instructions to:
obtain a current coding block candidate of an unencoded video frame to be encoded; and
process the current coding block candidate by, recursively:
test a suitability of the current coding block candidate;
in response to the coding block candidate being suitable for encoding,
index the current coding block candidate for encoding; and
encode the indexed current coding block candidate;
in response to the current coding block candidate being unsuitable for encoding,
determine a coding block splitting structure to apply to the current coding block candidate;
split the current coding block candidate into at least two new current coding block candidates based on the coding block splitting structure; and
set each of the at least two new current coding block candidates as the current coding block candidate for recursive processing.

### Claim 28 (depends on 27)

The encoding device of claim 27, wherein the at least one processor tests the suitability of the current coding block candidate to be encoded by executing further computer instructions to:
determine if the current coding block candidate contains pixels of a single value.

### Claim 29 (depends on 27)

The encoding device of claim 27, wherein the at least one processor tests the suitability of the current coding block candidate to be encoded by executing further computer instructions to:
determine if the current coding block candidate contains pixels of a predefined pattern.

### Claim 30 (depends on 27)

The encoding device of any claim 27, wherein the at least one processor determines the coding block splitting structure to apply to the current coding block candidate by executing further computer instructions to:
select the coding block splitting structure from a vertical rectangular coding block structure, a horizontal rectangular coding structure, and a four square coding block structure.

### Claim 31 (depends on 27)

The encoding device of any claim 27, wherein the at least one processor splits the current coding block candidate into the at least two new current coding block candidates by executing further computer instructions to:
split the current coding block candidate along a horizontal transverse axis into a first coding block candidate and a second coding block candidate.

### Claim 32 (depends on 27)

The encoding device of any claim 27, wherein the at least one processor splits the current coding block candidate into the at least two new current coding block candidates by executing further computer instructions to:
split the current coding block candidate along a vertical transverse axis into a first coding block candidate and a second coding block candidate.

### Claim 33 (depends on 27)

The encoding device of any claim 27, wherein the at least one processor splits the current coding block candidate into the at least two new current coding block candidates by executing further computer instructions to:
split the current coding block candidate along a horizontal transverse axis and along a vertical transverse axis into four coding block candidates.
