We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparative Performance Analysis of Block and Convolution Codes

by Manika Pandey, Vimal Kant Pandey
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 119 - Number 24
Year of Publication: 2015
Authors: Manika Pandey, Vimal Kant Pandey
10.5120/21388-4398

Manika Pandey, Vimal Kant Pandey . Comparative Performance Analysis of Block and Convolution Codes. International Journal of Computer Applications. 119, 24 ( June 2015), 43-47. DOI=10.5120/21388-4398

@article{ 10.5120/21388-4398,
author = { Manika Pandey, Vimal Kant Pandey },
title = { Comparative Performance Analysis of Block and Convolution Codes },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 119 },
number = { 24 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 43-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume119/number24/21388-4398/ },
doi = { 10.5120/21388-4398 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:04:56.988016+05:30
%A Manika Pandey
%A Vimal Kant Pandey
%T Comparative Performance Analysis of Block and Convolution Codes
%J International Journal of Computer Applications
%@ 0975-8887
%V 119
%N 24
%P 43-47
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Error Correction Codes are required to have a reliable communication within a channel having an unacceptable bit error rate and low SNR (signal to noise ratio). Channel coding for error detection and correction helps communication system designers in reduction of effects caused due to noise in the transmission channel. There exist two main forms of channel codes – block codes and convolution codes. Block code is further classified into linear and cyclic code. In this paper, we have analyzed the performance of hamming code (linear), BCH code (cyclic) and convolution codes based on different designs and compared them by using bit error rate performance of a receiver in an absolutely fair manner using BPSK (Binary Phase Shift Keying). All simulation was done using MATLAB R2011b Simulink software.

References
  1. R. C. Bose and D. K. Ray-Chaudhuri, "On a class of error correcting binary group codes", Information and control, 3: 68-79, March 1960.
  2. R. W. Hamming "Error Detection and Error Correction Codes" Bell Systems Tech. Journal, vol 29, pp 147-160, April, 1950.
  3. Eltayeb S. Abuelyaman, Abdul-Aziz S. Al-Sehibani "Optimization of the Hamming Code for Error Prone Media", IJCSNS International Journal of Computer Science and Network Security, VOL. 8 No. 3, March 2008.
  4. Thomas J. Richardson, M. Amin Shokrollahi, "Design of Capacity Approaching Irregular Low-Density Parity-Check Codes", IEEE transactions on information theory,Vol. 47,No. 2, February 2001.
  5. B. Sklar,"Digital Communications Fundamentals and Applications Mathematical Methods and Algorithms", Prentice Hall, 2nd edition, 2001.
  6. Rohith S, Pavithra S "FPGA Implementation of (15,7) BCH Encoder and Decoder for Text Message", International Journal of Research in Engineering and Technology,vol. 2, pp. 209- 214,Sep 2013.
  7. Jorge castineira moreire & Patrick Guy Farrell, "essentials of error control coding", John Wiley & Sons Ltd, 2006.
  8. Kjell jorgen Hole, "Rate k/ (K+1) Minimal punctured convolutional encoders", IEEE Transactions on Information Theory, Vol. 37, No. 3, May 1991.
  9. 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.
  10. J. B. Cain, G. C. Clark and J. M. Giest, "punctured convolutional codes and simplified maximum likelihood decoding", IEEE transactions on Information Theory, vol. IT 25, No. 1, PP 97-100, January 1979.
  11. Sven Riedel, "symbol by symbol MAP decoding algorithm for high rate convolutional codes that use reciprocal dual codes", IEEE Journal on Selected Area in Communications, Vol. 16, No. 2, February 1998.
  12. J. A. Heller and I. M. Jacobs, "Viterbi Decoding for Satellite and Space Communications, "IEEE Transactions on Communication Technology, vol. com-19, pp. 835-848, October 1971.
Index Terms

Computer Science
Information Sciences

Keywords

Error detecting and correcting codes Hamming code BCH encoder/decoder convolution encoder/decoder.

Powered by PhDFocusTM