이진 LDPC 부호를 위한 저복잡도 복호 알고리즘

MasterLow-density parity-check (LDPC) codes can be efficiently decoded with high performance. Especially, sum-product algorithm can achieve excellent performance, but high complexity. Min-sum algorithm is low complexity, but less performance. So, low complexity and high performance decoding algorithm is needed. In this thesis, we consider low complexity, high performance decoding algorithms. First, we introduce various decoding algorithms for binary LDPC codes. Second, we propose normalized min-sum algorithm with three normalization factors. This algorithm outperforms the existing normalized min-sum algorithm, normalized min-sum algorithm with two normalization factors. Third, we introduce finite alphabet iterative decoders (FAID) which is a new paradigm for finite precision iterative decoding. But existing FAID algorithm only considers binary LDPC codes with column weight three. So, we propose FAID for binary LDPC codes with column weight five. Our proposed algorithms have low-complexity and good error correcting performance

변수 노드 차수가 5인 LDPC 부호를 위한 유한 알파벳 반복 복호기

2

신드롬 무게 기반의 2-비트 최소합 LDPC 복호기를 위한 조기 중단 기준

2