Journal
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 19, Issue 12, Pages 8232-8245Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2020.3020692
Keywords
Index modulation; graph theory; bit-to-index-combination; gray coding
Funding
- National Key Research and Development Program of China [2019YFB180003400]
- National Science Foundation of China [61831013, 61631015]
- Innovation Fund of WNLO
Ask authors/readers for more resources
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. Low-complexity 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available