DC Field | Value | Language |
---|---|---|
dc.contributor.author | 최상훈 | - |
dc.date.accessioned | 2018-10-17T05:27:33Z | - |
dc.date.available | 2018-10-17T05:27:33Z | - |
dc.date.issued | 2016 | - |
dc.identifier.other | OAK-2015-07373 | - |
dc.identifier.uri | http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002224131 | ko_KR |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/93275 | - |
dc.description | Master | - |
dc.description.abstract | The objective of this thesis is to develop schemes to construct algebraically structured low-density parity-check (LDPC) codes for improving their performance and memory efficiency. It is well-known that the sum-product algorithm provides optimum decoding for LDPC codes with no cycles. However, short cycles in the Tanner graph of LDPC codes may induce a serious performance degradation. Several researchers made an effort to obtain the LDPC codes with no short cycles. Quasi-cyclic LDPC (QC-LDPC) code is a type of LDPC codes, based on circulant permutation matrices. It required a smaller size of memory for encoding and/or decoding and are easier to analyze their algebraic properties than random LDPC codes. This motivates us to take an intensive interest in constructing nonbinary QC-LDPC codes without short cycles. In this thesis, we propose a construction method of nonbinary QC-LDPC codes without short cycles. We present the mathematical proof for girth and cycle properties of proposed design method. As a result, we present the constructing method for nonbinary QC-LDPC codes without short cycles and show it performs well. | - |
dc.language | kor | - |
dc.publisher | 포항공과대학교 | - |
dc.title | 구조적인 LDPC 부호의 설계 및 성능 분석 | - |
dc.type | Thesis | - |
dc.contributor.college | 일반대학원 전자전기공학과 | - |
dc.date.degree | 2016- 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.