Low-complexity multi-mode multi-way split-row layered LDPC decoder for gigabit wireless communications

Tram Thi Bao Nguyen, Hanho Lee

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

This paper presents a novel low-complexity multi-mode multi-way split-row (split by factors of 2, 4, and 8) partially parallel pipelined layered low-density parity-check (LDPC) decoder architecture that is suitable for gigabit wireless communications. The innovative feature of the proposed decoder is related to the multi-way split-row layered LDPC decoding algorithm and architecture design techniques. Furthermore, we employed an efficient parity-check matrix-reordering method that uses row reordering, column reordering, and a local switching network to develop a multi-mode decoder that can support all four code rates specified in the IEEE 802.11ad standard. The proposed decoder can effectively reduce the complexity by a factor that is equal to the splitting factor, while the effect on the overall error-performance loss is negligible. Post-synthesis implementation results on TSMC 40-nm CMOS technology show that the proposed approach achieves higher area efficiency (throughput-to-area ratio) compared with other related previous works. For all four code rates, the proposed split-row pipelined layered LDPC decoder architecture (s = 2) occupies an area of 0.168 mm2 and achieves an encoded throughput of 11.8 Gb/s at five decoding iterations.

Original languageEnglish
Pages (from-to)189-200
Number of pages12
JournalIntegration, the VLSI Journal
Volume65
DOIs
StatePublished - Mar 2019

Bibliographical note

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

  • Decoder
  • Layered
  • Multi-mode
  • Pipelined
  • Quasi-cyclic low-density parity-check (QC-LDPC) code
  • Split-row
  • Wireless communications

Fingerprint

Dive into the research topics of 'Low-complexity multi-mode multi-way split-row layered LDPC decoder for gigabit wireless communications'. Together they form a unique fingerprint.

Cite this