Log-MAP equivalent chebyshev inequality based algorithm for turbo TCM decoding

A low-complexity decoding algorithm for turbo trellis-coded modulation (TTCM) is proposed. The algorithm is a simple modification of the log-MAP decoding algorithm in which a correcting term is applied only once in calculation of the Jacobian logarithm for more than two arguments. BER performance has been evaluated by simulation for an additive white Gaussian noise channel and uncorrelated Rayleigh fading channel showing log-MAP-equivalent decoding performance. Additionally, complexity comparison is reported, showing significantly lower computational complexity in comparison to log-MAP.