Zhao Chunli, Yang Fengfan, Waweru Daniel Kariuki, Chen Chen, Xu Hongjun
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China.
School of Engineering, University of KwaZulu-Natal, King George V Avenue, Durban 4041, South Africa.
Sensors (Basel). 2022 Aug 22;22(16):6305. doi: 10.3390/s22166305.
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.
我们提出了一种用于无线网络的、结合了空时分组编码空间调制（STBC-SM）的著名广义里德-所罗门（GRS）码，它能够实现源节点和中继节点之间的编码协作。在所提出的分布式GRS编码STBC-SM（DGRSC-STBC-SM）方案中，源节点和中继节点使用不同的GRS码。在中继节点处，我们采用信息选择的概念从源节点选择消息符号以进行进一步编码。因此，由源节点和中继节点共同构建的码字在目的节点生成。为了在目的节点获得最佳码字集，我们在中继节点提出了一种最优算法以从源节点选择部分符号。为了降低计算复杂度，我们提出了一种更实用的低复杂度算法。蒙特卡罗仿真结果表明，使用低复杂度算法的所提方案能够实现接近最优的错误性能。此外，在相同条件下，我们所提方案比其相应的编码非协作方案以及现有的里德-所罗门编码协作SM（RSCC-SM）方案具有更好的错误性能。
