Early Termination Method for LDPC Codes Based on Majority-Voted Codeword
- Authors
- Cho, E[Cho, Eunyoung]; Lee, H[Lee, Hyunjae]; Ju, H[Ju, Hyosang]; Yoon, C[Yoon, Chanho]; Kim, SH[Kim, Sang-Hyo]; Ko, YJ[Ko, Young-Jo]
- Issue Date
- 2020
- Publisher
- IEEE
- Keywords
- ultra-reliable and low latency communications; low-density parity check codes; sum-product algorithm; early termination
- Citation
- 11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020), pp.1484 - 1487
- Journal Title
- 11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020)
- Start Page
- 1484
- End Page
- 1487
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/94922
- ISSN
- 2162-1233
- 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 comparing 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Information and Communication Engineering > School of Electronic and Electrical Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/94922)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.