Coding for Optical Communications – Can We Approach the Shannon Limit With Low Complexity?

09/19/2019

∙

Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for future very high-throughput, low-complexity optical communications.

READ FULL TEXT

Coding for Optical Communications – Can We Approach the Shannon Limit With Low Complexity?

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

2-Local Hamiltonian with Low Complexity is QCMA

Geometric Constellation Shaping with Low-complexity Demappers for Wiener Phase-noise Channels

Low-Complexity Steered Response Power Mapping based on Nyquist-Shannon Sampling

Correlated Eigenvalues Optical Communications

Making the Most of Sporadic Feedback: Low-Complexity Application-Layer Coding for Data Recovery in the Internet of Things

High-throughput Onboard Hyperspectral Image Compression with Ground-based CNN Reconstruction

Coding for Optical Communications – Can We Approach the Shannon Limit With Low Complexity?

Related Research

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

2-Local Hamiltonian with Low Complexity is QCMA

Geometric Constellation Shaping with Low-complexity Demappers for Wiener Phase-noise Channels

Low-Complexity Steered Response Power Mapping based on Nyquist-Shannon Sampling

Correlated Eigenvalues Optical Communications

Making the Most of Sporadic Feedback: Low-Complexity Application-Layer Coding for Data Recovery in the Internet of Things

High-throughput Onboard Hyperspectral Image Compression with Ground-based CNN Reconstruction