{'fraction_non_alphanumeric': 0.027753686036426712, 'fraction_numerical': 0.004336513443191674, 'mean_word_length': 4.948453608247423, '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}}
Criterions of designing codebooks and a relay selection scheme for a relay network

For a relay network system with amplify and forward protocol, in this paper, analysis of performance is conducted, and an upper bound of pairwise error probability is obtained. Moreover, a scheme of relay selection is analyzed under assumptions that (i) the relays amplify and forward received signals without any signal processing; (ii) the receiver only knows channel state information from the relays to the receiver; and (iii) the transmitter and the relays do not have any channel state information. Based on the upper bound, a criterion of designing codebook is proposed. Surprisingly, this bound shows that increasing the number of relays can hardly improve performance. Furthermore, the error probability is decreasing with a speed of P−1, no matter how large the relay number is, where P is the total energy. Also, for the relay selection, the optimal selecting way is to select only one relay with the largest channel gain, which is very different from existing schemes. These results are all confirmed by simulations. Copyright © 2015 John Wiley & Sons, Ltd.