{'fraction_non_alphanumeric': 0.020013802622498276, 'fraction_numerical': 0.006211180124223602, 'mean_word_length': 5.415929203539823, '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}}
Design of Chaotic Interleaver Based on Duffing Map for Turbo Code

This article presents the performance analysis and comparison of turbo codes for several interleavers with short blockchains. According to the symmetry concept, turbo codes consist of two symmetric convolutional codes preceded by an interleaver. Some interleavers can be described by symmetric 3 × 3 generator matrices, whereas others are represented through symmetric matrices in which the nonzero terms in the matrix are monomials. Interest in short blockchains has grown over the years because of their use in emerging applications that require the transmission of data units in the order of hundred bits. In this research, interleavers used are random interleaver, semi-random interleaver, quadratic polynomial permutation (QPP) interleaver, and chaotic Lozi map interleaver. For each interleaver, the turbo code is assessed with at least two short data distances; then, the interleavers are compared against each other. The performance of turbo codes is assessed based on bit error rate, particularly with lengths between 64 and 512 bits. Additionally, an interleaver based on Duffing chaotic maps is proposed, whose deterministic nature provides an advantage, and the performance results are presented, achieving excellent BER values for 64 bits. With these results, the effect of the interleaver on turbo codes and particularly on short block length interleavers, is studied.