Complexity Analysis of Iterative Decoders in Mobile Communication Systems

Authors

  • Archana Bhise and Prakash Vyavahare Author

Keywords:

Decoding complexity, bit error rate, hybrid Turbo codes, iterative decoders.

Abstract

Turbo Convolutional Codes (TCC) and Low 
Density Parity Check (LDPC) codes, based on iterative 
decoders, are widely used to reduce bit error rate in mobile 
communication systems. The key implementation issue for these 
codes is the overall higher decoding complexity. Modified 
Turbo codes are low complexity turbo-like codes with error 
performance which is equivalent to that of Turbo codes. In this 
paper, decoding complexity of LDPC, TCC and various low 
complexity modified Turbo codes, such as Low Complexity 
Hybrid Turbo Codes (LCHTC) and Improved Low Complexity 
Hybrid Turbo Codes (ILCHTC), are presented. Further, 
modified Turbo codes are compared with TCC on the basis of 
error performance and decoding complexity. It is shown that 
the error performance of modified Turbo codes is almost 
equivalent to that of TCC. Moreover, modified Turbo codes 
require significantly lower decoding complexity than that of 
TCC and LDPC codes.

Downloads

Download data is not yet available.

Downloads

Published

17.03.2014

How to Cite

Complexity Analysis of Iterative Decoders in Mobile Communication Systems. (2014). International Journal of Information and Electronics Engineering, 4(2), 121-128. https://ijiee.org/index.php/ijiee/article/view/587