2020
DOI: 10.1109/lwc.2020.2965533
|View full text |Cite
|
Sign up to set email alerts
|

Maximal Spectral Efficiency of OFDM With Index Modulation Under Polynomial Space Complexity

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. For an N -subcarrier symbol, we show that OFDM-IM needs a Θ(2 N / √ N )entry LUT to ensure that any … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(17 citation statements)
references
References 11 publications
0
17
0
Order By: Relevance
“…From this, the largest computational complexity T (N ) must satisfy lim N →∞ m(N )/T (N ) > 0, i.e., the SC throughput must not nullify as the system is assigned an arbitrarily large amount of spectrum. Based on that, in [43] we present the first mapper that supports all 2 log 2 ( N N/2 ) waveforms of OFDM-IM in the same asymptotic time of the classic OFDM mapper. However, that proposed mapper still requires an extra space of Θ(N 2 ) look-up table entries in comparison to the classic OFDM mapper.…”
Section: ) Novel Sp-free Ofdm-im Mappersmentioning
confidence: 97%
“…From this, the largest computational complexity T (N ) must satisfy lim N →∞ m(N )/T (N ) > 0, i.e., the SC throughput must not nullify as the system is assigned an arbitrarily large amount of spectrum. Based on that, in [43] we present the first mapper that supports all 2 log 2 ( N N/2 ) waveforms of OFDM-IM in the same asymptotic time of the classic OFDM mapper. However, that proposed mapper still requires an extra space of Θ(N 2 ) look-up table entries in comparison to the classic OFDM mapper.…”
Section: ) Novel Sp-free Ofdm-im Mappersmentioning
confidence: 97%
“…In [20], the authors suggest that θ can be attained using queries of the binomial coefficient θκ−i+1 κ−i+1 as in (7) from PT of dimensions Ω × κ. As PT consists of the binomial coefficients θκ−i+1 κ−i+1 corresponding to all Ω and κ, henceforth, there is no need to evaluate them from scratch; which considerably reduces the complexity of the index mapping and de-mapping.…”
Section: B Index Mapping and De-mappingmentioning
confidence: 99%
“…As PT consists of the binomial coefficients θκ−i+1 κ−i+1 corresponding to all Ω and κ, henceforth, there is no need to evaluate them from scratch; which considerably reduces the complexity of the index mapping and de-mapping. The complexity of PT based index mapping and de-mapping algorithms is O(Ω) [20] and requires a LUT of dimensions Ω × κ to be buffered. However, the limiting condition for linear mapping and de-mapping, i.e., κ ≤ Ω/2 is not an issue for PT based approaches which makes them more effective.…”
Section: B Index Mapping and De-mappingmentioning
confidence: 99%
“…Particularly, the unique frequency domain embedded sparsity feature of OFDM-SIM signals is considered, which in turns allow hard and low-level clipping implementation without overhead or BER degradation. Accordingly, higher levels of PAPR reduction can be reached with the proposed scheme than clipping noise estimation-based techniques such as in [26,27]. Besides sparsity feature exploitation, prior-knowledge of the amplitudes of the activated/inactivated subcarriers are exploited by the proposed scheme to perform a low complex CS-based detection at RX.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, the double indexing on real/imaginary spaces is employed. The bit combinations are assumed to be sorted in a predefined order such as lexicographic order avoiding the exhaustive listing for all combinations such introduced in [27]. For each possible combination, the corresponding index can be simply expressed as follows [15,16]:…”
Section: A Ofdm-sim System Modelmentioning
confidence: 99%