Codeword Reuse Coding for High Gain and Low Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional coding technologies face challenges in achieving both high coding gain and low delay simultaneously in data communication systems.
Innovation Solution
A coding method and apparatus that form a first codeword with 2n bits, using k coding bits, where n bits are from m previously formed codewords, and the remaining n bits include (k−n) information bits and (2n−k) check bits. This approach ensures that each bit in the codeword is protected by multiple codewords, improving decoding speed and reducing delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional FEC coding is used to ensure high coding gain, then error correction capability is improved, but transmission delay increases
Solution Approach 1:
The codeword is segmented into two parts: n bits that are reused from previous codewords and (k-n) new information bits. This segmentation allows the system to achieve high coding gain through multiple protections while reducing delay by not transmitting the n reused bits again, thus resolving the contradiction between reliability and transmission delay.
Solution Approach 2:
The n bits from previous codewords are prepared in advance and stored for reuse. This preliminary action enables the current codeword to benefit from previous coding work without retransmitting those bits, improving coding gain while reducing the transmission delay for the current data.
2Reliability
If multiple codewords are used to protect each bit, then coding gain is improved, but decoding complexity increases
Solution Approach 1:
Different bits in the codeword have different protection levels: bits from previous codewords benefit from multiple protections across different time instances, while new information bits receive standard protection. This local quality differentiation achieves high coding gain for critical bits without uniformly increasing decoding complexity for all bits.
Data Source
AI summary
A coding method and apparatus for data communication are provided, and may be applied to a plurality of scenarios such as a metro network, a backbone network, and a data center interconnection. As an example method, a first codeword is formed, where the first codeword includes n image bits and n to-be-transmitted bits. The n image bits are selected from to-be-transmitted bits in m source codewords. The m source codewords are formed before the first codeword. Both n and m are positive integers, and n>m; The n to-be-transmitted bits in the first codeword are sent. The bit in the first codeword can be protected by a plurality of codewords generated at different moments. In addition, the bit in the codeword can be protected by different quantities of codewords.