Abstract
ABSTRACT In this paper, the novel optimised generalised Reed-Solomon coded cooperative (OGRSCC) scheme is developed with a flexible selection of the code length and information dimension. In the OGRSCC scheme, two GRS codes with different dimensions are deployed at the source and relay, respectively, where the information symbols of the relay are dependent on those of the source. At the relay, different symbol selections may contribute to distinct joint codes at the destination. As a result, to achieve a maximum free distance (FD) and the optimised weight distribution of the final code, the global search method is first proposed to obtain the optimal selection pattern. However, as the code grows longer, its complexity rises dramatically. To make the selection more practical, the low-complexity sliding search method is then investigated to obtain the local optimal symbol selection pattern. Monte-Carlo simulated results indicate the OGRSCC scheme with two selection methods demonstrates almost identical performance. Furthermore, based on this special selection method and the unique algebraic structure of GRS code, the improved joint decoding algorithm is first proposed to boost the overall system performance. In addition, the theoretical upper bound is analysed, verifying the effectiveness of the proposed OGRSCC scheme. Numerical simulations reveal that the proposed OGRSCC scheme outperforms its corresponding non-cooperative scheme by a gain of over 3.2 dB and its existing comparable schemes by a margin of approximately more than 4 dB at high signal-to-noise ratio (SNR), respectively.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
