论文标题

具有索引调制的OFDM的最佳映射器:光谱计算分析

Optimal Mapper for OFDM with Index Modulation: A Spectro-Computational Analysis

论文作者

Queiroz, Saulo, Vilela, João P., Monteiro, Edmundo

论文摘要

在这项工作中,我们为OFDM提供了一个具有索引调制(OFDM-IM)的最佳映射器。通过最佳方式,我们的意思是,当频谱效率(SE)超过OFDM最大化时,映射器实现了最低可能的渐近计算复杂性(CC)。我们提出了Spectro-Computational(SC)分析,以捕获CC和SE之间的权衡,并证明$ n $ subcarrier ofdm-im映射器必须以$θ(n)$ time的复杂性运行。我们表明,OFDM-IM映射器的运行速度快于这种复杂性无法达到最大SE,而一个运行速度较慢会使任意大的$ n $的映射吞吐量无效。我们通过实现一个支持所有DSP步骤来映射/demap n-Subcarrier复杂频率域ofdm-im符号来证明我们的理论发现。我们的实施支持不同的索引选择器算法,并且是第一个实现SE最大化的算法,同时保留了经典OFDM映射器的相同时间和空间渐进复杂性。

In this work, we present an optimal mapper for OFDM with index modulation (OFDM-IM). By optimal we mean the mapper achieves the lowest possible asymptotic computational complexity (CC) when the spectral efficiency (SE) gain over OFDM maximizes. We propose the spectro-computational (SC) analysis to capture the trade-off between CC and SE and to demonstrate that an $N$-subcarrier OFDM-IM mapper must run in exact $Θ(N)$ time complexity. We show that an OFDM-IM mapper running faster than such complexity cannot reach the maximal SE whereas one running slower nullifies the mapping throughput for arbitrarily large $N$. We demonstrate our theoretical findings by implementing an open-source library that supports all DSP steps to map/demap an N-subcarrier complex frequency-domain OFDM-IM symbol. Our implementation supports different index selector algorithms and is the first to enable the SE maximization while preserving the same time and space asymptotic complexities of the classic OFDM mapper.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源