Reed-Muller碼的雙向搜索譯碼
BIDIRECTIONAL SEARCH DECODING OF REED-MULLER CODES
-
摘要: 本文提出了Reed-Muller碼的一種雙向搜索算法,并證明了該算法實現(xiàn)了廣義最小距離譯碼。其復雜度較Forney的譯碼算法降低很多,而其完備譯碼的性能經(jīng)計算機模擬表明,與最大似然譯碼幾乎一樣。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. -
計量
- 文章訪問數(shù): 2209
- HTML全文瀏覽量: 120
- PDF下載量: 395
- 被引次數(shù): 0
下載:
