• DocumentCode
    2051927
  • Title

    Efficient memory optimization and high throughput decoding architecture based on LDPC codes

  • Author

    Ngangom, L. ; Manikandan, V.

  • Author_Institution
    Veltech Multitech Dr. Rangarajan Dr. Sakunthala Eng. Coll., Chennai, India
  • fYear
    2013
  • fDate
    21-22 Feb. 2013
  • Firstpage
    731
  • Lastpage
    734
  • Abstract
    Low-Density Parity-Check (LDPC) code is one kind of prominent error correcting codes (ECC) being considered in next generation industry standards. Here, the memory bandwidth is the key performance limiting factor. And the decoding throughput of a LDPC decoder is limited by this memory bandwidth requirement. The decoder implementation complexity has been the bottleneck of its application. This paper present a specific optimization called vectorization to take advantage of the configurable data-width and depth of embedded memory in an FPGA to improve the throughput of a decoder for quasicyclic LDPC codes. It is shown that this presented hardware structure will be highly competent in high throughput and low decoding latency applications.
  • Keywords
    error correction codes; field programmable gate arrays; optimisation; parity check codes; ECC; FPGA; LDPC decoder; decoder implementation complexity; error correcting codes; high throughput decoding architecture; key performance limiting factor; low-density parity-check code; memory bandwidth; memory optimization; quasicyclic LDPC codes; Decoding; Field programmable gate arrays; Memory management; Parity check codes; Random access memory; Throughput; Vectors; Alignment; field programmable logic array (FPGA); folding; low-density parity-check (LDPC) decoder; memory system optimization; normalized min-sum algorithm; quasi-cyclic low-density parity-check (QC-LDPC) codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Communication and Embedded Systems (ICICES), 2013 International Conference on
  • Conference_Location
    Chennai
  • Print_ISBN
    978-1-4673-5786-9
  • Type

    conf

  • DOI
    10.1109/ICICES.2013.6508255
  • Filename
    6508255