{'fraction_non_alphanumeric': 0.016129032258064516, 'fraction_numerical': 0.0, 'mean_word_length': 5.631067961165049, '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}}
Tradeoff of complexity and latency of iterative decoding for orthogonal convolutional codes

The complexities and latencies of iterative belief propagation (BP) and threshold decoding techniques for a new class of convolutional self-orthogonal codes are analysed using forward-only pipeline architectures. Computer simulation results show that over the additive white Gaussian noise channel at moderate signal-to-noise ratios, BP decoding yields one half the decoding delay when compared with threshold decoding at essentially the same error performances. However, the reduction in the decoding delay using BP is obtained at the cost of an increase of the implementation complexity.