Affiliation:
1. Communication University of China
Abstract
A simplified decoding algorithm for turbo trellis-coded modulation (T-TCM) is proposed, which is easy to implement in hardware. The algorithm exploits a new piece-wise function to replace the logarithmic term of the Jacobian logarithm based on the MacLaurin Series. Simulation results show that the proposed algorithm can archive log-MAP-similar decoding performance with a much lower computational complexity. It can reduce about 40% of calculation in contrast to the improved MAX-Log-MAP.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. S. Robertson, P., and Worz, T. Bandwidth-efficient turbo trellis-coded modulation using punctured component codes, IEEE J. Sel. Areas Commun., 1998, 16, (2), p.206–218.
2. Ungerboeck, G. Channel coding with multilevel/phase signalling, IEEE Trans. Inf. Theory, 1982, 25, (1), p.55–67.
3. Sybis, Michal, Branch canceling technique for turbo TCM decoding, IEEE European Wireless Conference, 2012, pp.1-5.
4. Ji-Hoon Kim, In-CheolPark, ExpressBriefs, Bit-Level extrinsic information exchange method for double-binary turbo codes, IEEE Transactions, 56, (1), 2009, p.81–85.
5. Sybis, S., Log-MAP equivalent Chebyshev inequalitybased algorithm for turbo TCM decoding, Electron. Lett., 2011, 47, (18), pp.1049-1050.