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

IEEE Journal of Selected Topics in Quantum Electronics

Multilevel LDPC-Coded High-Speed Optical Systems: Efficient Hard Decoding and Code Optimization

Gong Chen, Xiaodong Wang

Published Dec 2, 2009• 3 citations
Publisher

Abstract

We consider a multilevel coding scheme employing low-density parity-check (LDPC) codes and high-order modulations for high-speed optical transmissions, where the coherent receiver performs either parallel independent decoding (PID) or multistage decoding (MSD). To meet the severe complexity constraint imposed by the ultrahigh data rate of the emerging optical transmission systems, we focus on hard-decision decoding of LDPC codes. A new LDPC hard decoding method is developed, which is equivalent to the Gallager decoding algorithm B, but is more efficient in terms of circuit implementation, since no variable node degree information is needed. Two variants of this decoder is also proposed, which offers significant performance gain for finite-length codes. We optimize the system by allocating rates and designing profiles for component codes. Both numerical evaluations and simulation results show that the optimized multilevel coding systems with either PID or MSD substantially outperform the optimized single-level LDPC-coded system.

DOI
10.1109/jstqe.2009.2034025

Related papers

Design and implementation of decoders for error correction in high-speed communication systems.

Joan Marc Català Pérez

This thesis is focused on the design and implementation of binary low-density parity-check (LDPC) code decoders for high-speed modern communication systems. The basic of LDPC codes and the performance and bottlenecks, in terms of complexity and hardware efficiency, of the main soft-decision and hard-decision decoding algorithms (such as Min-Sum, Optimized 2-bit Min-Sum and Reliability-based iterative Majority-Logic) are analyzed. The complexity and performance of those algorithms are improved to allow efficient hardware architectures.\n\nA new decoding algorithm called One-Minimum Min-Sum is proposed. It reduces considerably the complexity of the check node update equations of the Min-Sum algorithm. The second minimum is estimated from the first minimum value by a means of a linear approximation that allows a dynamic adjustment. The Optimized 2-bit Min-Sum algorithm is modified to initialize it with the complete LLR values and to introduce the extrinsic information in the messages sent from the variable nodes. Its variable node equation is reformulated to reduce its complexity. Both algorithms were tested for the (2048,1723) RS-based LDPC code and (16129,15372) LDPC code using an FPGA-based hardware emulator. They exhibit BER performance very close to Min-Sum algorithm and do not introduce early error-floor. \n\nIn order to show the hardware advantages of the proposed algorithms, hardware decoders were implemented in a 90 nm CMOS process and FPGA devices based on two types of architectures: full-parallel and partial-parallel one with horizontal layered schedule. The results show that the decoders are more area-time efficient than other published decoders and that the low-complexity of the Modified Optimized 2-bit Min-Sum allows the implementation of 10 Gbps decoders in current FPGA devices. \n\nFinally, a new hard-decision decoding algorithm, the Historical-Extrinsic Reliability-Based Iterative Decoder, is presented. This algorithm introduces the new idea of considering hard-decision votes as soft-decision to compute the extrinsic information of previous iterations. It is suitable for high-rate codes and improves the BER performance of the previous RBI-MLGD algorithms, with similar complexity.

•Jul 7, 2017•0 citations

On the implementation of long LDPC codes for optical communications

Andrew J. Wong

Very powerful long low-density parity-check (LDPC) codes, such as the ITU G.975.1 Standard (32643, 30592) LDPC Code [1], have been considered for optical communications. Traditional implementations of such long codes result in circuits requiring millions of interconnections, which are not affordable. This thesis investigates the performance of the hard-decision differential decoding with binary message-passing (DD-BMP) algorithm [2], a low-complexity algorithm requiring a minimal number of wires due to its binary messages. Our simulation results for the ITU G.975.1 standard demonstrate that hard-decision DD-BMP algorithm outperforms the results provided in the standard, and that the gap between the decoding performance of hard-decision DD-BMP and hard-decision sum-product is small at high signal-to-noise ratios (SNR). We also present a novel design methodology for implementing a soft-decision decoder by exploiting the code's structure. An implementation-efficient architecture is presented using a partially-parallel adaptation of the min-sum algorithm known as the line-passing algorithm. The line-passing algorithm makes soft-decision decoding available while requiring a minimal number of interconnections, which is attractive for long-haul optical communication systems.

•Jan 1, 2010•0 citations

An efficient stopping criterion of LDPC decoding for optical transmission

Ming Jiang, Jinfang Dou

The stopping criterion based on parity-check constraints is an inherent advantage of low-density parity-check (LDPC) codes. However, the parity-check computation with signs of the posterior information costs additional hardware or decoding delays, which may be a particular problem for the full-parallel LDPC decoding in optical transmission. Furthermore, the performance degradation caused by using simplified stopping criterions should also be considered, where the maximum number of the iterations is usually limited by the very high decoding speed in optical transmission. In this paper, we propose an efficient early stopping criterion with the consideration of the complexity/performance tradeoffs. The new method is based an intelligent combination of check equations and temporary hard decisions, and can be pipelined with check-node updating, thus leading to lower complexity and power consumption, which are desirable for both optical and wireless communications. Simulation results show that the hybrid criterion not only achieves the same performance as the conventional stopping criterions, but also provides a noticeable gain for the other simplified stopping criterions.

International Conference on Optical Communications and Networks (ICOCN)•Jan 1, 2010•5 citations

Bit-Flipping LDPC Decoding Algorithm for Optical Fiber Communication Systems

Oulfa Laouar, Imed Amamra, Nadir Derouiche

The increasing popularity of optical communication systems emphasizes the need for effective errorcorrection solutions, including high-efficiency hardware decoder designs and codes with strong performance. Within optical communication networks, Low-Density Parity-Check (LDPC) codes utilizing sparse matrices and decoded through the Bit-Flipping (BF) algorithm, known for its hard iterative decoding approach are extensively utilized. These codes effectively balance decoding complexity with error-correction performance.This paper focuses on comparing the optical performance of LDPC codes with and without the BF decoding algorithm using two simulation software packages: MATLAB and OptiSystem 7.0. The comparison is conducted across different wavelengths and quality factors. Through this study, we evaluate the advantages of LDPC codes in terms of error-rate reduction and enhancing the reliability of optical transmission.

International Conference on Advances in Electrical and Communication Technologies (ICAECOT)•Oct 1, 2024•0 citations

Iteration-Aware LDPC Code Design for Low-Power Optical Communications

Toshiaki Koike–Akino, David S. Millar, Keisuke Kojima +4 more

Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of high-performance LDPC codes under a constraint of finite-iteration decoding for low-power optical communications. We introduce an iteration-aware LDPC code design approach, which is based on decoding trajectory in extrinsic information transfer chart analysis. It is demonstrated that an LDPC code designed by the conventional curve-fitting method exhibits nearly 2 dB of penalty, when the maximum number of iterations is limited. The results suggest that the LDPC code should be adaptively changed, e.g., when the number of decoding iterations is decreased to save power consumption. We also extend our design method to a multi-objective optimization concept by taking average degrees into account, so that the threshold and the computational complexity are minimized at the same time. The proposed Pareto-optimal codes can achieve additional 2-dB gain or 50% complexity reduction at maximum, in low-power decoding scenarios.

Journal of Lightwave Technology•Sep 11, 2015•37 citations

Two-Stage Hybrid decoding for Low-Density Parity-Check codes

Hany R. Zeidan, Maha Mohamed Elsabrouty

Low-density parity check (LDPC) codes are gaining increased attention in information theory field. However one of the main problems facing usage of these codes in communication systems is its high complexity decoding scheme that results in high decoding delay. Such a delay is not acceptable in many applications. This paper presents, a new hybrid decoding scheme. The proposed scheme mixes between soft-decision and hard-decision algorithms and provides a good tradeoff between error performance and decoding delay as proved by simulation results.

International Conference on Innovations in Information Technology•Nov 1, 2007•2 citations
We consider a multilevel coding scheme employing low-density parity-check (LDPC) codes and high-order modulations for high-speed optical transmissions, where the coherent receiver performs either parallel independent decoding (PID) or multistage decoding (MSD). To meet the severe complexity constraint imposed by the ultrahigh data rate of the emerging optical transmission systems, we focus on hard-decision decoding of LDPC codes. A new LDPC hard decoding method is developed, which is equivalent to the Gallager decoding algorithm B, but is more efficient in terms of circuit implementation, since no variable node degree information is needed. Two variants of this decoder is also proposed, which offers significant performance gain for finite-length codes. We optimize the system by allocating rates and designing profiles for component codes. Both numerical evaluations and simulation results show that the optimized multilevel coding systems with either PID or MSD substantially outperform the optimized single-level LDPC-coded system.
This thesis is focused on the design and implementation of binary low-density parity-check (LDPC) code decoders for high-speed modern communication systems. The basic of LDPC codes and the performance and bottlenecks, in terms of complexity and hardware efficiency, of the main soft-decision and hard-decision decoding algorithms (such as Min-Sum, Optimized 2-bit Min-Sum and Reliability-based iterative Majority-Logic) are analyzed. The complexity and performance of those algorithms are improved to allow efficient hardware architectures.\n\nA new decoding algorithm called One-Minimum Min-Sum is proposed. It reduces considerably the complexity of the check node update equations of the Min-Sum algorithm. The second minimum is estimated from the first minimum value by a means of a linear approximation that allows a dynamic adjustment. The Optimized 2-bit Min-Sum algorithm is modified to initialize it with the complete LLR values and to introduce the extrinsic information in the messages sent from the variable nodes. Its variable node equation is reformulated to reduce its complexity. Both algorithms were tested for the (2048,1723) RS-based LDPC code and (16129,15372) LDPC code using an FPGA-based hardware emulator. They exhibit BER performance very close to Min-Sum algorithm and do not introduce early error-floor. \n\nIn order to show the hardware advantages of the proposed algorithms, hardware decoders were implemented in a 90 nm CMOS process and FPGA devices based on two types of architectures: full-parallel and partial-parallel one with horizontal layered schedule. The results show that the decoders are more area-time efficient than other published decoders and that the low-complexity of the Modified Optimized 2-bit Min-Sum allows the implementation of 10 Gbps decoders in current FPGA devices. \n\nFinally, a new hard-decision decoding algorithm, the Historical-Extrinsic Reliability-Based Iterative Decoder, is presented. This algorithm introduces the new idea of considering hard-decision votes as soft-decision to compute the extrinsic information of previous iterations. It is suitable for high-rate codes and improves the BER performance of the previous RBI-MLGD algorithms, with similar complexity.
Very powerful long low-density parity-check (LDPC) codes, such as the ITU G.975.1 Standard (32643, 30592) LDPC Code [1], have been considered for optical communications. Traditional implementations of such long codes result in circuits requiring millions of interconnections, which are not affordable. This thesis investigates the performance of the hard-decision differential decoding with binary message-passing (DD-BMP) algorithm [2], a low-complexity algorithm requiring a minimal number of wires due to its binary messages. Our simulation results for the ITU G.975.1 standard demonstrate that hard-decision DD-BMP algorithm outperforms the results provided in the standard, and that the gap between the decoding performance of hard-decision DD-BMP and hard-decision sum-product is small at high signal-to-noise ratios (SNR). We also present a novel design methodology for implementing a soft-decision decoder by exploiting the code's structure. An implementation-efficient architecture is presented using a partially-parallel adaptation of the min-sum algorithm known as the line-passing algorithm. The line-passing algorithm makes soft-decision decoding available while requiring a minimal number of interconnections, which is attractive for long-haul optical communication systems.
The stopping criterion based on parity-check constraints is an inherent advantage of low-density parity-check (LDPC) codes. However, the parity-check computation with signs of the posterior information costs additional hardware or decoding delays, which may be a particular problem for the full-parallel LDPC decoding in optical transmission. Furthermore, the performance degradation caused by using simplified stopping criterions should also be considered, where the maximum number of the iterations is usually limited by the very high decoding speed in optical transmission. In this paper, we propose an efficient early stopping criterion with the consideration of the complexity/performance tradeoffs. The new method is based an intelligent combination of check equations and temporary hard decisions, and can be pipelined with check-node updating, thus leading to lower complexity and power consumption, which are desirable for both optical and wireless communications. Simulation results show that the hybrid criterion not only achieves the same performance as the conventional stopping criterions, but also provides a noticeable gain for the other simplified stopping criterions.
The increasing popularity of optical communication systems emphasizes the need for effective errorcorrection solutions, including high-efficiency hardware decoder designs and codes with strong performance. Within optical communication networks, Low-Density Parity-Check (LDPC) codes utilizing sparse matrices and decoded through the Bit-Flipping (BF) algorithm, known for its hard iterative decoding approach are extensively utilized. These codes effectively balance decoding complexity with error-correction performance.This paper focuses on comparing the optical performance of LDPC codes with and without the BF decoding algorithm using two simulation software packages: MATLAB and OptiSystem 7.0. The comparison is conducted across different wavelengths and quality factors. Through this study, we evaluate the advantages of LDPC codes in terms of error-rate reduction and enhancing the reliability of optical transmission.
Recent low-density parity-check (LDPC) codes have shown capacity-approaching performance for various communications systems. However, their promising performance cannot always be obtained due to practical constraints, such as finite codeword length, finite iteration, finite memory, and finite precision. In this paper, we focus on a practical design method of high-performance LDPC codes under a constraint of finite-iteration decoding for low-power optical communications. We introduce an iteration-aware LDPC code design approach, which is based on decoding trajectory in extrinsic information transfer chart analysis. It is demonstrated that an LDPC code designed by the conventional curve-fitting method exhibits nearly 2 dB of penalty, when the maximum number of iterations is limited. The results suggest that the LDPC code should be adaptively changed, e.g., when the number of decoding iterations is decreased to save power consumption. We also extend our design method to a multi-objective optimization concept by taking average degrees into account, so that the threshold and the computational complexity are minimized at the same time. The proposed Pareto-optimal codes can achieve additional 2-dB gain or 50% complexity reduction at maximum, in low-power decoding scenarios.
Low-density parity check (LDPC) codes are gaining increased attention in information theory field. However one of the main problems facing usage of these codes in communication systems is its high complexity decoding scheme that results in high decoding delay. Such a delay is not acceptable in many applications. This paper presents, a new hybrid decoding scheme. The proposed scheme mixes between soft-decision and hard-decision algorithms and provides a good tradeoff between error performance and decoding delay as proved by simulation results.