Abstract:In this article, we propose an index modulation system suitable for optical communications, where the intensity of the light is modulated along the time, space and frequency dimensions, building a Frequency-Hopping Spatial Multi-Pulse Position Modulation (FH-SMPPM). We analyze its performance from the point of view of its efficiency in power and spectrum, and its implementation complexity and required receiver latency. We analyze its error probability in the case of the non-turbulent free-space optical (FSO) c… Show more
“…it is obvious that b 4 → I 5 . The mapping set can be updated by Step 5: Find the 5-th IC index for mapping using V 4 I = [1,2,5,7]. According to (31), we have 0, 2, 1, 0, 3, 0, 2], so that we can start at I 6 .…”
Section: Graph Theory Assisted Bit-to-ic Mappingmentioning
confidence: 99%
“…According to (31), we have 0, 2, 1, 0, 3, 0, 2], so that we can start at I 6 . Since [2,1,6,4,7,3,8] and M left = [5].…”
Section: Graph Theory Assisted Bit-to-ic Mappingmentioning
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.
“…it is obvious that b 4 → I 5 . The mapping set can be updated by Step 5: Find the 5-th IC index for mapping using V 4 I = [1,2,5,7]. According to (31), we have 0, 2, 1, 0, 3, 0, 2], so that we can start at I 6 .…”
Section: Graph Theory Assisted Bit-to-ic Mappingmentioning
confidence: 99%
“…According to (31), we have 0, 2, 1, 0, 3, 0, 2], so that we can start at I 6 . Since [2,1,6,4,7,3,8] and M left = [5].…”
Section: Graph Theory Assisted Bit-to-ic Mappingmentioning
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.