| 并行支路卷积碼譯碼算法之簡化 |
| |
| 引用本文： | 钟福元. 并行支路卷积碼譯碼算法之簡化[J]. 电子科技大学学报(社会科学版), 1989, 0(1) |
| |
| 作者姓名： | 钟福元 |
| |
| 作者单位： | 电子科技大学无线电技术系 |
| |
| 摘 要： | 本文主要工作:(1)从算法上证明了对于TCM用的一类有并行转移支路的卷积玛,其VITERBI译码算法可以作很有效的简化,而且简化不影响译码性能。(2)给出了表征算法复杂性的公式,讨论了简化效果。简化算法的复杂性约为常规算法的1/2~P。(3)用计算机模拟验证了简化算法和常规算法的等效性。因而,算法的简化不影响译码性能。
|
| 关 键 词： | 数字传输系统 卷积码 译码算法 算法复杂性 具有并行支路的卷积码 |
THE SIMPLIFICATION OF THE DECODING ALGORITHM FOR CONVOLUTIONAL CODES WITH PARALLEL TRANSITIONS |
| |
| Zhong Fuyuan. THE SIMPLIFICATION OF THE DECODING ALGORITHM FOR CONVOLUTIONAL CODES WITH PARALLEL TRANSITIONS[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 1989, 0(1) |
| |
| Authors: | Zhong Fuyuan |
| |
| Affiliation: | Dept.of Radio Technology |
| |
| Abstract: | The main contents of this paper are following: (1) By the algorithm, it is shown that the viterbi algorithm of the convolutional codes with parallel transition may be simplified efficiently and the simplification of the algorithm does not degrade the decoding performance. (2)The formulas characterizing algorithm complexity are given so as to discuss the simplification effect.The complexity of the simplified algorithm is reduced to about 1/2~p of the normal algorithm.(3) Computer simulatior has been done in order to test and verify the conclusion that the simplified algorithm is equivalent to the normal algorithm, so the simplification of algorithm has no degradation of decoding performance. |
| |
| Keywords: | digital transmission systems convolutional codes deccoding algorithm complexity convolutional codes with parallel transitions decoding algorithm |
| 本文献已被 CNKI 等数据库收录！ |
