• DocumentCode
    1457469
  • Title

    A Reduced-Complexity Architecture for LDPC Layered Decoding Schemes

  • Author

    Kim, Sangmin ; Sobelman, Gerald E. ; Lee, Hanho

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
  • Volume
    19
  • Issue
    6
  • fYear
    2011
  • fDate
    6/1/2011 12:00:00 AM
  • Firstpage
    1099
  • Lastpage
    1103
  • Abstract
    A reduced-complexity low density parity check (LDPC) layered decoding architecture is proposed using an offset permutation scheme in the switch networks. This method requires only one shuffle network, rather than the two shuffle networks which are used in conventional designs. In addition, we use a block parallel decoding scheme by suitably mapping between required memory banks and processing units in order to increase the decoding throughput. The proposed architecture is realized for a 672-bit, rate-1/2 irregular LDPC code on a Xilinx Virtex-4 FPGA device. The design achieves an information throughput of 822 Mb/s at a clock speed of 335 MHz with a maximum of 8 iterations.
  • Keywords
    decoding; parity check codes; LDPC code; LDPC layered decoding scheme; Xilinx Virtex-4 FPGA device; block parallel decoding scheme; memory bank; offset permutation scheme; reduced complexity low density parity check layered decoding architecture; shuffle network; switch network; Clocks; Field programmable gate arrays; Forward error correction; Hardware; Iterative decoding; Multiprocessor interconnection networks; Parity check codes; Routing; Switches; Throughput; Decoding; field-programmable gate array (FPGA); forward error correction; low density parity check (LDPC);
  • fLanguage
    English
  • Journal_Title
    Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1063-8210
  • Type

    jour

  • DOI
    10.1109/TVLSI.2010.2043965
  • Filename
    5439945