Modified tree structure approach for finding the first two minimum values

Research output: Contribution to conferenceConference paperpeer-review

Abstract

In the min-sum decoding algorithm of low-density parity-check (LDPC) codes, for a given set of input values to one check node, efficient approachs for finding the first and the second minimum values are greatly needed for the low complexity decoder. In this paper, based on the tree structure (TS) approach, we propose the modified TS (MTS) approach, which requires less number of comparisons to find the first and the second minimum values. Therefore, the hardware cost of the proposed MTS approach is lower than that of the TS approach.

Original languageEnglish
Title of host publication2014 IEEE China Summit and International Conference on Signal and Information Processing, IEEE ChinaSIP 2014 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages563-567
Number of pages5
ISBN (Electronic)9781479954032
DOIs
StatePublished - 2014.09.3
Event2nd IEEE China Summit and International Conference on Signal and Information Processing, IEEE ChinaSIP 2014 - Xi'an, China
Duration: 2014.07.92014.07.13

Publication series

Name2014 IEEE China Summit and International Conference on Signal and Information Processing, IEEE ChinaSIP 2014 - Proceedings

Conference

Conference2nd IEEE China Summit and International Conference on Signal and Information Processing, IEEE ChinaSIP 2014
Country/TerritoryChina
CityXi'an
Period14.07.914.07.13

Keywords

  • comparison
  • first minimum value
  • Low-density parity-check (LDPC) code
  • minsum algorithm
  • second minimum value

Quacquarelli Symonds(QS) Subject Topics

  • Computer Science & Information Systems
  • Data Science

Fingerprint

Dive into the research topics of 'Modified tree structure approach for finding the first two minimum values'. Together they form a unique fingerprint.

Cite this