• DocumentCode
    2162661
  • Title

    Design and FPGA implementation of iterative decoders for codes on graphs

  • Author

    Sivasubramanian, Bharathram ; Gross, Warren J. ; Leib, Harry

  • Author_Institution
    Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC
  • fYear
    2009
  • fDate
    3-6 May 2009
  • Firstpage
    1080
  • Lastpage
    1084
  • Abstract
    This work presents a field programmable gate array (FPGA) implementation of the min-sum iterative decoding algorithm for the (8,4) extended Hamming code using a reconfigurable computing system. The Mitrion-C high level language (HLL) is used to program the FPGAs, since it provides flexible tools for FPGA-based prototyping and functional verification for hardware design. A hardware-efficient implementation of the min-step in the min-sum decoder, which eliminates the use of floating point multipliers, is also presented. The parallelism offered by the min-sum algorithm is exploited in hardware, resulting in a 15 fold speedup over optimized software implementations. The performance of the hardware implementation is virtually the same as that predicted by computer simulations, validating the hardware design.
  • Keywords
    C language; Hamming codes; field programmable gate arrays; floating point arithmetic; graph theory; iterative decoding; FPGA implementation; Mitrion-C high level language; extended Hamming code; field programmable gate array; floating point multipliers; functional verification; hardware-efficient implementation; iterative decoders; min-sum iterative decoding algorithm; reconfigurable computing system; Computer simulation; Field programmable gate arrays; Hardware; High level languages; Iterative algorithms; Iterative decoding; Parallel processing; Prototypes; Software algorithms; Software prototyping;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 2009. CCECE '09. Canadian Conference on
  • Conference_Location
    St. John´s, NL
  • ISSN
    0840-7789
  • Print_ISBN
    978-1-4244-3509-8
  • Electronic_ISBN
    0840-7789
  • Type

    conf

  • DOI
    10.1109/CCECE.2009.5090295
  • Filename
    5090295