Binary ternary quad tree partitioning for JVET

A method of decoding a Joint Video Exploration Team (JVET) bitstream, the method comprising:

• receiving a bitstream indicating partitioning of a coding tree unit into coding units according to least one of quadtree partitioning, binary partitioning, and/or ternary partitioning, wherein a root node is recursively partitionable using asymmetric ternary partitioning;
• parsing said bitstream to determine how the coding tree unit was partitioned using the quadtree partitioning, binary partitioning, and/or ternary partitioning;
• parsing said bitstream to determine a symmetry of said partitioning, wherein asymmetric ternary partitioning splits a parent node into three child nodes, wherein at least two of the three child nodes are partitioned into sizes that are unequal;
• identifying each of the child nodes within each respective parent coding unit, including identifying whether the node was recursively partitioned into smaller nodes,
• wherein both ternary and binary partitioning are allowed in the partitioning structure in either order during the recursive partitioning of the root node or parent node;
• and
• decoding the identified child nodes according to a Joint Video Exploration Team (JVET) coding scheme.

A method of multiple partitioning of a video coding block for Joint Video Exploration Team (JVET), the method comprising:

• representing a JVET coding tree unit as a root node in a binary, ternary, and quadtree (BTQT) structure having a quadtree branching from the root node and any of quadtree, binary or ternary trees branching from each of the quadtree's leaf nodes;
• using asymmetric ternary partitioning to split a child node represented by a quadtree leaf node into three child nodes wherein at least two of the three child nodes are partitioned into sizes that are unequal;
• using symmetric partitioning to split a second child node represented by a quadtree leaf node into child nodes of equal size,
• wherein the asymmetric ternary partitioning and the symmetric partitioning occur in any order and within the same BTQT structure;
• and
• representing the child nodes as leaf nodes in each quadtree, binary, and/or ternary tree branching from the quadtree leaf node.