Logo image
A RC-LDPC Coding Scheme Constructed Based on Extension and Splitting with Enhanced Decoding Scheduling
Thesis

A RC-LDPC Coding Scheme Constructed Based on Extension and Splitting with Enhanced Decoding Scheduling

Wang, Jyun-Ching
Masters, 國立清華大學, 通訊工程研究所
2016

Abstract

碼率相容低密度奇偶檢查碼 解碼排程 延展 拆分 錯誤平層 近似環外訊息度 RC-LDPC codes Decoding Schedule Extension Splitting error-floor ACE
Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) is a popular scheme to achieve high throughput and be used in many communication systems. The rate-compatible codes are suitable for IR-HARQ and usually can be realized using puncturing, extension or splitting. However, all of them can not provide a satisfactory error performance over a wide range of code rates. In this thesis, the code construction scheme based on low density parity check (RC-LDPC) codes is proposed. In order to achieve a more flexible code construction over a wide range of code rates, the extension and splitting are combined in our design. The Approximate Cycle Extrinsic (ACE) message degree is also equiped to lower the error-floor, which is never considered in the previous RC-LDPC code construction scheme. The RC-LDPC codes from rate-4/5 to 1/3 which satisfactory error rate performance and low error-floor are demonstrated. In addition, the error-floor performance of the proposed RC-LDPC codes have been significiantly improved comparing to that the previous design using pure extension or splitting. In order to further improve the throughput, the incremental decoding is introduced and the decoding schedules are arranged by Maximum Mutual Information Increase ($M^2I^2$)-based algorithm. The system can achieve high throughput even if the number of iterations is limited.

Metrics

1 Record Views

Details

Logo image