An Improved Chase II Algorithm and the Application of Decoding Block Turbo Codes
| Autor: | Kai Jie Huang, 黃楷傑 |
|---|---|
| Rok vydání: | 2009 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 97 This paper proposes a low-complex Chase-2 decoding algorithm and the decoding of block turbo codes (BTCs). In addition, we study the trend of extrinsic information to promote the bit-error-rate (BER) performance of BTCs. Chase proposed Chase-2 algorithm to reduce decoding complexity of soft-decision decoding for linear block codes. According to channel measurements, we can find a set of candidate codewords. From the set, we select the minimum squared Euclidean distance codeword D as the optimum decision, which reduces the complexity of the soft-decision decoding. This paper proposes a method to form a smaller candidate set to reduce the complexity of the traditional Chase algorithm. Simulation results show, the performance of threshold Chase-2 is almost the same as Chase-2. In [17], R. M. Pyndiah uses the maximum a posteriori (MAP) theorem to compute the extrinsic information of block turbo codes. We use Chase-2 to find the optimum decision D and the competing codeword. Then, we compute the soft outputs which are used to compute the extrinsic information. This paper proposes an improved Chase II algorithm and the application of decoding block turbo codes. By computer simulation, we set threshold equal to 1. The performance is almost the same as Chase-2, but we reduce the computation about 30.48%. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|