QDE Zipper Code Mapping to Reduce FEC Memory and Error Floors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional spatially-coupled product-like hard-decision forward error correction (FEC) codes, such as staircase and diagonal-zipper codes, face issues with high memory requirements and early error floors due to stall patterns, especially when low-power and low-latency performance is needed.
Innovation Solution
The implementation of low-power quasi-diagonal with extra level of protection (QDE) zipper codes using specific interleaver mapping functions (ϕ1, ϕ2) that distribute bits across multiple virtual and real buffers, providing enhanced protection and reducing harmful stall patterns.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional spatially-coupled product-like hard-decision FEC codes (such as staircase codes, diagonal-zipper codes) are used, then error correction capability is provided, but memory requirements become high and early error floors occur due to stall patterns
Solution Approach 1:
The code is segmented into multiple component codes arranged in a spatially-coupled structure with coupling factor λ. Each component code processes a section of the input sequence independently, allowing parallel processing and reducing the memory buffer size required for each individual component code while maintaining overall error correction capability through the coupled structure.
Solution Approach 2:
The patent introduces different mapping functions φ1 and φ2 for different sections of the buffer, creating local variations in the coding structure. This allows each local section to be optimized for low-power operation while collectively providing robust error correction, eliminating the need for uniform high-memory allocation across the entire system.
2Reliability
If conventional FEC codes are used to ensure reliable high-speed optical communication, then error protection is provided, but power consumption increases
Solution Approach 1:
The patent extracts and eliminates the harmful stall patterns that cause early error floors by using specially designed mapping functions φ1 and φ2. By removing these problematic patterns from the conventional code structure, the system achieves reliable error protection without requiring additional power-intensive error correction mechanisms.
Solution Approach 2:
The patent changes the structural parameters of the FEC code by introducing specific mapping functions that transform the conventional code structure into a low-power variant. This parameter change optimizes the balance between error protection capability and power consumption, making the system suitable for energy-constrained optical communication applications.
3Reliability
If conventional FEC codes are used for reliable communication, then error correction is achieved, but early error floors occur due to stall patterns
Solution Approach 1:
The patent applies preliminary anti-action by designing mapping functions φ1 and φ2 that proactively prevent the formation of harmful stall patterns before they can cause early error floors. The mapping functions are specifically constructed to distribute bits in a way that avoids the conditions that lead to stall patterns, thereby eliminating this harmful effect at the source.
Solution Approach 2:
The patent converts the potential harm of stall patterns into a benefit by using the same spatially-coupled structure to distribute errors more uniformly. The mapping functions transform what would be concentrated harmful stall patterns into dispersed, correctable error distributions, turning a potential failure mode into a robust error correction mechanism.
Data Source
AI summary
A method for encoding information bits using a zipper code. The zipper is associated with a real buffer for receiving the information bits, a first virtual buffer, a second virtual buffer, and two mapping functions ϕ1 and ϕ2. Each row of the real buffer, a corresponding row of the first virtual buffer, and a corresponding row of the second virtual buffer form a codeword of a component code. The two mapping functions ϕ1 and ϕ2 are for mapping each group of c bits in each row of the real buffer to c bits in one or more subsequent rows of the first virtual buffer and to c bits in one or more subsequent row of the second virtual buffer, respectively. The c bits in the first virtual buffer are in different rows thereof, and/or the c bits in the second virtual buffer are in different rows thereof.