Rate Compatible Shortened LDPC Codes and a Type-II HARQ with Fixed Re-encoded Redundancy
碩士 === 國立交通大學 === 電信工程研究所 === 103 === In this thesis, we study shortening and hybrid automatic retransmission request (HARQ) schemes for finite-length rate-compatible low-density parity-check codes. Shortening is a scheme to decrease the code length and the code rate by eliminating some information...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/95853548700840083066 |
| Summary: | 碩士 === 國立交通大學 === 電信工程研究所 === 103 === In this thesis, we study shortening and hybrid automatic retransmission request (HARQ) schemes for finite-length rate-compatible low-density parity-check codes. Shortening
is a scheme to decrease the code length and the code rate by eliminating some information bits in a codeword. Instead of modifying the parity-check matrix, shortening LDPC codes can be performed by assigning infinite reliability on the associated variable nodes. We propose a new method to obtain shortening patterns which lead to better performance than the ones provided by the existing shortening methods. An HARQ scheme is an error control protocol based on combining forward error correction and error detection with retransmission requests. LDPC codes have been employed in HARQ protocols. We propose another novel LDPC code-based HARQ scheme in which the re-encoded information bits will be used as known information. Numerical and experimental results show that the proposed HARQ scheme provides a high throughput.
|
|---|