摘要
研究(2,1,m)卷积码费诺(Fano)算法译码的工程实现.通过软件编程模拟Fano算法,解决了实现Fano译码时根据编码规律即时恢复码树图和搜索路径正确标识的关键技术,为工程实现该算法打下了基础.
The realization of the sequential decoder of Fano algorithm for (2, 1, m) convolutional codes is discussed in the paper. Using simulation, the key technologies of how to restore the codetree map in real-time according to the rule of coding and to mark the searching path correctly are presented, which provide the theoretical basis for designing the decoder.
出处
《装备指挥技术学院学报》
2000年第3期88-91,共4页
Journal of the Academy of Equipment Command & Technology
关键词
Fano算法
码村图
译码约束度
Fano algorithm
codetree chart
decoding constraint length