Set Partition Modulation
Set Partition Modulation
复制标题
DOI：
10.1109/twc.2020.3012739
复制
发表时间：
2019-10
影响因子：
10.4
通讯作者：
Ferhat Yarkin;J. Coon
中科院分区：
文献类型：
--
作者：
Ferhat Yarkin;J. Coon
在本文中，提出了一种称为集合分区调制（SPM）的新颖调制方案。在该方案中，集合划分和集合划分中的有序子集用于形成码字。我们定义了不同的 SPM 变体，并描述了将 SPM 与正交频分复用 (OFDM) 结合使用的实用模型。对于OFDM-SPM方案，不同的星座用于区分集合分区中的不同子集。为了使 OFDM-SPM 码字获得良好的距离特性以及更好的误码性能，我们定义了码本选择问题，并将此类问题表述为图论中的团问题。在这方面，我们提出了一种快速高效的码本选择算法。我们分析了所提出方案的误差和可实现的速率性能，并提供了性能的渐近结果。结果表明，所提出的 SPM 变体是通用方案，其中包括作为特殊情况的带索引调制的多模 OFDM (MM-OFDM-IM) 和带索引调制的双模 OFDM (DM-OFDM-IM)。它还表明，与传统 OFDM、OFDM-IM、DM-OFDM-IM 和 MM-OFDM-IM 相比，OFDM-SPM 方案能够表现出更好的误码性能并提高可实现速率。
In this paper, a novel modulation scheme called set partition modulation (SPM) is proposed. In this scheme, set partitioning and ordered subsets in the set partitions are used to form codewords. We define different SPM variants and depict a practical model for using SPM with orthogonal frequency division multiplexing (OFDM). For the OFDM-SPM schemes, different constellations are used to distinguish between different subsets in a set partition. To achieve good distance properties as well as better error performance for the OFDM-SPM codewords, we define a codebook selection problem and formulate such a problem as a clique problem in graph theory. In this regard, we propose a fast and efficient codebook selection algorithm. We analyze error and achievable rate performance of the proposed schemes and provide asymptotic results for the performance. It is shown that the proposed SPM variants are general schemes, which encompass multi-mode OFDM with index modulation (MM-OFDM-IM) and dual-mode OFDM with index modulation (DM-OFDM-IM) as special cases. It is also shown that OFDM-SPM schemes are capable of exhibiting better error performance and improved achievable rate than conventional OFDM, OFDM-IM, DM-OFDM-IM, and MM-OFDM-IM.