Video Packetization Algorithm Minimizing Size Variance

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Digital video streams face challenges in efficiently transmitting video frames with varying partition sizes over networks, particularly in maintaining ordered sequences and minimizing packet size differences while adhering to predetermined maximum sizes, which affects transmission and decoding efficiency.

Innovation Solution

The system receives video frames with partitions of varying sizes, identifies partitions smaller than a maximum size, allocates them into packets to minimize size differences, and splits larger partitions into sub-partitions, ensuring no packet exceeds the maximum size and maintaining the ordered sequence, using a binary tree optimization method to allocate partitions efficiently.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If partitions of varying sizes are allocated into packets without optimization, then the transmission process is simple, but the difference in packet sizes becomes large leading to inefficient bandwidth utilization

Engineering Contradiction:

Improvebandwidth utilization efficiencyVSAvoidpacketization complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by calculating and storing the cumulative size of partitions before packetization, and pre-determining optimal packet boundaries using dynamic programming. This preparation work is done in advance to minimize packet size differences without adding complexity during the actual transmission process

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent uses dynamic programming to create an adaptive packetization scheme that dynamically determines optimal packet boundaries based on partition sizes. The algorithm adjusts packet boundaries flexibly to minimize size differences while handling varying partition sizes, making the system adaptable rather than rigid

Inventive Principle:

Principle #15Dynamics

2Reliability

If partitions are split into sub-partitions to fit maximum packet size, then no packet exceeds the maximum size, but the number of packets increases and processing complexity increases

Engineering Contradiction:

Improvepacket size complianceVSAvoidpartition processing complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies segmentation by dividing partitions that exceed the maximum packet size into smaller sub-partitions. This is done systematically using binary tree construction where each partition is recursively divided until all segments fit within the maximum size constraint, ensuring reliable packetization

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary action by constructing a binary tree representation of partitions before packetization. This pre-processing step organizes the segmentation logic in advance, making the actual packetization process more efficient and less complex

Inventive Principle:

Principle #10Preliminary action

3Productivity

If partitions are allocated to minimize packet size difference, then bandwidth utilization improves, but the allocation algorithm becomes more complex

Engineering Contradiction:

Improvetransmission efficiencyVSAvoidallocation algorithm complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-calculating cumulative partition sizes and storing them in an array before execution. This preparation enables the dynamic programming algorithm to efficiently compute optimal packet boundaries without complex real-time calculations during transmission

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent replaces complex iterative optimization algorithms with a dynamic programming approach that uses tabulation of cumulative sizes. This substitution transforms a potentially complex mechanical search process into a more efficient computational approach using stored intermediate results

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

4Measurement precision

If the ordered sequence of partitions is maintained during packetization, then decoding accuracy is preserved, but flexible packet allocation is restricted

Engineering Contradiction:

Improvedecoding accuracyVSAvoidpacket allocation flexibility

Core Design Contradiction:

Measurement precisionVSAdaptability or versatility

Solution Approach 1:

The patent applies segmentation by introducing packet boundary markers that segment the ordered partition sequence into packets. This allows the system to maintain the original ordered sequence for decoding accuracy while creating flexible packet structures that can be adapted to size constraints through strategic boundary placement

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS8687654B1Method to packetize an encoded video frame

Publication Date: 2014.04.01 GOOGLE LLC

AI summary

A system, method and apparatus for transmitting a packetized video stream over a network comprising receiving a frame of a video stream having a plurality of partitions of varying sizes, the plurality of partitions having an ordered sequence, identifying one or more of the plurality of partitions having a size that is less than a predetermined maximum, and allocating the identified one or more of the plurality of partitions into a plurality of packets in a manner that: (a) results in each packet having a size that is less than the predetermined maximum; (b) minimizes a cost value that is based at least in part on the difference between the size of the smallest packet and the size of the largest packet; and (c) maintains the allocated partitions in the ordered sequence. After allocation, the packets are transmitted over the network.