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

International Conference on Information Photonics

Decoding of long-block soft decision LDPC codes for optical communication systems

Meer Sakib, Andrew J. Wong, Warren J. Gross, Odile Liboiron-Ladouceur

Published May 1, 2011• 0 citations
Publisher

Abstract

We investigate a soft decision decoder for LDPC codes with long-block size. The results show a coding gain of 5.9 dB compared to an uncoded system and 1.5 dB over a hard decision receiver.
DOI
10.1109/ico-ip.2011.5953744

Related papers

Energy-efficient soft-decision LDPC FEC For long-haul optical communication

Kevin Cushon, Per Larsson-Edefors, Peter A. Andrekson

We present forward error correction systems based on a low-complexity LDPC decoding algorithm and randomly-structured LDPC codes. Simulation and ASIC synthesis results show throughput and net coding gain sufficient for long-haul applications, with greatly reduced energy consumption.

European Conference on Optical Communication•Sep 1, 2015•2 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

Low Complexity Soft Decision Circuit for LDPC decoders

Meer Sakib, Venkatesan Mahalingam, Andrew J. Wong +2 more

A reduced complexity implementation is proposed of an optical receiver for the soft decoding of low density parity check codes. Coding gain of 9.4 dB is achieved using 20 % of the incoming optical signal.

•Jan 1, 2011•1 citation

Reduced-Complexity Decoding Algorithm for LDPC Codes for Practical Circuit Implementation in Optical Communications

Yoshikuni Miyata, Rui Sakai, Wataru Matsumoto +2 more

For superior, practical decoding of LDPC based FEC, a cyclic approximated delta-minimum algorithm is proposed. Simulation shows that 3-bit soft-decision decoding provides a required Q of 6.2 dB at 10-6BER with only 16 iterations.

Optical Fiber Communication Conference•Mar 1, 2007•17 citations

Performance Comparison of Binary LDPC Decoders and FPGA Implementation of Encoder

Jayashree C. Nidagundi, Siddarama R. Patil

Modern Communication standards deals with high and efficient data transmission and reception.LDPC codes show the error correction performance very close to Shannon's limit.The proposed work deals with performance analysis of both hard and soft decoding methods of LDPC codes and FPGA implementation of encoder and hard decision decoding.Soft decision decoders shows very good performance for rate ½ (8,4) codes.

Bonfring International Journal of Research in Communication Engineering•Nov 30, 2016•0 citations

Two decoding algorithms for low-density parity-check codes

Telex M. N. Ngatched, Martin Bossert, A. Fahrner

In this paper, a low complexity algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performance at smaller complexity.

International Conference on Communications•Aug 16, 2005•3 citations
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.
In this paper, a low complexity algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performance at smaller complexity.