A fast systematic optimized comparison algorithm for CNU design of LDPC decoders

Jui Hui Hung*, Sau-Gee Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

This work first investigates two existing check node unit (CNU) architectures for LDPC decoding: self-message-excluded CNU (SME-CNU) and two-minimum CNU (TM-CNU) architectures, and analyzes their area and timing complexities based on various realization approaches. Compared to TM-CNU architecture, SME-CNU architecture is faster in speed but with much higher complexity for comparison operations. To overcome this problem, this work proposes a novel systematic optimization algorithm for comparison operations required by SME-CNU architectures. The algorithm can automatically synthesize an optimized fast comparison operation that guarantees a shortest comparison delay time and a minimized total number of 2-input comparators. High speed is achieved by adopting parallel divide-and-conquer comparison operations, while the required comparators are minimized by developing a novel set construction algorithm that maximizes shareable comparison operations. As a result, the proposed design significantly reduces the required number of comparison operations, compared to conventional SME-CNU architectures, under the condition that both designs have the same speed performance. Besides, our preliminary hardware simulations show that the proposed design has comparable hardware complexity to low-complexity TM-CNU architectures.

Original languageEnglish
Pages (from-to)2246-2253
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE94-A
Issue number11
DOIs
StatePublished - 1 Jan 2011

Keywords

  • Algorithm
  • Channel coding
  • Comparison operation
  • LDPC decoder
  • hardware

Fingerprint Dive into the research topics of 'A fast systematic optimized comparison algorithm for CNU design of LDPC decoders'. Together they form a unique fingerprint.

Cite this