Related Experiment Video
Updated: Jun 5, 2026

Quasi-light Storage for Optical Data Packets
Published on: February 6, 2014
On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission
Ivan B Djordjevic1, Lei Xu, Ting Wang
1Department of Electrical and Computer Engineering, University of Arizona, Tucson, Arizona 85721, USA. ivan@ece.arizona.edu
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).
Related Concept Videos
Reducing Line Loss
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
Lossless Lines
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
LC Circuits
Time-Domain Interpretation of PD Control
Consider the example of control of motor torque. Initially, a positive...

