• DocumentCode
    352141
  • Title

    The implementation of generalized minimum distance decoding for Reed Solomon codes

  • Author

    Mahmudi, A. ; Benaissa, M. ; Sweeney, P.

  • Author_Institution
    Sch. of Eng., Huddersfield Univ., UK
  • Volume
    4
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    53
  • Abstract
    Generalized minimum distance (GMD) decoding is a variant of soft-decision decoding for RS codes. It is well known that soft-decision decoding gives around 2 dB more coding gain than the conventional hard-decision decoding. However, most research has concentrated on soft-decision-decoding for convolutional codes. In this paper, we present the implementation of GMD decoding for RS codes using a modified Welch-Berlekamp Algorithm. A pilot design RS(31, 27) GMD decoder has been successfully implemented on a XILINX FPGA
  • Keywords
    Reed-Solomon codes; copy protection; delamination; GMD decoding; RS(31, 27); Reed Solomon codes; XILINX FPGA; coding gain; convolutional codes; generalized minimum distance decoding; modified Welch-Berlekamp Algorithm; soft-decision decoding; Block codes; Convolutional codes; Decoding; Electronics packaging; Error correction codes; Gain; Hardware; Parity check codes; Performance loss; Reed-Solomon codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
  • Conference_Location
    Geneva
  • Print_ISBN
    0-7803-5482-6
  • Type

    conf

  • DOI
    10.1109/ISCAS.2000.858686
  • Filename
    858686