.png){kind=icon}
.png){kind=icon}
Return
Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
.png){kind=icon}
OA
AI
DOI：10.3390/s22166305.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a well-known generalized Reed-Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed-Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.
Keywords:
generalized Reed-Solomon (GRS)
coded cooperation
space-time block coded spatial modulation (STBC-SM)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.