多集划分分布匹配
Multiset-Partition Distribution Matching
摘要:
分布匹配是从均匀分布的比特序列到成形幅度的固定长度的可逆映射,并且在概率幅度成形框架中起着重要作用。在传统的恒定成分分布匹配(CCDM)中,所有输出序列具有相同的成分.在本文中,我们提出了multisetpartition分布匹配(MPDM)的组成是恒定的所有输出序列。当考虑所需的分布作为一个多集,MPDM对应于分割成相等大小的子集这个多集。我们表明,MPDM允许解决更多的输出序列,从而具有较低的速率损失比CCDM在所有非平凡的情况下。通过对划分施加一些约束,提出了一种构造性的MPDM算法,该算法包括两部分。二进制数据字的可变长度前缀确定要使用的组成,并且输入字的剩余部分根据所选择的组成用常规CCDM算法(诸如算术编码)映射。在加性高斯白噪声信道上对64进制正交幅度调制的仿真表明,在中高信噪比(SNR)下,对于固定的容量间隙,MPDM比CCDM的块长度节省约为2.5至5倍。
英文摘要:
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 constantcomposition distribution matching (CCDM), all output sequences have identical composition. In this paper, we propose multisetpartition 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-size subsets. We show that MPDM allows to address more output sequences and thus has 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 to 5 at medium to high signal-to-noise ratios (SNRs).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。