International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 3 | Year 2013 | Article Id. IJCTT-V4I3P131 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I3P131

A FEC Decoding in LTE and WiMAX Systems

G.Vamsikrishna, T.PavanKumar, V.Srikanth

Citation :

G.Vamsikrishna, T.PavanKumar, V.Srikanth, "A FEC Decoding in LTE and WiMAX Systems," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 3, pp. 358-361, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I3P131

Abstract

Recent wireless systems such as EDGE, WIMAX, LTE are using LDPC, tail biting and turbo convolution codes as the forward error correction codes (FEC) for the data and overhead channels. Therefore many decoding algorithms are introduced for decoding these codes. Using different decoding approaches lead to different hardware architectures. As, in new wireless systems these codes work side by side a single universal decoder which is efficient in handling decoding of all the codes.

Keywords

EDGE, WIMAX, LTE, FEC.

References

[1] C. Berrou, A. Glavieux, and P. Thitimajshima, ―Near Shannon limit error-correcting coding and decoding: Turbo codes, ‖ IEEE Intl. Conf. on Commun. vol. 2, Geneva, Switzerland, pp. 1064-1070, 1993. 
[2] R. M. Tanner, ―A recursive approach to low complexity codes, ‖ IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533547, 1981. 
[3] G. D. Forney, Jr., ―Codes on graphs: normal realizations, ‖ IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 520–548, 2001. 
[4] H. H. Ma and J. K. Wolf, ―On Tail Biting Convolutional Codes, ‖ IEEE Trans. On Commun., vol. 34, no. 2, pp. 104-111, 1986.
[5] N. Wiberg, “Codes and Decoding on General Graphs,” Linkoping Studies in Science and Technology, Dissertation No. 440, Linkoping University, -Linkoping, Sweden, 1996.
[6] R. J. McEliece, D. MacKay, and J.-Fu Cheng, “Turbo Decoding as an Instance of Pearl’s "Belief Propagation" Algorithm,” IEEE Trans. On Commun., vol. 16, no. 2, pp. 140152, 1998.
[7] G. Colavolpe, “Design and performance of turbo Gallager codes,” IEEE Trans. On Commun., vol. 52, no. 11, pp. 19011908, 2004.
[8] T. T. Chen, and S-He Tsai, “Reduced-Complexity WrapAround Viterbi Algorithms for Decoding Tail-Biting Convolutional Codes,” 14th European Wireless Conference, Jun. 2008.
[9] M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Improved LDPC Codes Using Irregular Graphs,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585-598, 2001.
[10] Giulietti A., “Turbo Codes: Desirable and Designable,” IKluwer Academic Publishers, ISBN: 1-4020-7660-6, 2004.
[11] P. Elias, “Coding for Noisy Channels,” IRE Conv. Rec., vol. 3, pt. 4, pp. 37–46, 1955.
[12] A. J. Viterbi, “Convolutional Codes and their Performance in Communication Systems,” IEEE Trans. On Commun. vol. 19, no. 15, pp. 751-772, 1971.
[13] C. Pollitt, D. Declercq, and T. Lestable, “Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation,” EURASIP Journal on Wireless Communications and Networking, vol. 2008, no. 473613, 2008.
[14] A. Refaey, S. Roy, and P. Fortier, “On the Application of BP Decoding to Convolutiona and Turbo Codes,” Asilomar Conference on Signals, Systems, and Computers, Nov. 2009.
[15] P. Stahl, J. B. Anderson, and R. Johannesson, “Optimal and near-optimal encoders for short and moderate-length tailbiting trellises,” IEEE Trans. Inform. Theory, vol. 45, no. 7, pp. 2562-2571, 1999.
[16] W. Yu, M. Ardakani, B. Smith, and F. FKschischang, “Complexityoptimized low-density parity-check codes for Gallager decoding algorithm B,” IEEE International Symposium on Information Theory (ISIT) s, Sep. 2005.14