西安电子科技大学信息工程系
纸质出版:1995
移动端阅览
[1]李晖,王育民.一种Golay码的快速译码算法[J].电子学报,1995(04):95-99.
李晖, 王育民. A Fast Decoding Algorithm for Golay Code[J]. Acta Electronica Sinica, 1995, (4).
本文提出了一种(24,12,8)扩展Golay码的新的软判决译码算法,其译一组码字的运算量最多为507次二元运算,优于目前已发表的各种算法。我们证明了该算法,并实现了广义最小距离译码。计算机模拟表明在完备译码时其性能与最大似然译码几乎一样。
A new soft decision decoding algorithm for (24
12
8) extended Golay code is presented
and the complexity of it is at most 507 real additions
which is
to our knowlege
the best among the existing algorihtms. It is proved to be a generalized minimum distance (GMD)algorithm.Computer simulation shows that its performance is almost the same as that of Maximum likelihood decoding(MLD).
0
浏览量
138
下载量
5
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621