DC Field | Value | Language |
---|---|---|
dc.contributor.author | 장정화 | en_US |
dc.date.accessioned | 2014-12-01T11:49:07Z | - |
dc.date.available | 2014-12-01T11:49:07Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.other | OAK-2014-01617 | en_US |
dc.identifier.uri | http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000001674841 | en_US |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/2119 | - |
dc.description | Master | en_US |
dc.description.abstract | Spatially-coupled low-density parity-check codes (SC-LDPC) can be efficiently decoded under the sum-product algorithm. However, the decoding convergence may fail due to cycles in the Tanner graph. To improve the decoding convergence, we analyze the cycle properties of SC-LDPC codes, our analysis is based on the investigation of the connections among the monomials in the polynomial syndrome former of time-invariant SC-LDPC codes, which is the transposed parity-check matrix in polynomial form. Also, we propose a construction method of SC-LDPC codes without short cycles. We demonstrate that an increase of short cycles in the polynomial syndrome former may cause high bit-error-rates. Finally, we propose a novel method method to generate ``good" SC-LDPC codes with respect to their cycle properties | en_US |
dc.language | kor | en_US |
dc.publisher | 포항공과대학교 | en_US |
dc.rights | BY_NC_ND | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.0/kr | en_US |
dc.title | 짧은 사이클을 가지지 않는 SC-LDPC 설계방법 | en_US |
dc.title.alternative | Construction Method of SC-LDPC Codes Without Short Cycles | en_US |
dc.type | Thesis | en_US |
dc.contributor.college | 일반대학원 전자전기공학과 | en_US |
dc.date.degree | 2014- 2 | en_US |
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.