Hybrid Bit-to-Symbol Mapping for Spatial Modulation

“…The performance gains achieved through choosing the modulation sets that minimize the receive Euclidean distance y ,y in (16) or those that minimize the BER in (20) come at a high computational cost. Since both search problems depend on the channel realization H, computations should track the change in the channel and the transmitter should have perfect knowledge of the channel state information.…”

Section: Reducing the Unconditional Errormentioning

confidence: 99%

“…In [19], a bit-to-symbol mapping is proposed assuming channel knowledge at the transmitter, where the performance of the proposed scheme outperforms an earlier scheme proposed in [20]. In [21], the optimization of the number of transmit antennas and the size of the modulation set was conducted with and without the channel knowledge at the transmitter.…”

Section: Introductionmentioning

confidence: 99%

Modulation Set Optimization for the Improved Complex Quadrature SM

Iqbal

Mohaisen

Kwak

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

At each channel use, the complex quadrature spatial modulation (CQSM) transmits two signal symbols drawn from two disjoint modulation sets. The indices of the antennas from which symbols are transmitted also carry information. In the improved CQSM (ICQSM), an additional antenna is used to transmit the second signal symbol only when the indices of the antennas to be used for transmission are equal. Conventionally, the second modulation set is a rotated version of the first, where the rotation angle is optimized such that the average unconditional error probability (AUP) is reduced. In this paper, we propose a low-complexity method to design the PSK modulation sets based on reducing the AUP. After introducing min-BER and max-min , two exhaustive search methods, we analytically show that the AUP depends on Euclidean distance between transmitted vectors, which in turn depends on the power of signal symbols, the Euclidean distance between the symbols of each modulation set, and the Euclidean distance between the symbols of the two sets. The optimal rotation angle is analytically derived for any modulation order and the radii of the modulation sets are optimized such that AUP is reduced for a wide range of system configurations. The simulation results show that more than 3 dB of power gain is achieved in the case of 16PSK, where higher gains are achieved for higher modulation orders. These gains are achieved at no computational cost because the optimization does not depend on the channel realization.

show abstract

“…Recently, some novel bit-to-symbol mapping principles were developed for the SM system (N u = 1) in [41]- [43]. However, they are not suitable for GIM systems (N u > 1).…”

Section: Introductionmentioning

confidence: 99%

Graph Theory Assisted Bit-to-Index-Combination Gray Coding for Generalized Index Modulation

Xiao

Chen

Hemadeh

et al. 2020

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Generalized index modulation (GIM) which implicitly conveys information by the activated indices is a promising technique for next-generation wireless networks. Due to the prohibitive challenge of bit-to-index combination (IC) mapping optimization, conventional GIM system obtains the bit-to-IC mapping table randomly, which may suffer from some performance loss. To circumvent this issue, we propose a low-complexity graph theory assisted bit-to-IC gray coding for GIM systems by minimizing the average hamming distance (HD) between any two ICs having one different value. Specifically, we decompose and transform the optimization problem into two subproblems using the graph theory, i.e., 1) Select an IC set whose corresponding graph has the minimum degree; 2) Design a bit-to-IC mapping principle to minimize the weight of the selected graph. Lowcomplexity algorithms are developed to solve the subproblems with a significant reduced complexity. Both simulation and theoretical results are shown that the GIM systems with our proposed mapping table are capable of providing significant performance gains over the conventional counterparts without the need for any additional feedback-link and without extra computational complexity. It is also shown that the proposed bit-to-IC mapping table is straightforward for any GIM systems over generalized fading channels.

show abstract

Hybrid Bit-to-Symbol Mapping for Spatial Modulation

Cited by 19 publications

References 22 publications

Single-RF and Twin-RF Spatial Modulation for an Arbitrary Number of Transmit Antennas

Single-RF and Twin-RF Spatial Modulation for an Arbitrary Number of Transmit Antennas

Modulation Set Optimization for the Improved Complex Quadrature SM

Graph Theory Assisted Bit-to-Index-Combination Gray Coding for Generalized Index Modulation

Contact Info

Product

Resources

About