{'fraction_non_alphanumeric': 0.022072936660268713, 'fraction_numerical': 0.0, 'mean_word_length': 5.478260869565218, '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}}
Low-complexity iterative equalisation and decoding for wireless optical communications [optical wireless communications]

A low-complexity scheme of iterative equalisation and decoding by combining a recursive systematic convolutional code and a pulse-position modulation is proposed here. A graph- based equalisation for intersymbol interference (ISI) known at both transmitter and receiver is considered. By representing the memory channel with ISI as the factor graph and applying sum-product (SP) algorithm to this graph, a posteriori probability (APP) of the desired symbol necessary to implement iterative equalisation and decoding is derived. A partial response precoding is used to reduce the span of ISI from a possible infinite number of two baud periods. This precoding scheme makes the factor graph of memory channel cycle-free, and SP algorithm for combating ISI converges to an optimum detection. Numerical results show that the proposed low-complexity strategy has almost the same performance as the optimum turbo equalisation.