Signal Power Consumption in Digital Communication using Convolutional Code with Compared to Un-Coded System

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2016 by IJCTT Journal
Volume-40 Number-2
Year of Publication : 2016
Authors : Madan Lal Saini, Dr. Vivek Kumar Sharma
  10.14445/22312803/IJCTT-V40P120

MLA

Madan Lal Saini, Dr. Vivek Kumar Sharma "Signal Power Consumption in Digital Communication using Convolutional Code with Compared to Un-Coded System". International Journal of Computer Trends and Technology (IJCTT) V40(2):104-108, October 2016. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
In digital communication system error correction codes are used when channel is noisy. An error correction code removes errors induced in communication and make possible error free transmission. By use of such error correction code we can send signal at lower transmit power as compared to un-coded system. Convolutional code corrects both type of errors random and burst and used in deep space and wireless communication. This paper introduces convolutional encoders for various code rates and generator polynomials and calculates BER performance for coded and un-coded system. Generator polynomials were selected for code rate 1/2, 1/3, and 1/4 on the basis of BER performance. This paper presents the signal power gain achieved by convolutional code as compared to un-coded system.

References
[1] J. H. Yuen, “Modulation and Coding for Satellite and Space Communications”, IEEE Proceedings, Vol. 78, No. 7, pp. 1250-1266, July 1990.
[2] A. J. Viterbi, “Convolutional codes and their performance in communication systems”, IEEE Transaction Communication Technology, Vol.19, pp. 751-772, Oct. 1971.
[3] B. Sklar, Upper Saddle River, N J, “Digital Communications, Fundamentals and Applications”, 2nd edition, Prentice-Hall, 2001.
[4] W. W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd ed. Cambridge, MA: The MIT, Press, 1972.
[5] Baldi, M., Cancellieri, G., “Low-rate LDPC convolutional codes with short constraint length”, International Conference on Software, Telecommunications and Computer Networks; Pp 330 – 335; 2015.
[6] Rodgers, W.; Lackey, R.B; “Burst-error-correcting convolutional codes with short constraint length”, IEEE Transactions on Information Theory; Volume: 26, Issue: 3; Pages: 354 - 359, Year: 1980.
[7] Mahe Jabeen, Salma Khan, “Design of Convolution Encoder and Reconfigurable Viterbi Decoder”, International Journal of Engineering and Science ISSN: 2278-4721, Vol. 1; Issue 3; PP 15-21; Sept 2012.
[8] Robert J. Mceliece, Fellow, IEEE and Wei Lin, student member, IEEE, “The trellis complexity of Convolutional Codes”, IEEE Transactions on Information Theory, Vol. 42, No. 6, November 1996.
[9] W.W. Peterson and E. J. Weldon, Jr., Error Correcting Codes, 2nd Edition Cambridge, MA: The MIT Press, 1972.
[10] R. Henning and C. Chakrabarti, "An approach for adaptively approximating the Viterbi algorithm to reduce power consumption while decoding convolutional codes," in IEEE Transactions on Signal Processing, vol. 52, no. 5, pp. 1443- 1451, May 2004.
[11] F. Angarita, et al, "Reduction of power consumption in a Viterbi Decoder for OFDM-WLAN", 14th IEEE International Conference on Electronics, Circuits and Systems, pp. 586-588, 2007.

Keywords
Convolutional Encoder, Code Rate, Generator Polynomials (GP), EbN0, BER, Viterbi Decoder.