Research Article
Bit Error Rate Analysis of Reed-Solomon Code for Efficient Communication System
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 30 - Issue 12 |
| Published: September 2011 |
| Authors: Sanjeev Kumar, Ragini Gupta |
10.5120/3710-5174
|
Sanjeev Kumar, Ragini Gupta . Bit Error Rate Analysis of Reed-Solomon Code for Efficient Communication System. International Journal of Computer Applications. 30, 12 (September 2011), 11-15. DOI=10.5120/3710-5174
@article{ 10.5120/3710-5174,
author = { Sanjeev Kumar,Ragini Gupta },
title = { Bit Error Rate Analysis of Reed-Solomon Code for Efficient Communication System },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 30 },
number = { 12 },
pages = { 11-15 },
doi = { 10.5120/3710-5174 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A Sanjeev Kumar
%A Ragini Gupta
%T Bit Error Rate Analysis of Reed-Solomon Code for Efficient Communication System%T
%J International Journal of Computer Applications
%V 30
%N 12
%P 11-15
%R 10.5120/3710-5174
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In wireless, satellite, and space communication systems, reducing error is critical. High bit error rates of the wireless communication system require employing various coding methods on the data transferred. Channel coding for error detection and correction helps the communication system designers to reduce the effects of a noisy transmission channel. The purpose of this paper is to study and investigate the performance of Reed-Solomon code that is used to encode the data stream in digital communication. The performances were evaluated by applying to binary phase sift keying modulation scheme in symmetric Additive White Gaussian Noise channel. Reed-Solomon codes are best for correcting burst errors and find wide range of applications in digital communications and data storage.
References
- C. E. Shannon: "A mathematical theory of communication," Bell System Technical Journal, vol. 27 ,October 1948, pp. 379– 423.
- C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding:Turbo codes”, ICC’ 93, Conference Record, Geneva, pp. 1064–1070, 1993.
- Daniel J., Costello, JR., Error Control Coding, Fundamentals and Applications, Prentice Hall, Inc. Englewood Cliffs, New Jersey, 1983
- S. Lin and D.J. Costello, Jr. Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice Hall, 1983
- J. Proakis, Digital communications , NY: McGraw Hill, 2001
- I.S. Reed and G. Solomon, “Polynomial Codes Over Certain Finite Fields,” SIAM Journal of Applied Mathematics, vol. 8, 1960, pp. 300–304.
- R.J.McEliece, L.Swanson, “On the decoder error probability for Reed-Solomon codes”, IEEE Trans.on Inf.Theory, Vol.IT-32, pp.701-703
- 3 R. E. Blahut, "Transform Techniques for Error Control Codes," IBM Journal of Research and Development, Volume 23, pp. 299-315, 1979.
- S. B. Wicker, Error Control Systems for Digital Communication and Storage, Englewood Cliffs, N.J.: Prentice-Hall, 1994.
- I. S. Reed and G. Solomon, "Polynomial Codes over Certain Finite Fields," SI AM Journal of Applied Mathematics, Volume 8, pp. 300-304,1960.
- J.L. Massey, "Deep Space Communications and Coding: A Match Made in Heaven," in Advanced Methods for Satellite and Deep Space Communications, J. Hagenauer (ed.), Lecture Notes in Control and Information Sciences, Volume 182, Berlin: Springer-Verlag, 1992.
Index Terms
Keywords