{'fraction_non_alphanumeric': 0.029462738301559793, 'fraction_numerical': 0.0, 'mean_word_length': 5.5625, '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}}
Channel Optimized Vector Quantization: Iterative Design Algorithms

Joint source-channel coding (JSCC) has emerged to be a major field of research recently. Channel optimized vector quantization (COVQ) is a simple feasible JSCC scheme introduced for communication over practical channels. In this work, we propose an iterative design algorithm, referred to as the iterative maximum a posteriori (MAP) decoded (IMD) algorithm, to improve COVQ systems. Based on this algorithm, we design a COVQ based on symbol MAP harddecision demodulation that exploits the non-uniformity of the quantization indices probability distribution. The IMD design algorithm consists of a loop which starts by designing a COVQ, obtaining the index source distribution, updating the discrete memoryless channel (DMC) according to the achieved index distribution, and redesigning the COVQ. This loop stops when the point-to-point distortion is minimized. We consider memoryless Gaussian and Gauss-Markov sources transmitted over binary phase-shift keying modulated additive white Gaussian noise (AWGN) and Rayleigh fading channels. Our scheme, which is shown to have less encoding