Skip to main content
SpringerLink
Log in

Complexity Reduction of Convolutional and Turbo Decoding Based on Reliability Thresholds

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper we propose a method that aims at reducing the complexity of convolutional and turbo decoding. Some calculations performed in decoding processing can be eliminated based on reliability thresholds. For convolutional and turbo decoding, the complexity is proportional to the number of branches in the trellis. For convolutional decoding, based on the Viterbi algorithm, we define reliability thresholds for the received samples of the signal and show that is possible to eliminate some branches in the trellis and consequently to reduce the complexity. For turbo decoding based on MAP algorithm, we set a threshold to classify each information bit log likelihood ratio (LLR). When the LLR is reliable, we take a decision on information bits and eliminate some branches in the trellis. Furthermore, we also define a criterion for stopping decoding wich further reduces the complexity. In this paper we show that it is possible to reduce decoding complexity of convolutional codes almost 80 % without performance degradation when compared to Viterbi algorithm over Rayleigh fading channels. In turbo decoding, we show that complexity varies with \({E_{b}}/{N_{0}}\) and it is reduced when more iterations are computed, tending to zero for higher iterations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. van Berkel, C. H. (2009). Multi-core for mobile phones. In Proceedings of the design, automations. Test Europe conference exhibition (pp. 1260–1265).

  2. Kienle, F., Wehn, N., & Meyr, H. (2011). On complexity, energy- and implementation-efficiency of channel decoders. IEEE Transactions on Communications, 99, 3301–3310.

    Article  Google Scholar 

  3. Haccoun, D., Caron, M., & Nabli, M. (1999). Complexity reduction of the Viterbi algorithm using doubly complementary convolutional codes. In IEEE conference proceedings (pp. 408–411).

  4. Dany, J.-C., et al. (2004). Low complexity algorithm for the decoding of convolutional codes of any rate. IEEE Conference Proceedings, 1, 547–551.

    Google Scholar 

  5. Wu, J., Vojcic, B. R., & Wang, Z. (2007). Turbo decoding complexity reduction by symbol selection and partial iterations. In IEEE GLOBECOM proceedings.

  6. Frey, B. J. & Kschischang, F. R. (1998). Early detection and trellis splicing: Reduced-complexity iterative decoding. IEEE Journal on Selected Areas in Communications, 16, 153–159.

  7. Jie, J., & Tsui, C. (2006). Low complexity SST Viterbi decoder. In IEEE vehicular technology conference (pp. 1–2).

  8. Shin, Sooyoung Kim, & Lee, Soo In. (1999). Efficient complexity reduction technique in trellis decoding algorithm. IEEE Electronis Letters, 35, 16–17.

    Article  Google Scholar 

  9. Ma, Z., Mow, W. H., & Fan, P. (2005). On the complexity reduction of turbo decoding for wideband CDMA. IEEE Transactions on Wireless Communications, 4, 353–356.

    Article  Google Scholar 

  10. Shibutani, A., Suda, H., & Adachi, F. (1999). Complexity reduction of turbo decoding. IEEE Vehicular Technology Conference, 3, 1570–1574.

    Google Scholar 

  11. Minowa, T., & Imai, H. (2000). Reduced-complexity iterative decoding of high-rate turbo codes. IEEE Globecom, 1, 193–197.

    Google Scholar 

  12. Viterbi, A. J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT–13, 260–269.

    Article  Google Scholar 

  13. Bahl, L. R., Cocke, J., Jelinek, F., & Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory, 20, 284–287.

  14. Frison, C. I. (2009). Sub-optimal multiuser detector based on reliable samples. M. Eng. Thesis, Faculty of Electrical and Computer Engineering - Unicamp, Campinas, Brazil (in Portuguese).

  15. Woodard, J. P., & Hanzo, L. (2000). Comparative study of turbo decoding techniques: An overview. IEEE Transactions on Vehicular Technology, 49, 2208–2233.

    Article  Google Scholar 

  16. Berrou, C., Glavieux, A. & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of the IEEE international conference communications (pp. 1064–1070).

Download references

Author information

Authors and Affiliations

  1. Unicamp, Av. Albert Einstein, 400, Campinas, SP, 13083-970, Brazil

    Luís Otávio Mataveli & Celso de Almeida

Authors
  1. Luís Otávio Mataveli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso de Almeida
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luís Otávio Mataveli.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mataveli, L.O., de Almeida, C. Complexity Reduction of Convolutional and Turbo Decoding Based on Reliability Thresholds. Wireless Pers Commun 82, 1279–1290 (2015). https://doi.org/10.1007/s11277-015-2282-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2282-9

Keywords

Search

Navigation