{'fraction_non_alphanumeric': 0.017718715393133997, 'fraction_numerical': 0.0022148394241417496, 'mean_word_length': 5.457142857142857, '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 Successive Decoding Strategy for Channels With Memory

This paper presents a new technique for communication over channels with memory where the channel state is unknown at the transmitter and receiver. A deep interleaver combined with successive decoding decomposes a channel with memory into an array of parallel memoryless channels on which a conventional coding system can operate individually. The problems of joint channel estimation and decoding thus are separated without loss of capacity. This technique achieves channel capacity and so may be used to evaluate the capacities of different channels. A general information-theoretic framework is developed and applied to intersymbol interference (ISI), finite-state Markov, and Rayleigh-fading channels. A full system implementation, which performs within 1.1 dB of the channel capacity upper bound, is presented for the Rayleigh-fading channel