摘要
Recently, a maximum-likelihood (ML) decoding algorithm with two phases has been proposed for convolutional tailbiting codes [1]. The first phase applies the Viterbi algorithm to obtain the trellis information, and then the second phase employs the algorithm A* to find the ML solution. In this work, we improve the complexity of the algorithm A* by using a new evaluation function. Simulations showed that the improved Av algorithm has over 5 times less average decoding complexity in the second phase when Eb/N0≥ 4 dB.
原文 | English |
---|---|
頁(從 - 到) | 883-885 |
頁數 | 3 |
期刊 | IEEE Communications Letters |
卷 | 12 |
發行號 | 12 |
DOIs | |
出版狀態 | Published - 2008 |