Performance Comparison of Latency for RSC-RSC and RS-RSC Concatenated Codes

Manish Kumar¹ , Jyoti Saxena²

Section:Research Paper, Product Type: Journal
Vol.1 , Issue.2 , pp.1-4, Jun-2013

Online published on Jun 30, 2013

Copyright © Manish Kumar , Jyoti Saxena . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
In practical communication systems, a low error probability and a high transmission rate are not the only important factors. Another very important parameter is the latency. In this paper, an attempt has been made to enhance the latency performance of serially concatenated convolutional codes. In particular, we compare RSC-RSC concatenated codes using non-iterative concatenated Viterbi decoding to RS-RSC concatenated codes using concatenation of Viterbi & Berklelamp-Massey decoding. Overall code rate i.e. transmission rate of concatenated code system is varied through puncturing & its effect on the latency of concatenated systems is simulated. On the basis of simulations, it is shown that RSC-RSC code is better than RS-RSC codes for in terms of latency. It is also shown that for concatenated codes a trade-off is needed to be considered between BER & latency in digital communications.

Key-Words / Index Term :
SCCC; Turbo Codes; Reed-Solomon Code; RSC Codes; Viterbi Decoding; Latency

References :
[1] G Shannon, “A Mathematical Theory of Communication�, Bell Technical System 27, 379-423, 1948
[2] G. D. Forney, “Concatenated Codes. Cambridge�, M.I.T. Press, 1966
[3] J. Hagenauer and P. Hoeher, “Concatenated Viterbi Decoding�Proceedings of the International Workshop on Information Theory, 1989
[4] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding, Turbo-Codes�, Proceedings of ICC'93, Geneva, Switzerland, May 1993
[5] S. Benedetto and G. Montorsi, “Serial concatenation of block and convolutional codes�, Electron. Lett. vol. 32, pp. 887-888, May 1996.
[6] S. Benedetto and G. Montorsi, “Iterative decoding of serially concatenated convolutional codes� Electronics Letters, vol. 32, pp. 1186 – 1188, June 1996.
[7] P.Elias, “Coding for Noisy Channels�, IRE Conv. Rec.: 37-46, (1955).
[8] I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields�, J. Soc. Industrial Appl. Math, vol. 8, pp. 300-304, (1960)
[9] Byun, Sunghan, Dong Joon, and Jung Sun,� Performance comparison of RS-CC concatenated codes using NSC and RSC codes�, Network Infrastructure and Digital Content, 2nd IEEE International Conference, Beijing, 24-26 Sept. 2010
[10] E. Boutillon, C. Douillard, and G. Montorsi, “Iterative Decoding of concatenated codes Implementation issues�, draft, January 29, 2007.
[11] K. Manish., and S. Jyoti, “Performance Comparison of RSC-RSC Concatenated code and RS-RSC Concatenated code using Non- iterative Concatenated Viterbi Decoding Technique�, Manuscript submitted for publication, IEEE proceedings of ICMIRA’, Dec 2013
[12] Shin-Lin Shiehat., et. al, “A Low-Latency Decoder for Punctured/ Shortened Reed-Solomon Codes" IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications, pp 2547-2551, 2005
[13] M. Kaiser et al., “A Comparison of Decoding Latency for Block and Convolutional CodesUniversity Science, 1989.