• DocumentCode
    2110321
  • Title

    A comparison of binary quasi-cyclic decoder implementations

  • Author

    Bandsmer, Michael ; Bhargava, Vijay K. ; Gulliver, T. Aaron

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada
  • Volume
    1
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    280
  • Abstract
    Decoding algorithms have been developed for binary quasi-cyclic (QC) codes of rates 1/n0 and (n0-1)/n0. This paper presents hardware and software implementations of these algorithms, and compares them with respect to speed and complexity. The algorithms are illustrated with (36,24) and (30,15) QC codes
  • Keywords
    binary codes; computational complexity; cyclic codes; decoding; error correction codes; linear codes; matrix algebra; binary quasi-cyclic codes; binary quasi-cyclic decoder implementations; circulant matrix; codes rate; codewords; complexity; decoding algorithms; generator matrix; hardware implementation; linear error correcting code; software implementation; speed; syndrome computation circuit; Algebra; Character generation; Decoding; Error correction codes; Galois fields; Hamming weight; Hardware; Polynomials; Software algorithms; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 2000 Canadian Conference on
  • Conference_Location
    Halifax, NS
  • ISSN
    0840-7789
  • Print_ISBN
    0-7803-5957-7
  • Type

    conf

  • DOI
    10.1109/CCECE.2000.849714
  • Filename
    849714
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2110321