{'fraction_non_alphanumeric': 0.025985663082437275, 'fraction_numerical': 0.0, 'mean_word_length': 5.382857142857143, '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}}
Efficient detection of space time block codes in time-selective channels via Adaptive Sphere Decoder

In this paper we consider symbol detection in Alamouti's space-time block coding (STBC) scheme by using Adaptive Sphere Decoder (ASD) which carries out adaptive radius search over time-selective fading channels. Once the channel is time-varying in nature, the channel co-efficients vary from one signaling interval to another, a conventional Maximum Likelihood (ML) detector carries out exhaustive search and thus becomes computationally expensive specially for higher modulation schemes in a multi-antenna system. Use of SD in time-selective fading channel results in optimal performance with moderate computational complexity. We evaluate the bit-error rate (BER) performance of ASD as compared to the exhaustive search ML detector as well as the generalized simplified ML (GSML) detector, proposed by Tran et al. over time-varying channels. Simulation results suggest that the use of ASD algorithm based on Fincke and Pohst method improves system performance but at expense of marginal computational complexity.