<p>This manuscript proposes the integration of Quasi-Generalized Reed-Solomon (Q-GRS) codes into coded cooperative communication systems. At the source and relay nodes, two Q-GRS codes are employed, and both establish a joint code at the destination. A single-relay channel model with an optimized relay node is considered to improve the overall bit error rate (BER) performance of the channel. For the relay code optimisation, a global search algorithm is explored, and a simpler local search algorithm is proposed for practical scenarios. At the destination, a new joint decoding algorithm is proposed, referred to as the Multistep Simplified maximum likelihood decoding (MSS-MLD) algorithm. This algorithm is shown to outperform both the smart and naive joint decoding algorithms. Monte Carlo simulations with QAM modulations are performed to evaluate the BER performance over a Rayleigh fading channel. The Q-GRS coded cooperative (Q-GRSCC) scheme exhibits superior performance compared to the non-cooperative scheme and the Generalized Reed-Solomon (GRS) coded cooperative (GRSCC) scheme of similar code rates under similar channel conditions.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Design and performance of distributed Q-GRS coded cooperative communication with optimized relay selection

  • Lawrence Muthama Paul,
  • Fengfan Yang,
  • Viola Amondi Ochieng

摘要

This manuscript proposes the integration of Quasi-Generalized Reed-Solomon (Q-GRS) codes into coded cooperative communication systems. At the source and relay nodes, two Q-GRS codes are employed, and both establish a joint code at the destination. A single-relay channel model with an optimized relay node is considered to improve the overall bit error rate (BER) performance of the channel. For the relay code optimisation, a global search algorithm is explored, and a simpler local search algorithm is proposed for practical scenarios. At the destination, a new joint decoding algorithm is proposed, referred to as the Multistep Simplified maximum likelihood decoding (MSS-MLD) algorithm. This algorithm is shown to outperform both the smart and naive joint decoding algorithms. Monte Carlo simulations with QAM modulations are performed to evaluate the BER performance over a Rayleigh fading channel. The Q-GRS coded cooperative (Q-GRSCC) scheme exhibits superior performance compared to the non-cooperative scheme and the Generalized Reed-Solomon (GRS) coded cooperative (GRSCC) scheme of similar code rates under similar channel conditions.