{'fraction_non_alphanumeric': 0.029798422436459245, 'fraction_numerical': 0.009640666082383873, 'mean_word_length': 5.106951871657754, '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 Segmented CRC-Aided PSS-SS-SCL Algorithm for Polar Codes

Path Splitting Selecting Strategy based on Search Set Successive Cancellation List (PSS-SS-SCL) Algorithm can effectively reduce the decoding complexity by reducing the number of unnecessary splits compared to CRC-aided successive cancellation list (CA-SCL) algorithm. However, this algorithm cannot check the validity of candidate path until the last step of decoding so that some error propagations may result in unnecessary decoding complexity. By dividing the information bits into two segments that each segment contains equal number bits and eliminating the wrong path failed in the CRC check, This paper proposes a segmented CRC-aided PSS-SS-SCL(SCA-PSS-SS-SCL) algorithm, which can reduce complexity by terminating invalid paths earlier and improve the performance by preserving and splitting correct paths better. Simulation result shows that the proposed algorithm can get a significantly improvement no matter in performance or in complexity, which can achieve 35.5% reduction of complexity at SNR of 0.5 dB and 0.12dB gain over the PSS-SS-SCL algorithm at BLER of 10−3.