Rateless Packet Decoding with Reverse Pivot Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing rateless coding methods for decoding encoded packets are slow due to the need to search for a pivot row in ascending order, leading to prolonged decoding times and the requirement for large buffers to manage packet groups.
Innovation Solution
A terminal and packet decoding method that uses a storage means to hold a matrix and a flag, performing exclusive OR operations on corresponding elements to determine and insert encoded packets as row vectors, allowing for intermediate pivot row determination and reducing calculation delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If Gaussian elimination is used to decode encoded packets by searching for pivot rows in ascending order, then decoding accuracy is achieved, but decoding speed deteriorates and calculation time increases
Solution Approach 1:
The patent inverts the traditional Gaussian elimination approach by searching for pivot rows in descending order (from last row to first row) instead of ascending order. This inversion allows the decoding process to identify and process pivot rows more efficiently, reducing the number of calculations required while maintaining decoding accuracy. The reverse search strategy enables faster identification of suitable pivot rows, directly improving decoding speed without sacrificing correctness.
Solution Approach 2:
The patent performs preliminary actions by pre-identifying potential pivot rows and organizing encoded packets in a manner that facilitates faster processing. By preparing the data structure in advance and anticipating pivot row locations through reverse-order search, the system reduces real-time calculation requirements, thereby improving decoding speed while preserving accuracy.
2Reliability
If traditional Gaussian elimination is used for packet decoding, then complete decoding is achieved, but buffer size requirements increase due to prolonged decoding times
Solution Approach 1:
By inverting the pivot row search order to descending sequence, the patent enables the decoding process to complete more rapidly. This reduced decoding time allows packets to be processed and forwarded sooner, decreasing the duration for which packets must be retained in buffers. Consequently, smaller buffer sizes suffice to maintain decoding completeness and reliability.
Solution Approach 2:
The inverted Gaussian elimination method enables the decoding system to serve itself more efficiently by reducing external dependencies on large buffer storage. The improved algorithm inherently manages packet timing and processing faster, allowing the system to operate with minimal buffer requirements while maintaining complete and reliable decoding outcomes.
3Ease of operation
If ascending order pivot row search is used, then systematic decoding is maintained, but calculation complexity and time increase
Solution Approach 1:
The patent maintains systematic decoding through the inverted Gaussian elimination method by systematically searching pivot rows from last to first. This reverse systematic approach preserves the structured nature of the decoding process while reducing calculation time. The method remains deterministic and organized, ensuring ease of operation and implementation while achieving faster results compared to traditional ascending-order search.
Data Source
AI summary
To speed up processing for decoding a source packet from a coded packet based on rateless coding, a terminal is provided with: a storage unit which holds a matrix with n rows and n columns and an n-bit flag; and a calculation unit which performs processing for extracting an element that becomes 1 in both a received n-bit coded packet and the flag, and performing processing for performing an exclusive OR operation of a row vector of the matrix that corresponds to the element number of the extracted element and the received coded packet on all extracted elements, determines an element that is the first to become 1 in the coded packet after the exclusive OR operation, and inserts, into the matrix, the coded packet after the exclusive OR operation as a row vector corresponding to the element number of the determined element.