{'fraction_non_alphanumeric': 0.0266798418972332, 'fraction_numerical': 0.0, 'mean_word_length': 5.065868263473054, '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 Simple and Effective Testing Method for the Implementation of Turbo Decoders

It is well-known that Turbo codes are very useful in digital communications. However, due to the existence of interleaver/deinterleaver, there is no effective way available to test the correctness of the 'turbo' algorithms in practical use such as FPGA/DSP implementation, especially in very low bit error rate. In this paper, based on the extractable theoretical bounds for interleaver by-passed systems, a simple but effective testing method is proposed by separating the turbo coder into interleaver/ deinterleaver part and soft-in soft-out (SISO)-iterative decoding part. Our analysis and simulation results for turbo code shows that the proposed method brings no extra cost in implementation and is proved to be practical and effective. In principle, the proposed method can be generalized to almost all turbo or turbo-like systems, in which the theoretical bounds can be extracted in the absence of interleaver/de-interleaver.