| 摘要: |
| 双二元卷积Turbo码（DB CTC）的非二进制编码使得译码复杂度增加，限制了其在某些实际通信工程中的使用。在最大后验概率（MAP）译码算法的基础上，提出了一种优化算法，将译码的存储量和计算量降为原来的1/4。仿真结果表明：在不同编码长度和码率的情况下，优化算法与原算法性能相当；在误码率为10-5的条件下，两者的Eb/N0差异同样不大于0.1 dB。 |
| 关键词: 卷积Turbo码；Log-MAP算法；循环递归 低复杂度译码 |
| DOI： |
|
| 基金项目: |
|
| A low-complexity decoding algorithm for double binary convolutional Turbo codes |
| JIANG Chunqiang,TANG Zhenyu,GAN Ming |
| () |
| Abstract: |
| The double binary convolutional Turbo code(DB CTC) cannot be widely applied in some projects due to the high-complexity of decoding algorithm. In this paper,a new decoding algorithm with low-complexity for DB CTC is proposed based on the classic maximum a posteriori probability(MAP) decoding algorithm. By using the proposed algorithm,the storage cost and the computation complexity decrease by 3/4 compared with previous algorithm.Simulation results show that,when the bit error rate(BER) is 10-5,the Eb/N0 deference between the proposed algorithm and the previous algorithm is not larger than 0.1dB for various lengths of code and code-rates. |
| Key words: conventional Turbo code Log-MAP algorithm cycle recursion low-complexity decoding |
