• DocumentCode
    1381795
  • Title

    Fast decoder for triple-error-correcting primitive binary BCH codes with odd m

  • Author

    Lu, E.-H. ; Cheng, Y.-C. ; Lu, P.C.

  • Author_Institution
    Dept. of Electr. Eng., Chang Gung Univ., Tao-Yuan, Taiwan
  • Volume
    145
  • Issue
    2
  • fYear
    1998
  • fDate
    4/1/1998 12:00:00 AM
  • Firstpage
    60
  • Lastpage
    64
  • Abstract
    A triple-error-correcting primitive binary BCH code with odd m is shown to be the intersection of three Hamming codes each of length n=2 m-1. Using this property, a decoding algorithm for the code is developed. Based on the algorithm, a hardware decoder is designed by the use of five ROMs, each 2m×m bits, and several logic gates. In comparison with conventional decoders, the decoder is simpler in complexity and faster in decoding speed
  • Keywords
    BCH codes; Hamming codes; computational complexity; decoding; digital circuits; error correction codes; Hamming codes intersection; ROMs; complexity; decoding algorithm; decoding speed; fast decoder; hardware decoder; logic gates; triple-error-correcting primitive binary BCH codes;
  • fLanguage
    English
  • Journal_Title
    Communications, IEE Proceedings-
  • Publisher
    iet
  • ISSN
    1350-2425
  • Type

    jour

  • DOI
    10.1049/ip-com:19981898
  • Filename
    677587
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1381795