Loading [MathJax]/extensions/MathZoom.js
Optimum Bit-Level Distribution Matching with at Most O(N3) Implementation Complexity | IEEE Conference Publication | IEEE Xplore
Subscribe
ADVANCED SEARCH
Conferences >2019 Optical Fiber Communicat...

Optimum Bit-Level Distribution Matching with at Most O(N3) Implementation Complexity

PDF
Yohei Koganei; Kiichi Sugitani; Hisao Nakashima; Takeshi Hoshida
All Authors

Abstract:

An algorithm of distribution matching which could be effectively implemented for short block lengths of around 100 bit or less is proposed, enabling better performance th...Show More

Metadata

Abstract:

An algorithm of distribution matching which could be effectively implemented for short block lengths of around 100 bit or less is proposed, enabling better performance than the constant composition schemes with the same block lengths.
Published in: 2019 Optical Fiber Communications Conference and Exhibition (OFC)
Date of Conference: 03-07 March 2019
Date Added to IEEE Xplore: 25 April 2019
ISBN Information:
Conference Location: San Diego, CA, USA
Contents
Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.