Details
Name
João Paulo VilelaCluster
Computer ScienceRole
ResearcherSince
01st March 2020
Nationality
PortugalCentre
Advanced Computing SystemsContacts
+351220402963
joao.p.vilela@inesctec.pt
2020
Authors
Queiroz, S; Vilela, JP; Monteiro, E;
Publication
IEEE ACCESS
Abstract
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 -subcarrier OFDM-IM mapper must run in exact 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 . We demonstrate our theoretical findings by implementing an open-source library that supports all DSP steps to map/demap an-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.
2020
Authors
Mendes, R; Cunha, M; Vilela, JP;
Publication
Proceedings on Privacy Enhancing Technologies
Abstract
2020
Authors
Queiroz, S; Silva, W; Vilela, JP; Monteiro, E;
Publication
IEEE WIRELESS COMMUNICATIONS LETTERS
Abstract
In this letter, we demonstrate a mapper that enables all waveforms of OFDM with Index Modulation (OFDM-IM) while preserving polynomial time and space computational complexities. Enabling all OFDM-IM waveforms maximizes the spectral efficiency (SE) gain over the classic OFDM but, as far as we know, the computational overhead of the resulting mapper remains conjectured as prohibitive across the OFDM-IM literature. We show that the largest number of binomial coefficient calculations performed by the original OFDM-IM mapper is polynomial on the number of subcarriers, even under the setup that maximizes the SE gain over OFDM. Also, such coefficients match the entries of the so-called Pascal's triangle (PT). Thus, by assisting the OFDM-IM mapper with a PT table, we show that the maximum SE gain over OFDM can be achieved under polynomial (rather than exponential) time and space complexities.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.