{'fraction_non_alphanumeric': 0.01810436634717785, 'fraction_numerical': 0.0, 'mean_word_length': 5.0256410256410255, '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}}
Reduced Initial Searching Radius for Sphere Decoder

Sphere decoding (SD) has been proposed as an efficient algorithm in digital communications. Its complexity is polynomial for both an infinite and finite lattice which makes the real-time implementation of a maximum-likelihood (ML) decoder feasible. The choice of an initial radius for the SD has a great impact on the trade-off between the performance and complexity. In this paper, we present a new initial radius selection scheme for the SD based on the constellation modulation type and the target bit error rate (BER). The proposed scheme accurately define an initial radius of the SD, which reduces the radius redundancy and ensures that at least one lattice point is inside a sphere. Complexity analysis shows that the proposed scheme has much lower computational complexity than that of the conventional one with zero decoding failure rates meanwhile ensures no performance loss.