On optimal and near-optimal turbo decoding using generalized max* operator
IEEE Communications Letters
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory
Bandwidth-efficient turbo trellis-coded modulation using punctured component codes
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
A novel method for approximating the optimal max* operator used in Log- MAP decoding of turbo and turbo trellis-coded modulation (TTCM) codes is proposed being derived from a well-known inequality, which has not been published before. The max* operation is generalized, for the first time, and performed on n 2 rather than n = 2 arguments, as it is the conventional approach. Complexity comparisons reveal a significant reduction in the number of operations required per decoding step for the proposed approximation, as compared with the optimal Log-MAP algorithm. Performance evaluation results are presented for both turbo and TTCM codes, showing the near optimal performance of the novel approximation method in both the additive white Gaussian noise (AWGN) and uncorrelated, i.e. fully interleaved, Rayleigh fading channels.