Cited 0 time in
A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Min-Ho | - |
| dc.contributor.author | Park, Kyeong-Bin | - |
| dc.contributor.author | Chung, Ki Seok | - |
| dc.date.accessioned | 2021-07-30T05:13:38Z | - |
| dc.date.available | 2021-07-30T05:13:38Z | - |
| dc.date.created | 2021-05-13 | - |
| dc.date.issued | 2020-06 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3713 | - |
| dc.description.abstract | The extended min-sum algorithm (EMS) for decoding non-binary low density parity check (NB-LDPC) codes reduces the decoding complexity by truncating the message vector by retaining only the most reliable symbols. However, the EMS algorithm does not consider that the noise of the received codeword is gradually reduced as the iteration count goes up. In this paper, we propose a low-complexity adaptive EMS algorithm, called threshold-based EMS (TB-EMS). The TB-EMS algorithm has a simple adaptive rule to calculate the new message vector length compared to the A-EMS. The proposed algorithm selects one of two message vector lengths. Experimental results show that the proposed algorithm reduces the decoding complexity with minimal performance degradation compared with the EMS algorithm. Further, the decoding performance of the TB-EMS is better than A-EMS. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.title | A Low-Complexity Adaptive Extended Min-Sum Algorithm for Non-Binary LDPC Codes | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | Chung, Ki Seok | - |
| dc.identifier.doi | 10.1109/ICCIA49625.2020.00048 | - |
| dc.identifier.scopusid | 2-s2.0-85092018218 | - |
| dc.identifier.bibliographicCitation | Proceedings - 2020 5th International Conference on Computational Intelligence and Applications, ICCIA 2020, pp.217 - 221 | - |
| dc.relation.isPartOf | Proceedings - 2020 5th International Conference on Computational Intelligence and Applications, ICCIA 2020 | - |
| dc.citation.title | Proceedings - 2020 5th International Conference on Computational Intelligence and Applications, ICCIA 2020 | - |
| dc.citation.startPage | 217 | - |
| dc.citation.endPage | 221 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Conference Paper | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Decoding | - |
| dc.subject.keywordPlus | Intelligent computing | - |
| dc.subject.keywordPlus | Iterative methods | - |
| dc.subject.keywordPlus | Decoding complexity | - |
| dc.subject.keywordPlus | Decoding performance | - |
| dc.subject.keywordPlus | Extended min sums | - |
| dc.subject.keywordPlus | Iteration count | - |
| dc.subject.keywordPlus | Low density parity check | - |
| dc.subject.keywordPlus | Non-binary LDPC codes | - |
| dc.subject.keywordPlus | Performance degradation | - |
| dc.subject.keywordPlus | Simple adaptive | - |
| dc.subject.keywordPlus | Computational complexity | - |
| dc.subject.keywordAuthor | Extended Min-Sum algorithm | - |
| dc.subject.keywordAuthor | Low-complexity decoding | - |
| dc.subject.keywordAuthor | Message truncation rule | - |
| dc.subject.keywordAuthor | Non-Binary Low Density Parity Check codes | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/9178673 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
