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

Optics Express

On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission

Ivan B. Djordjević, Lei Xu, Ting Wang

Published Oct 20, 2010• 5 citations
Publisher

Abstract

We propose two reduced-complexity (RC) LDPC decoders, which can be used in combination with large-girth LDPC codes to enable ultra-high-speed serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.46 dB (at BER of 10(-9)) worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further study the use of RC LDPC decoding algorithms in multilevel coded modulation with coherent detection and show that with RC decoding algorithms we can achieve the net coding gain larger than 11 dB at BERs below 10(-9).

DOI
10.1364/oe.18.023371

Related papers

On the reduced-complexity of LDPC decoders for beyond 400 Gb/s serial optical transmission

Ivan B. Djordjević, Lei Xu, Ting Wang

Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 26, 2010•0 citations

On the reduced-complexity of LDPC decoders for beyond 400 Gb/s serial optical transmission

Ivan B. Djordjević, Lei Xu, Ting Wang

Two reduced-complexity (RC) LDPC decoders, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission, are proposed. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency.

Asia Communications and Photonics Conference•Dec 1, 2010•0 citations

On the Reduced-Complexity of LDPC Decoders for Beyond 400 Gb/s Serial Optical Transmission

Ivan B. Djordjević, Lei Xu, Ting Wang

Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.

Optical Transmission Systems, Switching, and Subsystems•Jan 1, 2010•0 citations

On the Implementation of Soft-Decision Decoders for High-Speed Optical Transmission

Ivan B. Djordjević

In this invited paper, we discuss large-girth LDPC codes suitable for high-speed optical transmission, and describe several reduced-complexity LDPC-decoding algorithms. We evaluate the quantization effect BER performance degradation and discuss FPGA implementation of reduced-complexity LDPC-decoders.

Advanced Photonics•Jan 1, 2011•0 citations

Optical LDPC decoders for beyond 100 Gbits/s optical transmission

Ivan B. Djordjević, Lei Xu, Ting Wang

We present an optical low-density parity-check (LDPC) decoder suitable for implementation above 100 Gbits/s, which provides large coding gains when based on large-girth LDPC codes. We show that a basic building block, the probabilities multiplier circuit, can be implemented using a Mach-Zehnder interferometer, and we propose corresponding probabilistic-domain sum-product algorithm (SPA). We perform simulations of a fully parallel implementation employing girth-10 LDPC codes and proposed SPA. The girth-10 LDPC(24015,19212) code of the rate of 0.8 outperforms the BCH(128,113)xBCH(256,239) turbo-product code of the rate of 0.82 by 0.91 dB (for binary phase-shift keying at 100 Gbits/s and a bit error rate of 10(-9)), and provides a net effective coding gain of 10.09 dB.

Optics Letters•Apr 23, 2009•5 citations

Experimental evaluation of high-speed optical fiber communication using nonbinary LDPC coded modulation with layered decoding

Murat Arabaci, Ivan B. Djordjević

In this paper, we present a reduced-latency nonbinary low-density parity-check (LDPC) coded modulation scheme suitable for high-speed optical fiber communication featuring the layered LDPC decoding algorithm. The use of the layered decoder in place of the conventional flooding decoder helps reduce by half the number of iterations taken in decoding. This in turn reduces the decoding latency, increases the decoding throughput, and significantly lowers the power consumption at the receiving ends of optical transport networks. We show by using the experimental data collected from a 4-ary rate-0.8 LDPC-coded NRZ-DQPSK modulation system that layered decoding indeed halves the required number of decoding iterations. We also show that, in the back-to-back configuration, even with a single iteration of layered decoding, one can attain a 7 dB gain in performance at the bit error ratio (BER) of 10-5when compared to using only the maximum a posteriori probability detector output based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm.

International Conference on Transparent Optical Networks•Jun 1, 2011•0 citations
We propose two reduced-complexity (RC) LDPC decoders, which can be used in combination with large-girth LDPC codes to enable ultra-high-speed serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.46 dB (at BER of 10(-9)) worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further study the use of RC LDPC decoding algorithms in multilevel coded modulation with coherent detection and show that with RC decoding algorithms we can achieve the net coding gain larger than 11 dB at BERs below 10(-9).
Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.
Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.
We present an optical low-density parity-check (LDPC) decoder suitable for implementation above 100 Gbits/s, which provides large coding gains when based on large-girth LDPC codes. We show that a basic building block, the probabilities multiplier circuit, can be implemented using a Mach-Zehnder interferometer, and we propose corresponding probabilistic-domain sum-product algorithm (SPA). We perform simulations of a fully parallel implementation employing girth-10 LDPC codes and proposed SPA. The girth-10 LDPC(24015,19212) code of the rate of 0.8 outperforms the BCH(128,113)xBCH(256,239) turbo-product code of the rate of 0.82 by 0.91 dB (for binary phase-shift keying at 100 Gbits/s and a bit error rate of 10(-9)), and provides a net effective coding gain of 10.09 dB.
In this paper, we present a reduced-latency nonbinary low-density parity-check (LDPC) coded modulation scheme suitable for high-speed optical fiber communication featuring the layered LDPC decoding algorithm. The use of the layered decoder in place of the conventional flooding decoder helps reduce by half the number of iterations taken in decoding. This in turn reduces the decoding latency, increases the decoding throughput, and significantly lowers the power consumption at the receiving ends of optical transport networks. We show by using the experimental data collected from a 4-ary rate-0.8 LDPC-coded NRZ-DQPSK modulation system that layered decoding indeed halves the required number of decoding iterations. We also show that, in the back-to-back configuration, even with a single iteration of layered decoding, one can attain a 7 dB gain in performance at the bit error ratio (BER) of 10-5when compared to using only the maximum a posteriori probability detector output based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm.