The Study of Bit-Flipping Sum-Product Decoding Algorithm for Irregular LDPC Codes
| Autor: | Sheng-Hong Tsai, 蔡昇宏 |
|---|---|
| Rok vydání: | 2011 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 99 Low-density parity-check (LDPC) codes are linear block codes. LDPC codes were proposed by Gallager in 1962. Due to high decoding complexity, it does not catch the attention of coding researchers. Recently, because of the development of technology and rediscovery of LDPC codes by Mackay et al., LDPC codes are applied in the widespread fields. It can be verified that decoding performance of LDPC codes using the Sum-Product Algorithm (SPA) algorithm at an additive white Gaussian noise (AWGN) channel can approach Shannon's limit. In 2010, R. EI Alami et al. proposed a hybrid decoding algortihm which combines SPA and Bit-Flipping (BF), denoted BFSPA. However, it can be observed that the performance of decoding ragular LDPC codes using BFSPA is worse than using SPA at lower SNR. The problem as above is disscussed with in this paper. We try to simulate the decoding performance of decoding irragular LDPC codes using BFSPA. Simulation results show that, the decoding performance using BFSPA decoding algorithm outperforms SPA at different SNR compared regular LDPC codes. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|