[256,252]RS擴展碼的快速譯碼算法
The Fast Decoding Algorithim of [256,252] RS Extended Code
-
摘要: 該文主要論述[256,252]RS(Reed-Solomon)擴展碼的快速譯碼算法。該算法是通過簡單的參數(shù)測試來發(fā)現(xiàn)接收數(shù)據(jù)中的錯誤類型以及錯誤模式，然后通過得到的錯誤模式來對接收數(shù)據(jù)進行錯誤糾正。與已有的譯碼算法相比，該算法具有占用硬件資源相對較少，處理時間相對較短的優(yōu)點，并且在硬件譯碼器上實現(xiàn)的最高數(shù)據(jù)處理速率超過400Mbit/s。
-
關(guān)鍵詞:
- 譯碼算法;RS擴展碼
Abstract: In this article, the main point is to describe the fast decoding algorithm of [256,252] RS extended code. In order to correct the error in the received data quickly, the algorithm gets the error type and error pattern through simple parameter-comparison, then adds the error pattern to the receive data. Compared to the algorithms in existence, this algorithm has the advantages of using less hardware resources and decoding time. When this algorithm implements in hardware, its throughput is more than 400Mbit/s. -
Lee Yuan Xing, Dend R H, Koh Eng Hean. An on-the-fly decoding technique for Reed-Solomon codes[J].IEEE Trans. Magnetics.1996, 32(5):3962-3964[2]Sarwate D V, Shanbhag N R. High-speed architecture for Reed-Solomon decoders [J].IEEE Trans. on VLSI Systems.2001, 9(5):641-655[3]Shao H M, Truong T K, Deutsch L J, Yuen J H, Reed I S. A VLSI design of a pipeline Reed-Solomon decoder [J].IEEE Trans. on Comput.1985, C-34(5):393-403[4]Berlekamp E R, Seroussi G, Tong P. Reed-Solomon Codes and Their Applications. Wicker S B and Bhargava V K, Eds. NJ: IEEE Press, 1994，第十章. -
計量
- 文章訪問數(shù): 2463
- HTML全文瀏覽量: 96
- PDF下載量: 655
- 被引次數(shù): 0
下載:
