A method comprising: receiving a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets; continuously dividing each of said duplicates of said serial bit stream based on sequential time windows; with respect to each of said time windows, aligning said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity; and recreating in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

A method comprising: receiving a plurality of duplicates of a serial bit stream, wherein said serial bit stream comprises a sequence of data packets; continuously dividing each of said duplicates of said serial bit stream based on sequential time windows; with respect to each of said time windows, aligning said data packets associated with each of said duplicates of said serial bit stream, received within said time window, based, at least in part, on data packet similarity; and recreating in real time said serial bit stream by selecting at least one of said aligned data packets as representing a next data packet in said sequence of data packets.

A method of image compression, including, receiving at least one unprocessed image frame, transforming a domain of the at least one unprocessed image frame to output a transformed domain dataset, block processing the transformed domain dataset to yield a blocked dataset, quantizing the blocked dataset to produce a quantized dataset and entropy encoding the quantized dataset to construct at least one compressed image frame.

A method of image compression, including, receiving at least one unprocessed image frame, transforming a domain of the at least one unprocessed image frame to output a transformed domain dataset, block processing the transformed domain dataset to yield a blocked dataset, quantizing the blocked dataset to produce a quantized dataset and entropy encoding the quantized dataset to construct at least one compressed image frame.

Disclosed herein are a QTBT split structure allowing blocks of various shapes capable of more efficiently reflecting various local characteristics of video and a method of efficiently signaling the split structure.

In one method, the current block is partitioned into multiple final sub-blocks using one or more stages of sub-tree partition comprising ternary tree partition and at least one other-type partition, where ternary partition tree is excluded from the sub-tree partition if a current sub-tree depth associated with a current sub-block is greater than a first threshold and the first threshold is an integer greater than or equal to 1. In another method, if a test condition is satisfied, the current block is encoded or decoded using a current Inter mode selected from a modified group of Inter tools, where the modified group of Inter tools is derived from an initial group of Inter tools by removing one or more first Inter tools from the initial group of Inter tools, replacing one or more second Inter tools with one or more complexity-reduced Inter tools, or both.

Some embodiments include a method of signaling picture count information for decoding video pictures. The method sends a picture order count (POC) most significant bit (MSB) first flag indicating that a picture order count most significant bit second flag is present. The method sends the POC MSB second flag to indicate whether a POC MSB cycle element is present. When a value of the POC MSB present flag is true, the method sends the POC MSB element specifying a value of a POC MSB cycle.

A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

A video device to determine picture count information for decoding video pictures is provided. The video device decodes a picture order count (POC) most significant bit (MSB) first flag that indicates whether a POC MSB second flag is present. When the POC MSB second flag is present, the video device decodes the POC MSB second flag indicating whether a POC MSB cycle element is present. When the POC MSB cycle element is present, the video device decodes the POC MSB cycle element that specifies a value of a POC MSB cycle. The value of the POC MSB cycle is used to compute a POC MSB value that is combined with a POC least significant bit (LSB) value to produce a POC value used for decoding a first video picture, and a length of the POC LSB value is based on a maximum POC LSB minus four value.

A video decoding method includes obtaining split information indicating whether to split a current block, splitting the current block into two or more lower blocks when the split information indicates to split the current block, obtaining encoding order information indicating an encoding order of the lower blocks of the current block, determining a decoding order of the lower blocks according to the encoding order information, and decoding the lower blocks according to the decoding order.