Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis
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 c...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9057642/ |
id |
doaj-0be3e7faa94d4eb6ae0c941f0db871da |
---|---|
record_format |
Article |
spelling |
doaj-0be3e7faa94d4eb6ae0c941f0db871da2021-03-30T01:46:46ZengIEEEIEEE Access2169-35362020-01-018683656837810.1109/ACCESS.2020.29861319057642Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational AnalysisSaulo Queiroz0https://orcid.org/0000-0002-0347-1778Joao P. Vilela1Edmundo Monteiro2Academic Department of Informatics, Federal University of Techonology (UTFPR), Ponta Grossa, BrazilDepartment of Computer Science, University of Porto, Porto, PortugalCISUC and Department of Informatics Engineering, University of Coimbra, Coimbra, PortugalIn 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.https://ieeexplore.ieee.org/document/9057642/Computational complexityindex modulationOFDMsignal mappingsoftware-defined radiospectral efficiency |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Saulo Queiroz Joao P. Vilela Edmundo Monteiro |
spellingShingle |
Saulo Queiroz Joao P. Vilela Edmundo Monteiro Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis IEEE Access Computational complexity index modulation OFDM signal mapping software-defined radio spectral efficiency |
author_facet |
Saulo Queiroz Joao P. Vilela Edmundo Monteiro |
author_sort |
Saulo Queiroz |
title |
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis |
title_short |
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis |
title_full |
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis |
title_fullStr |
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis |
title_full_unstemmed |
Optimal Mapper for OFDM With Index Modulation: A Spectro-Computational Analysis |
title_sort |
optimal mapper for ofdm with index modulation: a spectro-computational analysis |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
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. |
topic |
Computational complexity index modulation OFDM signal mapping software-defined radio spectral efficiency |
url |
https://ieeexplore.ieee.org/document/9057642/ |
work_keys_str_mv |
AT sauloqueiroz optimalmapperforofdmwithindexmodulationaspectrocomputationalanalysis AT joaopvilela optimalmapperforofdmwithindexmodulationaspectrocomputationalanalysis AT edmundomonteiro optimalmapperforofdmwithindexmodulationaspectrocomputationalanalysis |
_version_ |
1724186401628487680 |