Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wireless and Optical Communications Conference

Block Markov Superposition Transmission of Algebraic QC-LDPC Codes for Optical Fiber Communications

Juewei Wang, Chao Chen, Xiao Ma

Published Aug 11, 2022• 2 citations
Publisher

Abstract

In this paper, a new forward error correcting (FEC) scheme is proposed for optical fiber communication system, which takes the algebraic quasi-cyclic low-density parity-check (QC-LDPC) codes as the component codes in the block Markov superposition transmission (BMST) system. The excellent error-correction ability of the algebraic QC-LDPC codes is then further improved by the use of BMST coding. The encoding algorithm and the two-stage decoding algorithm are also presented, both having linear complexity. It is predicted that, for the simulated high-rate codes, the frame error rate (FER) can be lower than 10−17in the high signal-to-noise (SNR) region according to the numerical results. The excellent performance in error-correction and decoding latency suggests that the proposed scheme may find applications in optical fiber communications.

DOI
10.1109/wocc55104.2022.9880606

Related papers

A layered QC-LDPC decoder architecture for high speed communication system

Chiu‐Wing Sham, Xu Chen, Wai M. Tam +2 more

The performance of a high-throughput long-distance communication system such as an optical transmission system is limited by the Net Coding Gain (NCG) of the Forward Error Correction (FEC) system. Summarizing the previous research works, Low-Density Parity-Check (LDPC) codes form one of the most promising FEC schemes to be applied in high-throughput communication systems. Designing a practical channel coding scheme with high code rate, low complexity, high throughput and extremely low error floor has always been a very challenging problem. Quasi-cyclic low-density parity-check (QC-LDPC) codes have been promising candidates to fulfill the above requirements but the implementation issues remain. In this paper, we propose a layered QC-LDPC decoder architecture with high code rate, low complexity, high throughput and excellent error performance. The architecture has been implemented using FPGA and the error performance has been shown to be good.

IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)•Dec 1, 2012•35 citations

A Construction Method of QC-LDPC Codes Based on Finite Field Cyclic Subgroup for Optical Communications

Yuan Jiangu

A construction method of Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes based on cyclic subgroups of finite field is proposed.The method owns the advantages such as easier construction,more flexible adjustment on code-length and code-rate and lower encoding/ decoding complexity.Moreover,a regular QC-LDPC(5334,4955)code suitable for optical communication systems is constructed by this construction method.The simulation results show that the code can gain good performance under the condition of additive white Gaussian noise(AWGN)channel with iterative decoding sum-product algorithm(SPA).The error-correction performance of the QC-LDPC(5334,4955)code is better than that of the classic RS(255,239) code which is widely used in optical communication system.Therefore,the constructed QC-LDPC(5334,4955)code can be better suitable for the long-haul and high-speed optical communication systems.

Bandaoti guangdian•Jan 1, 2013•0 citations

An Algebraic Construction of Quasi-Cyclic LDPC Codes Based on the Conjugates of Primitive Elements over Finite Fields

Muhammad Asif, Wuyang Zhou, Juma Saidi Ally +2 more

Recently, there have been major developments in utilizing the finite fields to construct Low-density Parity-check (LDPC) codes. In this correspondence, an algebraic approach based on the conjugates of primitive elements over finite fields to construct Quasi-Cyclic (QC) Low-Density Parity-Check codes is presented. Proposed QC-LDPC codes provide an excellent error performance with Belief Propagation (BP) decoding over an Additive White Gaussian Noise (AWGN) channel. Based on numerical results, the performance analysis shows that the proposed QC-LDPC codes perform as well as the randomly constructed Progressive edge growth (PEG) LDPC codes and algebraic QC-LDPC in the lower signal-to-noise ratio (SNR) region but outperform their counterparts in the higher SNR region. Also, the codes constructed are QC in nature, so the encoding can be done with shift register circuits having linear complexity.

IEEE International Conference on Communication Technology (ICCT)•Oct 1, 2018•3 citations

High-Rate Nonbinary Regular Quasi-Cyclic LDPC Codes for Optical Communications

Murat Arabaci, Ivan B. Djordjević, Ross Saunders +1 more

The parity-check matrix of a nonbinary (NB) low-density parity-check (LDPC) code over Galois field GF(q) is constructed by assigning nonzero elements from GF(q) to the 1s in corresponding binary LDPC code. In this paper, we state and prove a theorem that establishes a necessary and sufficient condition that an NB matrix over GF(q), constructed by assigning nonzero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic (QC) LDPC code, must satisfy in order for its null-space to define a nonbinary QC-LDPC (NB-QC-LDPC) code. We also provide a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes targeting different goals, e.g., a scheme that can be used to construct codes for which the fast-Fourier-transform-based decoding algorithm does not contain any intermediary permutation blocks between bit node processing and check node processing steps. Via Monte Carlo simulations, we demonstrate that NB-QC-LDPC codes can achieve a net effective coding gain of 10.8 dB at an output bit error rate of 10-12. Due to their structural properties that can be exploited during encoding/decoding and impressive error rate performance, NB-QC-LDPC codes are strong candidates for application in optical communications.

Journal of Lightwave Technology•Aug 7, 2009•41 citations

FPGA implementation of high-performance QC-LDPC decoder for optical communications

Ding Zou, Ivan B. Djordjević

Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 7, 2015•6 citations

Low Complexity LDPC for DVB Applications

Bahram Honary, Behzad Momahed Heravi, Nishit Pandya +2 more

Both constant and variable Forward Error Correcting (FEC) coding is provided by the DVB-S2 system. Variable FEC can be used to provide different levels of error protection according to applications & the channel condition to achieve Adaptive Coding. In this paper, we introduce an algebraic method for construction of well-structured variablerate Low Density Parity Check (LPDC) codes, enabling the system to switch between LDPC codes of different rates (9/10, 8/9, 5/6, 4/5, ...) using a single encoder and decoder structure. Well designed QC-LDPC codes can perform just as well as randomly constructed LDPC codes in terms of bit-error probability, block-error probability, and error floor, collectively. This paper describes BIBD based construction of QC-LDPC code using certain special classes of balanced incomplete block designs. A memory efficient implementation of Quasi-Cyclic LDPC decoder in a FPGA is discussed. For implementation of a LDPC decoder, a parity-check matrix should be stored in nonvolatile memory units which intensify the implementation issues. The idea discussed here is to reduce the memory requirements by real-time generation of the QC parity-check matrix instead of storing it. This is possible due to the circulant structure of QCLDPC codes. Synthesis results show that significant reduction in memory requirements is achievable.

•Sep 1, 2007•0 citations
In this paper, a new forward error correcting (FEC) scheme is proposed for optical fiber communication system, which takes the algebraic quasi-cyclic low-density parity-check (QC-LDPC) codes as the component codes in the block Markov superposition transmission (BMST) system. The excellent error-correction ability of the algebraic QC-LDPC codes is then further improved by the use of BMST coding. The encoding algorithm and the two-stage decoding algorithm are also presented, both having linear complexity. It is predicted that, for the simulated high-rate codes, the frame error rate (FER) can be lower than 10−17in the high signal-to-noise (SNR) region according to the numerical results. The excellent performance in error-correction and decoding latency suggests that the proposed scheme may find applications in optical fiber communications.
The performance of a high-throughput long-distance communication system such as an optical transmission system is limited by the Net Coding Gain (NCG) of the Forward Error Correction (FEC) system. Summarizing the previous research works, Low-Density Parity-Check (LDPC) codes form one of the most promising FEC schemes to be applied in high-throughput communication systems. Designing a practical channel coding scheme with high code rate, low complexity, high throughput and extremely low error floor has always been a very challenging problem. Quasi-cyclic low-density parity-check (QC-LDPC) codes have been promising candidates to fulfill the above requirements but the implementation issues remain. In this paper, we propose a layered QC-LDPC decoder architecture with high code rate, low complexity, high throughput and excellent error performance. The architecture has been implemented using FPGA and the error performance has been shown to be good.
A construction method of Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes based on cyclic subgroups of finite field is proposed.The method owns the advantages such as easier construction,more flexible adjustment on code-length and code-rate and lower encoding/ decoding complexity.Moreover,a regular QC-LDPC(5334,4955)code suitable for optical communication systems is constructed by this construction method.The simulation results show that the code can gain good performance under the condition of additive white Gaussian noise(AWGN)channel with iterative decoding sum-product algorithm(SPA).The error-correction performance of the QC-LDPC(5334,4955)code is better than that of the classic RS(255,239) code which is widely used in optical communication system.Therefore,the constructed QC-LDPC(5334,4955)code can be better suitable for the long-haul and high-speed optical communication systems.
Recently, there have been major developments in utilizing the finite fields to construct Low-density Parity-check (LDPC) codes. In this correspondence, an algebraic approach based on the conjugates of primitive elements over finite fields to construct Quasi-Cyclic (QC) Low-Density Parity-Check codes is presented. Proposed QC-LDPC codes provide an excellent error performance with Belief Propagation (BP) decoding over an Additive White Gaussian Noise (AWGN) channel. Based on numerical results, the performance analysis shows that the proposed QC-LDPC codes perform as well as the randomly constructed Progressive edge growth (PEG) LDPC codes and algebraic QC-LDPC in the lower signal-to-noise ratio (SNR) region but outperform their counterparts in the higher SNR region. Also, the codes constructed are QC in nature, so the encoding can be done with shift register circuits having linear complexity.
The parity-check matrix of a nonbinary (NB) low-density parity-check (LDPC) code over Galois field GF(q) is constructed by assigning nonzero elements from GF(q) to the 1s in corresponding binary LDPC code. In this paper, we state and prove a theorem that establishes a necessary and sufficient condition that an NB matrix over GF(q), constructed by assigning nonzero elements from GF(q) to the 1s in the parity-check matrix of a binary quasi-cyclic (QC) LDPC code, must satisfy in order for its null-space to define a nonbinary QC-LDPC (NB-QC-LDPC) code. We also provide a general scheme for constructing NB-QC-LDPC codes along with some other code construction schemes targeting different goals, e.g., a scheme that can be used to construct codes for which the fast-Fourier-transform-based decoding algorithm does not contain any intermediary permutation blocks between bit node processing and check node processing steps. Via Monte Carlo simulations, we demonstrate that NB-QC-LDPC codes can achieve a net effective coding gain of 10.8 dB at an output bit error rate of 10-12. Due to their structural properties that can be exploited during encoding/decoding and impressive error rate performance, NB-QC-LDPC codes are strong candidates for application in optical communications.
Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.
Both constant and variable Forward Error Correcting (FEC) coding is provided by the DVB-S2 system. Variable FEC can be used to provide different levels of error protection according to applications & the channel condition to achieve Adaptive Coding. In this paper, we introduce an algebraic method for construction of well-structured variablerate Low Density Parity Check (LPDC) codes, enabling the system to switch between LDPC codes of different rates (9/10, 8/9, 5/6, 4/5, ...) using a single encoder and decoder structure. Well designed QC-LDPC codes can perform just as well as randomly constructed LDPC codes in terms of bit-error probability, block-error probability, and error floor, collectively. This paper describes BIBD based construction of QC-LDPC code using certain special classes of balanced incomplete block designs. A memory efficient implementation of Quasi-Cyclic LDPC decoder in a FPGA is discussed. For implementation of a LDPC decoder, a parity-check matrix should be stored in nonvolatile memory units which intensify the implementation issues. The idea discussed here is to reduce the memory requirements by real-time generation of the QC parity-check matrix instead of storing it. This is possible due to the circulant structure of QCLDPC codes. Synthesis results show that significant reduction in memory requirements is achievable.