Low-complexity iterative detection based on limited bi-directional search

Journal article, 2006

A new reduced-complexity iterative decoding algorithm is introduced. The algorithm approximates a posteriori probabilities by using a set of highly sequences, found in a limited bi-directional search. To assess the performance, numerical results for serially concatenated convolutional codes, transmitted over an intersymbol interference channel, disturbed by additive white Gaussian noise are presented. A substantial reduction in complexity is achieved with a performance degradation around 0.25 dB, as demonstrated by bit error rate performance and convergence behaviour.