International Journal of Advanced Computing and Communication Systems

Study of Reduced Complexity Syndrome Based TTCM Decoder

Hrudia V R, Department of M.E Applied Electronics and ECE, Maharaja Institute of Technology, Coimbatore–32, Tamil Nadu, India.

Sangeetha P, Department of ECE, Maharaja Institute of Technology, Coimbatore–32, Tamil Nadu, India.

International Journal of Advanced Computing and Communication Systems

ISSN (Online) : 2347 - 9299

ISSN (Print) : 2347 - 9280

Received On :

Revised On :

Accepted On :

Published On :

Volume 02, Issue 02

Page No : 001-009

Abstract

Turbo codes were a major milestone in the forward transmission without changing the data rate. The use of TCM also improves system without increasing error correction codes which can even achieve an excellent bit error rates at low SNR. The original proposal was for the transmitting power and required channel bandwidth. Quadrature Amplitude modulation (QAM) and Quaternary BPSK scheme but were soon successful with multilevel coded as well. The “Turbo Trellis Coded Modulation” (TTCM) employing two TCM codes as parallel concatenation of two recursive TCM encoder, and adapted puncturing mechanism to avoid the obvious disadvantage of the rate loss The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we Phase Shift Keying (QPSK) are used in TCM to increase data transmission rate. Since channel bandwidth is a function of the signal-to-noise ratio (SNR), larger signal power would be necessary to maintain the same signal separation and the same error probability if more signals are required to be transmitted without enlarging channel bandwidth. Trellis coding introduces dependency between every successive transmitting data symbol. The optimum 2-dimensional modulation utilizes the dependency conceive the syndrome-based block decoding of TTCM, which is capable of reducing the decoding complexity by disabling the decoder, when syndrome becomes zero. Quantitatively, we demonstrate that a decoding complexity reduction of at least 17% is attained at high SNRs, with at least 20% and 45% reduction in the 5th and 6th iterations, respectively.

Keywords

Block syndrome decoding, TTCM, iterative decoding, BSD BICM.

Cite this Article

Hrudia V R and Sangeetha P, “Study of Reduced Complexity Syndrome Based TTCM Decoder,” International Journal of Advanced Computing and Communication Systems, pp. 001-009, July, 2015.

Copyright

© 2015 Hrudia V R and Sangeetha P. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.