Publication Type : Conference Proceedings
Publisher : 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
Source : 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI), p.325-331 (2017)
Url : https://ieeexplore.ieee.org/document/8125861
Keywords : complexity reduction, Complexity theory, Decoding, GNU radio, Iteration termination, Iterative decoding, Iterative methods, log-MAP turbo decoding algorithm, low complex turbo decoding algorithm, mathematical model, maximum likelihood decoding, measurement, minimum Log Likelihood Ratio, Reliability, Software, trellis branch elimination, Trellis codes, Turbo codes, Turbo decoder
Campus : Coimbatore
School : School of Engineering
Center : Electronics Communication and Instrumentation Forum (ECIF), Environmental Studies
Department : Electronics and Communication
Year : 2017
Abstract : In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early iteration termination based on the mean of extrinsic information has been combined with branch elimination. Here, complexity mitigation is done both in terms of branch elimination and iteration reduction with negligible performance degradation. By reducing the computational complexity, decoding delay, power consumptions and error accumulation imparted by additional iterations etc can be minimized.
Cite this Research Publication : C. R. Seethal and Dr. Yamuna B., “A Low Complex Turbo Decoding Algorithm with Early Iteration Termination”, 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI). pp. 325-331, 2017.