Reversed-Trellis Tail-Biting Convolutional Code (RT-TBCC) Decoder Architecture Design for LTE

Tail-biting convolutional codes (TBCC) have been extensively applied in communication systems. This method is implemented by replacing the fixed-tail with tail-biting data. This concept is needed to achieve an effective decoding computation. Unfortunately, it makes the decoding computation becomes more complex. Hence, several algorithms have been developed to overcome this issue in which most of them are implemented iteratively with uncertain number of iteration. In this paper, we propose a VLSI architecture to implement our proposed reversed-trellis TBCC (RT-TBCC) algorithm. This algorithm is designed by modifying direct-terminating maximum-likelihood (ML) decoding process to achieve better correction rate. The purpose is to offer an alternative solution for tail-biting convolutional code decoding process with less number of computation compared to the existing solution. The proposed architecture has been evaluated for LTE standard and it significantly reduces the computational time and resources compared to the existing direct-terminating ML decoder. For evaluations on functionality and Bit Error Rate (BER) analysis, several simulations, System-on-Chip (SoC) implementation and synthesis in FPGA are performed.

[1]  Mohammad Faiz Liew Abdullah,et al.  Peak-Throughput of LTE-Release 10 for Up/Down Link Physical Layer , 2012 .

[2]  Rachmad Vidya Wicaksana Putra,et al.  Hybrid Multi–System-on-Chip Architecture as a Rapid Development Approach for a High-Flexibility System , 2016 .

[3]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[4]  Mohammad Faiz Liew Abdullah,et al.  Uplink and Downlink of LTE-Release 10 in Cellular Communications , 2012 .

[5]  Rachmad Vidya Wicaksana Putra,et al.  Hybrid multi System-on-Chip architecture: A rapid development design for high-flexibility system , 2016, 2016 International Conference on Electronics, Information, and Communications (ICEIC).

[6]  B. Sundar Rajan,et al.  Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises , 2006, ArXiv.

[7]  Trio Adiono,et al.  Tail biting convolutional code decoder co-processor for high throughput System-on-Chip , 2015, 2015 International SoC Design Conference (ISOCC).

[8]  Rachmad Vidya Wicaksana Putra,et al.  VLSI Architecture for Configurable and Low-Complexity Design of Hard-Decision Viterbi Decoding Algorithm , 2016 .

[9]  R. V. Cox,et al.  An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes , 1994 .

[10]  Jing Xu,et al.  An Efficient CVA-Based Decoding Algorithm for Tail-Biting Codes , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[11]  Trio Adiono,et al.  A novel algorithm of tail biting convolutional code decoder for low cost hardware implementation , 2015, 2015 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS).

[12]  Shu Lin,et al.  Two decoding algorithms for tailbiting codes , 2003, IEEE Trans. Commun..

[13]  Jack K. Wolf,et al.  On Tail Biting Convolutional Codes , 1986, IEEE Trans. Commun..

[14]  Rachmad Vidya Wicaksana Putra,et al.  A configurable and low complexity hard-decision viterbi decoder in VLSI architecture , 2014, 2014 2nd International Conference on Information and Communication Technology (ICoICT).