{'fraction_non_alphanumeric': 0.023779724655819776, 'fraction_numerical': 0.0, 'mean_word_length': 5.349206349206349, '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 lattice reduction assisted MIMO channel equalizer

Complexity and performance of many sub-optimal MIMO detectors can be improved by Lattice-reduction (LR) algorithms. Seysen's Algorithm (SA) based LR finds the basis with small number of iterations compared to other LR algorithms. Also, SA based lattice reduction enhance the efficiency of VLSI implementation and outperforms the existing Lenstra, Lenstra, and Lovász (LLL) algorithm for sub optimal linear detectors in terms of number of bits detected (BER) and computational complexity. This paper exploits the possibilities of architectural modification of SA based preprocessing of the channel matrix H. SA is applied on the gram matrix equivalent of H and its duel to achieve better orthogonal lattice basis with minimum number of iterations.