CFP last date
20 January 2025
Reseach Article

Design and Implementation of RS (255, 223) Detecting Code in FPGA

by Bappaditya Kuila
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 123 - Number 9
Year of Publication: 2015
Authors: Bappaditya Kuila
10.5120/ijca2015905623

Bappaditya Kuila . Design and Implementation of RS (255, 223) Detecting Code in FPGA. International Journal of Computer Applications. 123, 9 ( August 2015), 33-39. DOI=10.5120/ijca2015905623

@article{ 10.5120/ijca2015905623,
author = { Bappaditya Kuila },
title = { Design and Implementation of RS (255, 223) Detecting Code in FPGA },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 123 },
number = { 9 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 33-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume123/number9/21989-2015905623/ },
doi = { 10.5120/ijca2015905623 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:12:16.272447+05:30
%A Bappaditya Kuila
%T Design and Implementation of RS (255, 223) Detecting Code in FPGA
%J International Journal of Computer Applications
%@ 0975-8887
%V 123
%N 9
%P 33-39
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Reed-Solomon (RS) codes are commonly used in the digital communication. It has high capability to eliminate both random errors and burst errors. In this work, the encoding of RS(255, 223) code is designed, synthesized, and simulated using Verilog language with the device family of virtex4 & device of xc4vfx12 & compare the result with device family Spartan3E & device XC3S100E. During the transfer of message, the data might get corrupted due to lots of disturbances in the communication channel. So it is necessary for the decoder tool to also have a function of correcting the error that might occur. So, from syndrome input-output waveform, it has been checked that whether there is any error in the received codeword or not. RS codes are type of burst error detecting codes which has got many applications due to its burst error detection and correction nature. This code is defined over a Galois Field GF(28) and has the capability of correcting up to sixteen short bursts of errors.

References
  1. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8:300-304, 1960.
  2. ETSI, 1997. Digital broadcasting systems for television, sound and data services; Framing structure, channel coding and modulation for digital terrestrial television. European Telecommunication Standard ETS 300 744.
  3. S.B. Wicker. Error Control Systems for Digital Communication and Storage. Prentice-Hall, Englewood Clips, NJ, 1995.
  4. G. D. Forney, Jr. On decoding BCH codes. IEEE Transactions on Information Theory, IT-11:549-557, 1965.
  5. S. Liu and Jr. D. J. Costello. Error Control Coding: Fundamentals and Applications. Prentice-Hall, Englewood Clips, NJ, 1983.
  6. Akyildiz, I.F., T. Melodia, and K.R. Chowdury, Wireless multimedia sensor networks: A survey. IEEE Wireless Communications. 2007, 14(6): p. 32-39.
  7. H. Y. Hsu and A. Y. Wu, “VLSI Design of a Reconfigurable Multimode Reed-Solomon Codec for High Speed Communication Systems,” in IEEE Asia-Pacific Conference on ASIC, 2002, pp. 359-362.
  8. K.A.S. Immink, \Reed Solomon codes and the compact disc," in Reed-Solomon Codes and Their Applications, eds. S.B. Wicker and V.K. Bhargava. New York: IEEE Press, 1994, pp. 41-59.
  9. Stephen B. Wicker and Vijay K. Bhargava, “Reed-Solomon codes and their applications”, IEEE Press, New Jersey, 1994.
  10. J. L. Massey. Shift register synthesis and BCH decoding. IEEE Trans-actions on Information Theory, pages 122 - 127, January 1969.
  11. Sklar B, “Digital Communication: Fundamentals and Applications”, Second Edition, Prentice-Hal, 2001.
  12. Pretzel, O. 1992.Error-correcting codes and finite fields. Clarendon Press, Oxford, 1992.
  13. R. T. Chien. Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes. IEEE Transactions on Information Theory, IT-10:357 - 363, October 1964.
  14. Y. R. Shayan and T. Le-Ngoc, “Decoding Reed- Solomon codes generated by any generator polynomial,” Electronics Letters, vol. 25, no. 18, Aug. 1989, pp. 1223-1224.
  15. T. Yaghoobian and I.F. Blake “Reed Solomon and Algebraic Geometry Codes," in Reed-Solomon Codes and Their Applications, eds. S.B. Wicker and V.K. Bhargava. New York: IEEE Press, 1994, pp. 292-314.
  16. Anindya Sundar Das, Satyajit Das and Jaydeb Bhaumik, Design of RS (255, 251) Encoder and Decoder in FPGA . International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-6, January.
  17. Jaydeb Bhaumik, Anindya Sundar Das and Jagannath Samanta, Architecture for Programmable Generator Polynomial Based Reed-Solomon Encoder and Decoder. International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-6, January
  18. J. Bhaumik and D. Roy Chowdhury, “An Integrated ECC-MAC Based on RS Code,” Transactions on Computational Science, vol. IV, LNCS5430, Apr. 2009, pp. 117-135.
  19. Syed Shahzad Sha, Saqib Yaqub, and Faisal Suleman, “ Self-correcting codes conquer noise Part 2: Reed-Solomon codec’s”, EDN, pp. 107-120, March 2001.
  20. J. Jittawutipoka and J. Ngarmnil, “Low complexity Reed-Solomon encoder using globally optimized finite field multipliers”, TENCON 2004, 2004 IEEE Region 10 Conference, vol. D, 21-24 Nov. 2004, pp. 423-426, doi: 10.1109/TENCON.2004.1414960.
Index Terms

Computer Science
Information Sciences

Keywords

Reed-Solomon code Linear Feedback Shift Register Galois Field Generator Polynomial Encoder Constant Multiplier Syndrome Verilog language.