{'fraction_non_alphanumeric': 0.02292768959435626, 'fraction_numerical': 0.0, 'mean_word_length': 5.920731707317073, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A novel opportunistic coded cooperation with selective source-to-destination parity transmission

Though opportunistic relaying coded cooperation is known as an efficient cooperation scheme for cooperative multi-relay networks, the existing works have the disadvantage of low resource utilization or high system complexity. In this paper, we focus on how to achieve a balance between resource utilization and system complexity by proposing an novel opportunistic relaying coded cooperation with selective source-to-destination parity transmission over Nakagami-m fading channels without additional cost. We derive closed-form expressions of the outage probability and explicit upper bounds on bit error probability using the statistical characteristic of the signal-to-noise ratios (SNRs) and confirm that the proposed scheme outperforms both opportunistic amplify-and-forward (AF) and opportunistic decode-and-forward (DF). Simulation results on the unbalanced generalized Nakagami-m fading conditions show that both system complexity and resource utilization are ameliorated with a better performance compared to the previous works.