Nonuniformly quantized min-sum decoder architecture for low-density parity-check codes

Daesun Oh, Keshab K. Parhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

In this paper, we propose a novel min-sum (MS) decoder architecture using nonuniform quantization schemes for low-density parity-check (LDPC) codes. The finite word-length analysis in implementing an LDPC decoder is a very important factor since it directly impacts the size of memory to store the intrinsic and extrinsic messages and the overall hardware area in the partially parallel LDPC decoder. The proposed nonuniform quantization scheme can reduce the finite word-length while achieving similar performances compared to a conventional quantization scheme. From simulation results, it is shown that the proposed 4-bits nonuniform quantization scheme achieves an acceptable decoding performance unlike a conventional 4-bits uniform quantization scheme. In addition, the hardware implementation for the proposed nonuniform quantization scheme requires smaller area.

Original languageEnglish (US)
Title of host publicationGLSVLSI 2008
Subtitle of host publicationProceedings of the 2008 ACM Great Lakes Symposium on VLSI
Pages451-456
Number of pages6
DOIs
StatePublished - 2008
EventGLSVLSI 2008: 18th ACM Great Lakes Symposium on VLSI 2008 - Orlando, FL, United States
Duration: Mar 4 2008Mar 6 2008

Publication series

NameProceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI

Other

OtherGLSVLSI 2008: 18th ACM Great Lakes Symposium on VLSI 2008
Country/TerritoryUnited States
CityOrlando, FL
Period3/4/083/6/08

Keywords

  • Finite word-length
  • LDPC decoder
  • Min-sum (MS) decoding algorithm
  • Nonuniform quantization

Fingerprint

Dive into the research topics of 'Nonuniformly quantized min-sum decoder architecture for low-density parity-check codes'. Together they form a unique fingerprint.

Cite this