	US 12,457,337 B2
	General block partitioning method
Seungwook Hong, San Diego, CA (US); Krit Panusopone, San Diego, CA (US); Limin Wang, San Diego, CA (US); and Yue Yu, San Diego, CA (US)
Assigned to ARRIS Enterprises LLC, Horsham, PA (US)
Filed by ARRIS Enterprises LLC, Horsham, PA (US)
Filed on Apr. 5, 2024, as Appl. No. 18/628,613.
Application 18/628,613 is a continuation of application No. 18/195,865, filed on May 10, 2023, granted, now 11,997,273.
Application 18/195,865 is a continuation of application No. 17/680,203, filed on Feb. 24, 2022, granted, now 11,677,945, issued on Jun. 13, 2023.
Application 17/680,203 is a continuation of application No. 16/867,351, filed on May 5, 2020, granted, now 11,297,318, issued on Apr. 5, 2022.
Application 16/867,351 is a continuation of application No. 16/396,327, filed on Apr. 26, 2019, granted, now 10,674,149, issued on Jun. 2, 2020.
Application 16/396,327 is a continuation of application No. 15/605,895, filed on May 25, 2017, granted, now 10,326,989.
Claims priority of provisional application 62/419,795, filed on Nov. 9, 2016.
Claims priority of provisional application 62/341,325, filed on May 25, 2016.
Prior Publication US 2024/0340416 A1, Oct. 10, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/119 (2014.01); H04N 19/107 (2014.01); H04N 19/159 (2014.01); H04N 19/172 (2014.01); H04N 19/176 (2014.01); H04N 19/46 (2014.01); H04N 19/61 (2014.01); H04N 19/70 (2014.01)

CPC H04N 19/119 (2014.11) [H04N 19/107 (2014.11); H04N 19/159 (2014.11); H04N 19/172 (2014.11); H04N 19/176 (2014.11); H04N 19/46 (2014.11); H04N 19/70 (2014.11); H04N 19/61 (2014.11)]

2 Claims

1. A method for decoding a bitstream using one or more processors, the method comprising:

(a) receiving said bitstream indicating how a coding tree unit is partitioned into final coding units according to a partitioning structure where a square parent block is split with quadtree partitioning that splits said square parent node in half in both horizontal and vertical directions to define four blocks as leaf nodes that are square in shape each of which are the same size, where a first leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said first leaf node in half in either a horizontal direction or a vertical direction resulting in two rectangular blocks that are the same size as leaf nodes where one of said rectangular leaf nodes of said symmetric binary partitioning is further split with symmetric binary partitioning resulting in two blocks that are the same size as leaf nodes, and where a second square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said second square leaf node in either a horizontal direction or a vertical direction resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a third square leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said third leaf node in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes where one of said leaf nodes of said symmetric binary partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a fourth square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said fourth leaf node resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, defining final coding units of said coding tree unit where at least one of said final coding units is square in shape and at least one of said final coding units is rectangular in shape, wherein said bitstream includes a plurality of network abstraction layer (NAL) units, wherein said bitstream includes a network abstraction layer (NAL) unit stream which includes said plurality of said network abstraction layer (NAL) units, wherein said quadtree partitioning is signaled with a first single-bit syntax element that can take one of two possible values of 0 or 1, wherein said asymmetric partitioning or said symmetric binary partitioning is signaled with a second single-bit syntax element that can take one of two possible values of 0 or 1, wherein said horizontal direction or said vertical direction is signaled with a third single-bit syntax element that can take one of two possible values of 0 or 1;

(b) parse said bitstream to determine a syntax associated with each final coding unit, wherein said syntax conforms to the following:

recursive asymmetric partitioning of the blocks of the coding tree unit is allowed;

recursive symmetric binary partitioning of the blocks of the coding tree unit is allowed;

a leaf node of said square parent block partitioned by said quadtree partitioning is partitionable via, any one of, selected from a group including quadtree partitioning, symmetric binary partitioning, and asymmetric partitioning;

at least one leaf node partitioned using asymmetric partitioning is not permitted to be further partitioned;

at least one leaf node partitioned using symmetric binary partitioning is not permitted to be further partitioned;