Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Introducing RSESS: An Open Source Enumerative Sphere Shaping Implementation Coded in Rust (2402.08771v1)

Published 13 Feb 2024 in cs.IT, eess.SP, and math.IT

Abstract: In this work, we present an open-source implementation of the enumerative sphere shaping (ESS) algorithm used for probabilistic constellation shaping (PCS). PCS aims at closing the shaping gap caused by using uniformly distributed modulation symbols in channels for which information theory shows non-uniformly distributed signaling to be optimal. ESS is one such PCS algorithm that sets itself apart as it operates on a trellis representation of a subset of the possible symbol sequences. ESS leads to an empirical distribution of the symbols that closely approximates the optimal distribution for the additive white Gaussian noise (AWGN) channel. We provide an open-source implementation of this algorithm in the compiled language Rust, as well as Python bindings with which our Rust code can be called in a regular Python script. We also compare simulation results on the AWGN channel using our implementation with previous works on this topic.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. Bandwidth efficient and rate-matched low-density parity-check coded modulation. IEEE Transactions on Communications, 63(12):4651–4665, December 2015. doi: 10.1109/TCOMM.2015.2494016.
  2. On optimization and analysis of enumerative sphere shaping for short blocklengths. Journal of Lightwave Technology, 40(22):7265–7278, November 2022. doi: 10.1109/jlt.2022.3201901.
  3. Multiset-partition distribution matching. IEEE Transactions on Communications, 67(3):1885–1893, March 2019. doi: 10.1109/TCOMM.2018.2881091.
  4. Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations. IEEE Journal on Selected Areas in Communications, 7(6):877–892, August 1989. doi: 10.1109/49.29611.
  5. Efficient modulation for band-limited channels. IEEE Journal on Selected Areas in Communications, 2(5):632–647, September 1984. doi: 10.1109/jsac.1984.1146101.
  6. Enumerative sphere shaping for wireless communications with short packets. IEEE Transactions on Wireless Communications, 19:1098–1112, 2020. doi: 10.1109/twc.2019.2951139.
  7. Optimal nonuniform signaling for Gaussian channels. IEEE Transactions on Information Theory, 39(3):913–929, May 1993. doi: 10.1109/18.256499.
  8. On optimal shaping of multidimensional constellations. IEEE Transactions on Information Theory, 40(4):1044–1056, July 1994. doi: 10.1109/18.335969.
  9. Constant composition distribution matching. IEEE Transactions on Information Theory, 62(1):430–434, January 2016. doi: 10.1109/TIT.2015.2499181.
  10. Shannon, C. E. A mathematical theory of communication. The Bell System Technical Journal, 27(3):379–423, July 1948. doi: 10.1002/j.1538-7305.1948.tb01338.x.
  11. Approaching capacity by equiprobable signaling on the Gaussian channel. IEEE Transactions on Information Theory, 39(5):1714–1716, September 1993. doi: 10.1109/18.259663.
  12. A pragmatic approach to shaped coded modulation. In IEEE Symposium on Communications and Vehicular Technology in the Benelux, 1993.

Summary

We haven't generated a summary for this paper yet.