Multi-Sub-Payload Packet Redundancy for Complete Data Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current redundancy schemes in communication systems, such as Low Bitrate Redundancy (LBRR), only allow for the recovery of one sub-payload when a packet is lost, as the redundancy information is limited to the immediately preceding packet, leading to incomplete data recovery.
Innovation Solution
A multi-sub-payload packet format is introduced where each packet includes redundancy information for multiple preceding sub-payloads, allowing for the recovery of all sub-payloads in case of packet loss by embedding redundancy information within subsequent packets, ensuring that the first sub-payload in a subsequent packet covers the last sub-payload of the previous packet and the second sub-payload covers other sub-payloads, enhancing data reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundancy information is limited to the immediately preceding packet (LBRR scheme), then the bitrate overhead is kept low, but only one sub-payload can be recovered when a packet is lost
Solution Approach 1:
The patent segments the redundancy information into multiple sub-payloads within a single packet. Instead of containing only one redundancy sub-payload as in LBRR, the invention divides the redundancy information into multiple segments (e.g., first sub-payload, second sub-payload, third sub-payload), each containing redundancy for different portions of the previous packet. This allows recovery of multiple lost sub-payloads while maintaining low bitrate overhead.
Solution Approach 2:
The patent transitions from a single-dimension redundancy approach (one redundancy sub-payload for one previous packet) to a multi-dimensional approach by organizing redundancy information across multiple sub-payloads within the same packet structure. This dimensional expansion enables comprehensive coverage of all sub-payloads in the previous packet without proportionally increasing overhead.
2Reliability
If multiple redundancy sub-payloads are embedded in each packet to recover all lost sub-payloads, then complete data recovery is enabled, but the packet size and processing complexity increase
Solution Approach 1:
The patent creates a universal packet structure where multiple sub-payloads serve dual purposes: primary data transmission and redundancy information storage. Each sub-payload can function as either original data or redundancy information depending on its position and the packet type, eliminating the need for separate dedicated redundancy structures and reducing overall system complexity.
Solution Approach 2:
The patent implements a nested structure where redundancy information is embedded within the same packet container as the primary data, similar to nested dolls. The first packet contains original sub-payloads, and the second packet contains sub-payloads that are nested within the same protocol structure but function as redundancy information for the first packet, creating a compact hierarchical organization.
3Reliability
If redundancy information is expanded to cover multiple preceding packets, then more comprehensive error correction is achieved, but the forward overhead increases significantly
Solution Approach 1:
The patent applies preliminary action by embedding all necessary redundancy information for multiple preceding packets into a single subsequent packet before transmission is complete. Rather than adding incremental redundancy with each passing packet, the system prepares and inserts comprehensive redundancy information in advance, allowing full error correction capability without continuous overhead accumulation.
Data Source
AI summary
Implementations described herein utilize redundancy information for packet data portions. For instance, a first packet includes multiple data portions. A second packet is generated that includes redundancy information for one or more of the multiple data portions of the first packet. In at least some implementations, the redundancy information can be used to determine whether an error condition occurs related to the first packet, such as data errors and/or a dropped data portion.