Reed-Muller码的双向搜索译码
BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES
-
摘要: 本文提出了Reed-Muller码的一种双向搜索算法,并证明了该算法实现了广义最小距离译码。其复杂度较Forney的译码算法降低很多,而其完备译码的性能经计算机模拟表明,与最大似然译码几乎一样。Abstract: A method which uses the bidirectional search to decode Reed-Muller codes is presented. It is proved to be a generalized minimum distance (GMD) algorithm. The complexity is much simpler than that of Forney s method. The computer simulation shows that the performance of this approach is almost the same as that of maximum likelihood decoding (MLD).
-
Forney G D. IEEE Trans. on IT, 1988, IT-34(5):1152-1187.[2]段文清.Colay码的一种新的译码算法:[硕士论文].西安电子科技大学,1991.[3]MacWilliama F J, Sloane N J A. The Theory of Ertor Correcting Codet, Amtterdsm, Norch Holland: 1977, Ch. 13, 3.[4]Forney G D. IEEE Trans. on IT. 1966. IT-12(4):125-131. -
计量
- 文章访问数: 2165
- HTML全文浏览量: 112
- PDF下载量: 391
- 被引次数: 0
下载:
