DC Field | Value | Language |
---|---|---|
dc.contributor.author | 박성현 | - |
dc.date.accessioned | 2018-10-17T05:33:24Z | - |
dc.date.available | 2018-10-17T05:33:24Z | - |
dc.date.issued | 2018 | - |
dc.identifier.other | OAK-2015-07968 | - |
dc.identifier.uri | http://postech.dcollection.net/common/orgView/200000006666 | ko_KR |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/93358 | - |
dc.description | Master | - |
dc.description.abstract | Low-density parity-check (LDPC) codes have been shown to have near Shannon-limit performance when a probabilistic decoding is used and the code length goes to infinity. On the other hand, non-binary low-density parity-check (NB-LDPC) codes outperform binary LDPC codes for short code lengths. However, the coding gain of NB-LDPC codes comes from the expense of computational complexity. In this thesis, we consider the problem of a trade-off between reasonable complexity and good error-rate performance of decoding nonbinary LDPC codes over GF($q$). We first introduce the existing decoding algorithms of nonbinary LDPC codes and compare with decoding algorithms of binary LDPC codes. Second, low-complexity decoding algorithms of nonbinary LDPC codes is considered and two low-complexity symbol-flipping algorithms based on D-SFDP is proposed. These algorithms outperform the existing D-SFDP algorithm by improving the flipping metric. Proposed algorithms provide good trade-off between complexity and error performance. | - |
dc.language | kor | - |
dc.publisher | 포항공과대학교 | - |
dc.title | Low-Complexity Symbol-Flipping Decoding Algorithms for Nonbinary LDPC Codes | - |
dc.type | Thesis | - |
dc.contributor.college | 일반대학원 전자전기공학과 | - |
dc.date.degree | 2018- 2 | - |
dc.type.docType | Thesis | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.