Soft Demapping of Spherical Codes from Cartesian Powers of PAM Constellations (2404.04776v2)
Abstract: For applications in concatenated coding for optical communications systems, we examine soft-demapping of short spherical codes constructed as constant-energy shells of the Cartesian power of pulse amplitude modulation constellations. These are unions of permutation codes having the same average power. We construct a list decoder for permutation codes by adapting Murty's algorithm, which is then used to determine mutual information curves for these permutation codes. In the process, we discover a straightforward expression for determining the likelihood of large subcodes of permutation codes called orbits. We introduce a simple process, called orbit demapping, that allows us to extract soft information from noisy permutation codewords. In a sample communication system with probabilistic amplitude shaping protected by a standard low-density parity-check code that employs short permutation codes, we demonstrate that orbit demapping provides a gain of about 0.3 dB in signal-to-noise ratio compared to the traditional symbol-by-symbol demapping. By using spherical codes composed of unions of permutation codes, we can increase the input entropy compared to using permutation codes alone. In one scheme, we consider a union of a small number of permutation codes. In this case, orbit demapping provides about 0.2 dB gain compared to the traditional method. In another scheme, we use all possible permutations to form a spherical code that exhibits a computationally feasible trellis representation. The soft information obtained using the BCJR algorithm outperforms the traditional symbol-by-symbol method by 0.1 dB. Using the spherical codes containing all possible permutation codes of the same average power and the BCJR algorithm, a gain of 0.5 dB is observed. Comparison of the achievable information rates of bit-metric decoding verifies the observed gains.
- R. Rafie Borujeny and F. R. Kschischang, “Why constant-composition codes reduce nonlinear interference noise,” Journal of Lightwave Technology, vol. 41, pp. 4691–4698, July 2023.
- D. Slepian, “Permutation modulation,” Proceedings of the IEEE, vol. 53, pp. 228–236, Mar. 1965.
- G. Böcherer, F. Steiner, and P. Schulte, “Bandwidth efficient and rate-matched low-density parity-check coded modulation,” IEEE Transactions on Communications, vol. 63, pp. 4651–4665, Dec. 2015.
- P. Schulte and G. Böcherer, “Constant composition distribution matching,” IEEE Transactions on Information Theory, vol. 62, pp. 430–434, Jan. 2016.
- Berlin, Heidelberg: Springer Berlin Heidelberg, 1989.
- Y. C. Gültekin, T. Fehenberger, A. Alvarado, and F. M. Willems, “Probabilistic shaping for finite blocklengths: Distribution matching and sphere shaping,” Entropy, vol. 22, p. 581, May 2020.
- G. Böcherer et al., “Probabilistic amplitude shaping,” Foundations and Trends in Communications and Information Theory, vol. 20, pp. 390–511, June 2023.
- K. G. Murty, “An algorithm for ranking all the assignments in order of increasing cost,” Operations Research, vol. 16, pp. 682–687, June 1968.
- G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Transactions on Information Theory, vol. 28, pp. 55–67, Jan. 1982.
- P. Schulte, W. Labidi, and G. Kramer, “Joint decoding of distribution matching and error control codes,” in International Zurich Seminar on Information and Communication (IZS 2020), pp. 53–57, ETH Zurich, 2020.
- Y. Luo and Q. Huang, “Joint message passing decoding for LDPC codes with CCDMs,” Optics Letters, vol. 48, pp. 4933–4936, Oct. 2023.
- F. R. Kschischang and S. Pasupathy, “Optimal nonuniform signaling for Gaussian channels,” IEEE Transactions on Information Theory, vol. 39, pp. 913–929, May 1993.
- SIAM, 2012.
- H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, Mar. 1955.
- Cambridge, England: Cambridge University Press, Feb. 1988.
- J. Holstermann, “A generalization of the rearrangement inequality,” Mathematical Reflections, vol. 5, no. 4, 2017.
- T. Berger, F. Jelinek, and J. Wolf, “Permutation codes for sources,” IEEE Transactions on Information Theory, vol. 18, pp. 160–169, Jan. 1972.
- W. Myrvold and F. Ruskey, “Ranking and unranking permutations in linear time,” Information Processing Letters, vol. 79, pp. 281–284, Sept. 2001.
- A. Nordio and E. Viterbo, “Permutation modulation for fading channels,” in 10th International Conference on Telecommunications (ICT), vol. 2, pp. 1177–1183 vol.2, 2003.
- G. D. Forney, “Geometrically uniform codes,” IEEE Transactions on Information Theory, vol. 37, pp. 1241–1260, Sept. 1991.
- F. R. Kschischang, “The trellis structure of maximal fixed-cost codes,” IEEE Transactions on Information Theory, vol. 42, pp. 1828–1838, Nov. 1996.
- L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Transactions on Information Theory, vol. 20, pp. 284–287, Mar. 1974.
- 3GPP, “5G NR multiplexing and channel coding,” Tech. Rep. TS 138.212 V15.2.0 (2018-07), 3GPP, July 2018.
- T. M. Cover and J. A. Thomas, Elements of information theory. John Wiley & Sons, 2005.
- Y. C. Gültekin, W. J. van Houtum, A. G. C. Koppelaar, and F. M. J. Willems, “Enumerative sphere shaping for wireless communications with short packets,” IEEE Transactions on Wireless Communications, vol. 19, pp. 1098–1112, Feb. 2020.
- I. Ingemarsson, “Optimized permutation modulation,” IEEE Transactions on Information Theory, vol. 36, no. 5, pp. 1098–1100, 1990.