A low complex turbo decoding algorithm with early iteration termination

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.

[1]  M. Moher.  Decoding via cross-entropy minimization , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[2]  Pallavi D. Hegu,et al.  A Survey On Designing Of Turbo Encoder & Turbo Decoder , 2015 .

[3]  Fabien Clermidy,et al.  A low complexity stopping criterion for reducing power consumption in turbo decoders , 2011, 2011 Design, Automation & Test in Europe.

[4]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[5]  Desmond P. Taylor,et al.  Near Optimum Error Correcting Coding and Decoding: TurboCodes , 2007 .

[6]  Jürgen Götze,et al.  Hard decision based low SNR early termination for LTE Turbo decoding , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[7]  Jagdish D. Kene,et al.  Soft Output Decoding Algorithm for Turbo Codes Implementation in Mobile Wi-Max Environment , 2012 .

[8]  Branimir R. Vojcic,et al.  Turbo Decoding Complexity Reduction by Symbol Selection and Partial Iterations , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[9]  E. Buracchini,et al.  The software radio concept , 2000, IEEE Commun. Mag..

[10]  Dan Alexandru Stoichescu,et al.  A new stopping criterion for turbo decoders based on the minimization of error probability , 2014, 2014 22nd Telecommunications Forum Telfor (TELFOR).

[11]  Charles F. Hockett,et al.  A mathematical theory of communication , 1948, MOCO.

[12]  Ranjan Bose,et al.  Information theory, coding and cryptography , 2003 .

[13]  Celso de Almeida,et al.  Complexity Reduction of Convolutional and Turbo Decoding Based on Reliability Thresholds , 2015, Wirel. Pers. Commun..

[14]  Yufei W. Blankenship,et al.  A simple stopping criterion for turbo decoding , 2000, IEEE Communications Letters.

[15]  Behnam Shahrrava,et al.  A novel simplified Log-MAP algorithm suitable for hardware implementation of turbo decoding , 2011, 2011 24th Canadian Conference on Electrical and Computer Engineering(CCECE).

[16]  I. J. Fair,et al.  New error detection techniques and stopping criteria for turbo decoding , 2000, 2000 Canadian Conference on Electrical and Computer Engineering. Conference Proceedings. Navigating to a New Era (Cat. No.00TH8492).

[17]  B Yamuna,et al.  An Efficient Early Iteration Termination for Turbo Decoder , 2016 .

[18]  Brendan J. Frey,et al.  Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding , 1998, IEEE J. Sel. Areas Commun..

[19]  Esaw T Abraham.  Low Complexity Stopping Criteria for UMTS Turbo-Decoders; , 2017 .

[20]  Shantanu K. Dixit,et al.  Low complexity modified constant Log-Map algorithm for radix-4 turbo decoder , 2015, 2015 International Conference on Pervasive Computing (ICPC).

[21]  B. Yamuna,et al.  Implementation of turbo code with early iteration termination in GNU radio , 2017 .