{'fraction_non_alphanumeric': 0.02367797947908445, 'fraction_numerical': 0.0007892659826361484, 'mean_word_length': 5.436548223350254, '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}}
An Improved Software List Sphere Polar Decoder With Synchronous Determination

Being the first codes achieving the capacity of symmetric binary-input discrete memoryless channels, polar codes have been favorable and standardized for enhanced mobile broadband (eMBB) control channels. In future mobile communications, the entire system is required to be flexible and adaptive to varying scenarios. Therefore, efficient software implementation of polar decoder is expected. Existing software successive cancellation list polar decoder can achieve good performance but with a good memory consumption. For short control channel codes, a more memory-efficient alternative is sphere decoder, but its latency gives rise to another issue. Equipped with a breadth-first search to keep a fixed complexity, list sphere decoder (LSD) is also considered. To improve the performance of LSD, a software LSD with synchronous determination is proposed in this paper. We precalculate the synchro sets to improve the decoding, which leads to a performance gain. Meanwhile, the decoding process is simplified due to the precalculation, which attains even lower complexity. Implemented with C++, the proposed decoder can achieve up to 2 dB performance gain compared with the existing LSD.