Set partition modulation
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 div...
Main Authors: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IEEE
2020
|
_version_ | 1797086370405023744 |
---|---|
author | Yarkin, F Coon, JP |
author_facet | Yarkin, F Coon, JP |
author_sort | Yarkin, F |
collection | OXFORD |
description | 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. |
first_indexed | 2024-03-07T02:21:04Z |
format | Journal article |
id | oxford-uuid:a3ed005d-0459-41ed-a6a9-98407441b995 |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-07T02:21:04Z |
publishDate | 2020 |
publisher | IEEE |
record_format | dspace |
spelling | oxford-uuid:a3ed005d-0459-41ed-a6a9-98407441b9952022-03-27T02:30:26ZSet partition modulationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:a3ed005d-0459-41ed-a6a9-98407441b995EnglishSymplectic ElementsIEEE2020Yarkin, FCoon, JPIn 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. |
spellingShingle | Yarkin, F Coon, JP Set partition modulation |
title | Set partition modulation |
title_full | Set partition modulation |
title_fullStr | Set partition modulation |
title_full_unstemmed | Set partition modulation |
title_short | Set partition modulation |
title_sort | set partition modulation |
work_keys_str_mv | AT yarkinf setpartitionmodulation AT coonjp setpartitionmodulation |