This paper proposes, for the first time, a two-source asymmetric turbo-coded-cooperative spatial modulation (SM) scheme over the slow Rayleigh fading channel. As in any coded cooperative communication, the interleaver plays a vital role in mitigating the harsh effect of the wireless channel. Therefore, the code matched interleaver (CMI) is effectively used in the proposed design. The simulated results reveal that the bit error rate (BER) performance of the proposed coded cooperative communication system outperforms the asymmetric turbo-coded non-cooperative scheme under identical conditions. This prominent performance improvement has been made possible due to the joint asymmetric turbo decoding at the destination node. Furthermore, to check the effectiveness of the proposed scheme, we have also developed a two-source asymmetric turbo-coded cooperative scheme based on the vertical bell labs layered space-time (VBLAST), incorporating the CMI as the suitable benchmark. It is observed that the proposed scheme employing SM has a better BER performance than the VBLAST scheme under identical conditions.

No abstract

No abstract

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.

Article that has been accepted for inclusion in a future issue of a journal. Content is final as presented, with the exception of pagination.

No abstract

No abstract

The distributed Goppa coded spatial modulation (DGC‐SM) scheme is proposed in cooperative scenarios. In the proposed DGC‐SM scheme, the relay chooses the partial information from the source by using the idea of information selection, and then re‐encodes the selected information. At the destination, a distributed Goppa code is obtained corresponding to each selection. In order to get the best possible code, an optimal information selection algorithm is proposed at the relay. In the proposed optimal algorithm, all selections and source message sequences are considered, which results in high complexity. Thus, another optimized information selection algorithm with low complexity is proposed at the relay. To further enhance the capability to get the source information, two efficient joint decoding algorithms called smart decoding algorithm and improved smart decoding algorithm are proposed. Moreover, the bit error rate (BER) performance bound of the proposed DGC‐SM scheme is derived. Through the simulations, the effectiveness of the proposed two optimized information selection algorithms is confirmed. Also, it is observed that the simulation and analytical results closely match at high signal‐to‐noise ratio (SNR).