Reproduce “Hierarchical Distribution Matching for Probabilistically Shaped Coded Modulation” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Tsuyoshi Yoshida, Magnus Karlsson, Erik Agrell
A Hierarchical Distribution Matching (HiDM) scheme, developed by researchers from Chalmers University of Technology and Mitsubishi Electric Research Laboratories, simplifies the practical implementation of probabilistically shaped coded modulation for high-throughput optical communications. It achieves massive hardware resource reductions and improved error propagation characteristics, requiring approximately 0.13 dB higher SNR compared to Constant Composition Distribution Matching (CCDM) while enabling higher measurable post-FEC BERs for system validation.
Key insights
- HiDM's hierarchical LUT structure drastically reduces memory requirements by over 10^194 times for realistic systems compared to single-LUT DMs, making high-throughput hardware implementation feasible.
- The scheme offers significantly improved error propagation characteristics through the inverse DM, with the ratio of post-invDM BER to post-FEC BER being 5.5 for HiDM versus 200 for CCDM.
- HiDM's less bursty error distribution and local placement of DM words within FEC codewords enhance compatibility with higher-layer protocols and potential concatenation with outer hard-decision FEC.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.