Early Termination Method for LDPC Codes Based on Majority-Voted Codeword

  • Eunyoung Cho
  • , Hyunjae Lee
  • , Hyosang Ju
  • , Chanho Yoon
  • , Sang Hyo Kim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper, we propose an early termination method of sum-product algorithm for few-hundred-long low-density parity check codes. At low signal-to-noise ratio, by com-paring the decoded bits of current iteration with the majority-voted bits, we easily find few bits which seem correctable. With the small number of correctable bits even less than threshold, we give up the decoding at an early iteration. It is verified that the proposed scheme reduces at most 43% of unnecessary iterations compared with a conventional scheme.

Original languageEnglish
Title of host publicationICTC 2020 - 11th International Conference on ICT Convergence
Subtitle of host publicationData, Network, and AI in the Age of Untact
PublisherIEEE Computer Society
Pages1484-1487
Number of pages4
ISBN (Electronic)9781728167589
DOIs
StatePublished - 21 Oct 2020
Externally publishedYes
Event11th International Conference on Information and Communication Technology Convergence, ICTC 2020 - Jeju Island, Korea, Republic of
Duration: 21 Oct 202023 Oct 2020

Publication series

NameInternational Conference on ICT Convergence
Volume2020-October
ISSN (Print)2162-1233
ISSN (Electronic)2162-1241

Conference

Conference11th International Conference on Information and Communication Technology Convergence, ICTC 2020
Country/TerritoryKorea, Republic of
CityJeju Island
Period21/10/2023/10/20

Keywords

  • early termination
  • low-density parity check codes
  • sum-product algorithm
  • ultra-reliable and low latency communications

Fingerprint

Dive into the research topics of 'Early Termination Method for LDPC Codes Based on Majority-Voted Codeword'. Together they form a unique fingerprint.

Cite this