{'fraction_non_alphanumeric': 0.02564102564102564, 'fraction_numerical': 0.0, 'mean_word_length': 5.005917159763314, '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 sub-optimal receiving scheme for SCCC with coded MSK over ISI channels

In this paper, we investigate serial concatenated convolutional codes (SCCC) with coded MSK over inter-symbol interference (ISI) channel. We propose a sub-optimal receiving scheme and study its performance using Monte Carlo simulation method. For SCCC with coded MSK, to achieve the best performance at the receiver, one needs to combine the inner encoder and the ISI channel to create a super trellis and use ML or symbol-by-symbol MAP to decode. However, the decoding complexity of this method increases exponentially with respect to the ISI length. In practice, it is desirable to sacrifice optimality for computational efficiency. To reduce the complexity of the decoder, we use an equalizer to compensate for the effects of ISI. Two equalization algorithms, zero-forcing and least mean square algorithms are studied. The simulation results show that the least mean square algorithm gives better performance than zero-forcing algorithm.