Low complexity decoder architecture for low-density parity-check codes

Daesun Oh, Keshab K. Parhi

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

In this paper, we propose a low complexity decoder architecture for low-density parity-check (LDPC) codes using a variable quantization scheme as well as an efficient highly-parallel decoding scheme. In the sum-product algorithm for decoding LDPC codes, the finite precision implementations have an important tradeoff between decoding performance and hardware complexity caused by two dominant area-consuming factors: one is the memory for updated messages storage and the other is the look-up table (LUT) for implementation of the nonlinear function Ψ(x). The proposed variable quantization schemes offer a large reduction in the hardware complexities for LUT and memory. Also, an efficient highly-parallel decoder architecture for quasi-cyclic (QC) LDPC codes can be implemented with the reduced hardware complexity by using the partially block overlapped decoding scheme and the minimized power consumption by reducing the total number of memory accesses for updated messages. For (3, 6) QC LDPC codes, our proposed schemes in implementing the highly-parallel decoder architecture offer a great reduction of implementation area by 33% for memory area and approximately by 28% for the check node unit and variable node unit computation units without significant performance degradation. Also, the memory accesses are reduced by 20%.

Original languageEnglish (US)
Pages (from-to)217-228
Number of pages12
JournalJournal of Signal Processing Systems
Volume56
Issue number2-3
DOIs
StatePublished - Sep 1 2009

    Fingerprint

Keywords

  • Finite precision
  • Highly-parallel decoding
  • Low complexity decoder architecture
  • Low-density parity check (LDPC) codes
  • Quasi-cyclic (QC) LDPC codes
  • Sum-product algorithm (SPA)
  • Variable quantization

Cite this