Network Packet Decoding Matrix for Low-Retransmission Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless networks, existing systems face challenges in maintaining low packet loss and retransmission rates, especially when data transmission is critical, as network coding methods require retransmission of entire packets even with minor errors or erasures.
Innovation Solution
The implementation of a method using Reed-Solomon codes to encode message packets into encoded packets with parity packets, allowing for successful decoding even with packet loss, by generating a decoding matrix and multiplying the received packet matrix to recover the original packets, thus reducing the need for retransmissions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If network coding is applied to transmit encoded functions of data bits, then the capacity and efficiency of network transmissions is improved, but the device complexity increases due to encoding and decoding operations
Solution Approach 1:
The patent changes the parameter of code structure by using systematic Reed-Solomon codes where encoded packets maintain the same length as original packets. This parameter change allows the encoded packets to be structured as systematic codes (original data packets plus parity packets), simplifying both encoding and decoding operations while maintaining high transmission efficiency
Solution Approach 2:
The patent segments the encoded packets into distinct components: original message packets and parity packets. This segmentation allows the receiver to identify and process different packet types separately, reducing decoding complexity while preserving the error correction capabilities of network coding
2Reliability
If Reed-Solomon codes are applied to encode symbols of message packets, then packet error correction capability is improved, but the computational complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing the generator polynomial and parity values during the encoding phase. The systematic Reed-Solomon code structure pre-organizes data packets with their corresponding parity information, so that during decoding, the receiver only needs to perform simple matrix operations rather than complex polynomial calculations, thus reducing computational complexity while maintaining error correction capability
Solution Approach 2:
The patent changes the computational approach by transforming the polynomial-based Reed-Solomon decoding into matrix-based operations. By representing the code structure as a systematic matrix with identity sub-matrices, the decoding process becomes a series of simpler matrix multiplications and inversions, reducing computational complexity while preserving the reliability benefits
3Ease of operation
If encoded packets are transmitted with the same length as message packets, then the ease of operation is improved, but the loss of information increases due to packet loss during transmission
Solution Approach 1:
The patent applies beforehand cushioning by incorporating parity packets into the transmitted encoded packets before transmission occurs. These parity packets contain redundant information that cushions against potential packet loss during transmission. If original message packets are lost, the receiver can use the parity packets combined with received packets to reconstruct the lost information, thus preventing information loss while maintaining simple fixed-length packet transmission
Data Source
AI summary
A network coding system. A packet decoding engine receives a number of received packets. A packet repository is coupled to the decoding engine to temporarily store the received packets. The packet decoding engine is configured to generate a decoding matrix by forming a sub-matrix by selecting columns of a network code matrix that have indices that are the same as the indices of the encoded packets that correspond to the selected received packets. The packet decoding engine is also configured to invert the sub-matrix to form the decoding matrix and multiply the received packet matrix by the decoding matrix to generate a recovered matrix where each column corresponds to a decoded packet.