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.
Index Terms— Decoding complexity, bit error rate, hybrid Turbo codes, iterative decoders.
Archana Bhise is with the Department of Electronics and Telecommunication Engineering, M P School of Technology, Management and Engineering, Mumbai (e-mail: archana.bhise@ yahoo.co.in).
Prakash Vyavahare is with the Department of SGSITS, Indore, India (e-mail: prakash.vyavahare@gmail.com).
[PDF]
Cite: Archana Bhise and Prakash Vyavahare, " Complexity Analysis of Iterative Decoders in Mobile Communication Systems," International Journal of Information and Electronics Engineering vol. 4, no. 2, pp. 121-128, 2014.
