{'fraction_non_alphanumeric': 0.018072289156626505, 'fraction_numerical': 0.0, 'mean_word_length': 5.273584905660377, '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}}
Permutation Optimization in QRD Based Multi-Relay Systems

QR decomposition (QRD) based relay protocols can achieve both the distributed array gain and the intra-node array gain in multi-relay systems. Because the QRD is not unique if column permutation is utilized, the traditional QRD based relay protocol can be further improved. Row permutation of the forward channel and column permutation of the backward channel are proposed in this paper. Exhaustive and iterative search algorithms are presented to solve the permutation optimization problem. The iterative search algorithm with modified QRD is a good trade-off between capacity performance and complexity.