Experimental Demonstration of Rate-Adaptation via Hybrid Polar-BCH Product Code for Flexible PON

Yifan Ye, Bin Chen, Xiang Li, Yi Lei, Zhiwei Liang, Qingqing Hu, Can Zhao, Yanni OuECOC 2025 · DOI

TL;DR

This paper presents a novel hybrid Polar-BCH product code for flexible-rate passive optical networks (PONs). By combining the strengths of Polar codes for flexible rate adaptation and BCH codes for robust error correction, and employing a new hybrid decoding algorithm, they achieve significant power gains and improved rate adaptability in a 200G coherent PON experiment.

What Problem Does This Paper Address?

Modern access networks, particularly Passive Optical Networks (PONs), are facing an unprecedented demand for higher capacity and flexibility due to the rise of data-intensive applications like cloud computing and ultra-HD streaming. While coherent detection and advanced modulation techniques have boosted capacity, they also increase susceptibility to transmission errors. Forward Error Correction (FEC) is crucial for maintaining reliability. Traditional LDPC codes, while effective, can suffer from reduced coding gain and poor adaptability when their rates are significantly altered. Product codes offer a promising alternative with lower complexity, but their performance is often limited by the component codes and decoding methods. This paper addresses the need for a flexible, high-capacity FEC scheme that can adapt to varying link conditions without sacrificing performance or introducing excessive complexity, specifically within the context of coherent PONs.

Methods

The core innovation lies in the Hybrid Polar-BCH Product Code (PC) structure and its associated Hybrid Soft- and Hard-Decision Decoding (HSHD) algorithm.

  • Encoding: Information bits are arranged into a $K_1 \times K_2$ matrix. Polar codes are used as the row component codes, offering flexible rate adaptation by adjusting $K_1$ while maintaining a fixed codeword length $N_1$. BCH codes are used as the column component codes, operating at a fixed rate $K_2/N_2$. This asymmetric structure leverages Polar codes' flexibility and BCH codes' strong error correction.
  • Decoding: The HSHD algorithm iteratively decodes the code.
  • Row Decoding: Parallel Successive Cancellation List (SCL) decoding is applied to the Polar codes, producing soft information.
  • Column Decoding: The soft outputs from the row decoders are converted to hard decisions and then fed into a Binary-to-Decimal (BDD) decoder for the BCH codes.
  • Iterative Refinement: The key novelty is how the two decoders interact. If conflicts arise between the row and column decoding results, the soft information at the conflicting positions is updated based on the more trustworthy BCH decoding decision. This update uses a scaling factor ($\alpha$) to balance the influence of BCH corrections and the original soft information. This iterative process allows the Polar decoding to benefit from BCH-based corrections, while the BCH decoding receives more accurate hard inputs, leading to improved performance.

Datasets

Not discussed in the paper. The evaluation is performed using an experimental coherent PON testbed.

Key Insights and Ideas

  • Synergistic Strengths: The combination of Polar codes (flexible rate, good soft-decision performance) and BCH codes (robust hard-decision performance) in a product code structure creates a powerful FEC scheme.
  • Intelligent Iterative Decoding: The HSHD algorithm's ability to use BCH decoding outcomes to refine Polar decoding's soft information is crucial. This "guided" iterative process effectively mitigates error propagation and improves overall accuracy.
  • Smooth Rate Adaptation: Unlike traditional product codes that exhibit stair-step rate changes due to discrete hard codes, the Polar-BCH PC allows for smoother, more granular rate adaptation by adjusting the Polar code's information length. This is particularly valuable for dynamic link conditions.
  • Bridging the Gap: The scheme effectively bridges the gap between the performance limitations of purely hard-decision product codes and the complexity of some advanced soft-decision decoders, offering a compelling balance.

Key Results

  • Power Gain: The proposed Polar-BCH PC with HSHD achieved a received power gain of up to 1.75 dB over traditional BCH-BCH product codes with an iterative bounded distance decoder (iBDD) and 1.40 dB over those with a soft-aided bit-marking (SABM) decoder, at a post-FEC BER of $10^{-6}$.
  • Rate Flexibility: The system demonstrated improved net information rates. For instance, increasing the Polar code information length ($K_1$) from 229 to 240 (with $K_2=239$) resulted in a net information rate improvement of 4% to 13.4% under the same received power conditions.
  • Experimental Validation: The performance was experimentally demonstrated in a 200G coherent PON system over a 48 km standard single-mode fiber transmission.

Limitations and Future Work

  • Complexity: While the paper highlights lower complexity compared to some alternatives, the iterative nature of the HSHD algorithm still involves computational overhead. The exact complexity trade-offs compared to other FEC schemes are not exhaustively detailed.
  • Parameter Optimization: The scaling factor $\alpha$ was set to 3. Further optimization of this and other parameters (like the number of iterations $I_{max}$) for different channel conditions or code configurations could be explored.
  • Future Work: The authors suggest that this approach can support flexible code rate adaptation without requiring complex modifications to existing PON architectures, implying its potential for widespread adoption. Further research could focus on extending this to even higher data rates, different modulation formats, or more complex network topologies.

Summary updated

BibTeX
@inproceedings{ye2025experimental,
  author = {Yifan Ye and Bin Chen and Xiang Li and Yi Lei and Zhiwei Liang and Qingqing Hu and Can Zhao and Yanni Ou},
  title = {{Experimental Demonstration of Rate-Adaptation via Hybrid Polar-BCH Product Code for Flexible PON}},
  booktitle = {ECOC},
  year = {2025},
  doi = {10.1109/ecoc66593.2025.11263381},
}
Figure