Open Access System for Information Sharing

Login Library

 

Thesis
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

비이진 LDPC 부호를 위한 낮은 복잡도를 가지는 복호 알고리즘

Title
비이진 LDPC 부호를 위한 낮은 복잡도를 가지는 복호 알고리즘
Authors
조한설
Date Issued
2012
Publisher
포항공과대학교
Abstract
Low complexity parity-check (LDPC) codes have been shown to approach Shannon-limit performance for long code length. On the other hand, for moderate code length, the error performance can be improved by constructing LDPC codes over finite fleld fields GF(q). However, this improvement is achieved at the expense of increased decoding complexity. In this thesis, we consider the problem of decoding nonbinary LDPC codes over GF(q) with reasonable complexity and good error-rate performance. Two decoding algorithms with low complexity for nonbinary LDPC codes are proposed. First algorithm is the extension of weighted symbol-flipping (WSF) algorithm, and it is called multiple weighted symbol-flipping (MWSF) algorithm in this thesis. Second algorithm is based on Iterative Soft-Based Majority logic (ISBM) algorithm, and it is called extended ISBM (EISBM) in this thesis. These algorithms provide effective trade-off between decoding complexity and error-performance compared to the existing decoding algorithms.
URI
http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000001216096
http://oasis.postech.ac.kr/handle/2014.oak/1364
Article Type
Thesis
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Views & Downloads

Browse