Multiset-partition distribution matching

Tobias Fehenberger, David S. Millar (Corresponding author), Toshiaki Koike-Akino, Keisuke Kojima, Kieran Parsons

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

Abstract

Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit sequence to shaped amplitudes and plays an important role in the probabilistic amplitude shaping framework. With conventional constant-composition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multiset-partition distribution matching (MPDM), where the composition is constant over all output sequences. When considering the desired distribution as a multiset, MPDM corresponds to partitioning this multiset into equal-sized subsets. We show that MPDM allows addressing more output sequences and, thus, has a lower rate loss than CCDM in all nontrivial cases. By imposing some constraints on the partitioning, a constructive MPDM algorithm is proposed which comprises two parts. A variable-length prefix of the binary data word determines the composition to be used, and the remainder of the input word is mapped with a conventional CCDM algorithm, such as arithmetic coding, according to the chosen composition. Simulations of 64-ary quadrature amplitude modulation over the additive white Gaussian noise channel demonstrate that the block-length saving of MPDM over CCDM for a fixed gap to capacity is approximately a factor of 2.5-5 at medium to high signal-to-noise ratios.

Original languageEnglish
Article number8533438
Pages (from-to)1885 - 1893
Number of pages9
JournalIEEE Transactions on Communications
Volume67
Issue number3
DOIs
Publication statusPublished - Mar 2019

Fingerprint

Chemical analysis
Quadrature amplitude modulation
Signal to noise ratio

Keywords

  • Coded Modulation
  • Distributed databases
  • Distribution Matching
  • Encoding
  • Forward error correction
  • Modulation
  • Partitioning algorithms
  • Probabilistic Amplitude Shaping
  • Probabilistic logic
  • Signal to noise ratio
  • Distribution matching
  • coded modulation
  • probabilistic amplitude shaping

Cite this

Fehenberger, T., Millar, D. S., Koike-Akino, T., Kojima, K., & Parsons, K. (2019). Multiset-partition distribution matching. IEEE Transactions on Communications, 67(3), 1885 - 1893. [8533438]. https://doi.org/10.1109/TCOMM.2018.2881091
Fehenberger, Tobias ; Millar, David S. ; Koike-Akino, Toshiaki ; Kojima, Keisuke ; Parsons, Kieran. / Multiset-partition distribution matching. In: IEEE Transactions on Communications. 2019 ; Vol. 67, No. 3. pp. 1885 - 1893.
@article{90f858ec510c484fa34c3190fe387296,
title = "Multiset-partition distribution matching",
abstract = "Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit sequence to shaped amplitudes and plays an important role in the probabilistic amplitude shaping framework. With conventional constant-composition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multiset-partition distribution matching (MPDM), where the composition is constant over all output sequences. When considering the desired distribution as a multiset, MPDM corresponds to partitioning this multiset into equal-sized subsets. We show that MPDM allows addressing more output sequences and, thus, has a lower rate loss than CCDM in all nontrivial cases. By imposing some constraints on the partitioning, a constructive MPDM algorithm is proposed which comprises two parts. A variable-length prefix of the binary data word determines the composition to be used, and the remainder of the input word is mapped with a conventional CCDM algorithm, such as arithmetic coding, according to the chosen composition. Simulations of 64-ary quadrature amplitude modulation over the additive white Gaussian noise channel demonstrate that the block-length saving of MPDM over CCDM for a fixed gap to capacity is approximately a factor of 2.5-5 at medium to high signal-to-noise ratios.",
keywords = "Coded Modulation, Distributed databases, Distribution Matching, Encoding, Forward error correction, Modulation, Partitioning algorithms, Probabilistic Amplitude Shaping, Probabilistic logic, Signal to noise ratio, Distribution matching, coded modulation, probabilistic amplitude shaping",
author = "Tobias Fehenberger and Millar, {David S.} and Toshiaki Koike-Akino and Keisuke Kojima and Kieran Parsons",
year = "2019",
month = "3",
doi = "10.1109/TCOMM.2018.2881091",
language = "English",
volume = "67",
pages = "1885 -- 1893",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers",
number = "3",

}

Fehenberger, T, Millar, DS, Koike-Akino, T, Kojima, K & Parsons, K 2019, 'Multiset-partition distribution matching', IEEE Transactions on Communications, vol. 67, no. 3, 8533438, pp. 1885 - 1893. https://doi.org/10.1109/TCOMM.2018.2881091

Multiset-partition distribution matching. / Fehenberger, Tobias; Millar, David S. (Corresponding author); Koike-Akino, Toshiaki; Kojima, Keisuke; Parsons, Kieran.

In: IEEE Transactions on Communications, Vol. 67, No. 3, 8533438, 03.2019, p. 1885 - 1893.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Multiset-partition distribution matching

AU - Fehenberger, Tobias

AU - Millar, David S.

AU - Koike-Akino, Toshiaki

AU - Kojima, Keisuke

AU - Parsons, Kieran

PY - 2019/3

Y1 - 2019/3

N2 - Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit sequence to shaped amplitudes and plays an important role in the probabilistic amplitude shaping framework. With conventional constant-composition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multiset-partition distribution matching (MPDM), where the composition is constant over all output sequences. When considering the desired distribution as a multiset, MPDM corresponds to partitioning this multiset into equal-sized subsets. We show that MPDM allows addressing more output sequences and, thus, has a lower rate loss than CCDM in all nontrivial cases. By imposing some constraints on the partitioning, a constructive MPDM algorithm is proposed which comprises two parts. A variable-length prefix of the binary data word determines the composition to be used, and the remainder of the input word is mapped with a conventional CCDM algorithm, such as arithmetic coding, according to the chosen composition. Simulations of 64-ary quadrature amplitude modulation over the additive white Gaussian noise channel demonstrate that the block-length saving of MPDM over CCDM for a fixed gap to capacity is approximately a factor of 2.5-5 at medium to high signal-to-noise ratios.

AB - Distribution matching is a fixed-length invertible mapping from a uniformly distributed bit sequence to shaped amplitudes and plays an important role in the probabilistic amplitude shaping framework. With conventional constant-composition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multiset-partition distribution matching (MPDM), where the composition is constant over all output sequences. When considering the desired distribution as a multiset, MPDM corresponds to partitioning this multiset into equal-sized subsets. We show that MPDM allows addressing more output sequences and, thus, has a lower rate loss than CCDM in all nontrivial cases. By imposing some constraints on the partitioning, a constructive MPDM algorithm is proposed which comprises two parts. A variable-length prefix of the binary data word determines the composition to be used, and the remainder of the input word is mapped with a conventional CCDM algorithm, such as arithmetic coding, according to the chosen composition. Simulations of 64-ary quadrature amplitude modulation over the additive white Gaussian noise channel demonstrate that the block-length saving of MPDM over CCDM for a fixed gap to capacity is approximately a factor of 2.5-5 at medium to high signal-to-noise ratios.

KW - Coded Modulation

KW - Distributed databases

KW - Distribution Matching

KW - Encoding

KW - Forward error correction

KW - Modulation

KW - Partitioning algorithms

KW - Probabilistic Amplitude Shaping

KW - Probabilistic logic

KW - Signal to noise ratio

KW - Distribution matching

KW - coded modulation

KW - probabilistic amplitude shaping

UR - http://www.scopus.com/inward/record.url?scp=85056574474&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2018.2881091

DO - 10.1109/TCOMM.2018.2881091

M3 - Article

AN - SCOPUS:85056574474

VL - 67

SP - 1885

EP - 1893

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 3

M1 - 8533438

ER -

Fehenberger T, Millar DS, Koike-Akino T, Kojima K, Parsons K. Multiset-partition distribution matching. IEEE Transactions on Communications. 2019 Mar;67(3):1885 - 1893. 8533438. https://doi.org/10.1109/TCOMM.2018.2881091