{'fraction_non_alphanumeric': 0.0254841997961264, 'fraction_numerical': 0.0030581039755351682, 'mean_word_length': 5.215189873417722, '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}}
Block Markov Superposition Transmission with Bit-Interleaved Coded Modulation

In this letter, we construct bit-interleaved coded modulation (BICM) using a simple basic code but transmitting multiple times in a way similar to the block Markov superposition transmission (BMST). The system admits a sliding-window decoding/demapping algorithm that can be employed to trade off the performance against the delay. Motivated but different from BMST with binary phase-shift keying (BPSK) signalling, a simple lower bound on performance is derived from an equivalent genie-aided system. Numerical results show that the performances of the BMST systems with BICM using a (2, 1, 2) convolutional basic code match well with the derived lower bounds in lower error rate regions over both additive white Gaussian noise (AWGN) channels and Rayleigh fading channels. We also analyze the effect of the encoding memory and the decoding delay on the performance as well as the decoding complexity.