Design of Polar Turbo Product Codes for Optical Fiber Communications Based on FPGA

Chen, Xinda; Qian, Weixing; Tao, Kai; Wang, Yongben; Wang, Weiming; Wang, Yinghao

doi:10.1109/acp55869.2022.10089058

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This exploration is motivated by the capacity-achieving attributes inherent to Polar codes, which render them an appealing choice for mitigating errors within storage devices [17]. Furthermore, within the field of quantum communication, Polar codes have garnered attention for their potential applications in error correction and the transmission of information through quantum channels [18]. Additionally, the applicability of Polar codes has extended to wireline communication systems, including optical fiber networks, as they offer a mechanism to alleviate transmission errors and enhance the overall performance of such systems [19].…”

Section: Introductionmentioning

confidence: 99%

An improved algorithm of generating shortening patterns for polar codes

El Kaime,

Ait Madi,

Benkhouya

et al. 2024

Int. j. electr. comput. eng. syst. (Online)

View full text Add to dashboard Cite

The rate matching in polar codes becomes a solution when non-conventional codewords of length N≠2n are required. Shortening is employed to design arbitrary rate codes from a mother code with a given rate. Based on the conventional shortening scheme, length of constructed polar codes is limited. In this paper, we demonstrate the presence of favorable and unfavorable shortening patterns. The structure of polar codes is leveraged to eliminate unfavorable shortening patterns, thereby reducing the search space. We generate an auxiliary matrix through likelihood and subsequently select the shortening bits from the matrix. Unlike different existing methods that offer only a single shortening pattern, our algorithm generates multiple favorable shortening patterns, encompassing all possible favorable configurations. This algorithm has a reduced complexity and suboptimal performance, effectively identifying shortening patterns and sets of frozen symbols for any polar code. Simulation results underscore that the shortened polar codes exhibit performance closely aligned with the mother codes. Our algorithm addresses this security concern by making it more difficult for an attacker to obtain the information set and frozen symbols of a polar code. This is done by generating multiple shortening patterns for any polar code.

show abstract

Section: Introductionmentioning

confidence: 99%