Decoding algorithm for binary BCH codes

Ching Lung Chr, Szu-Lin Su, Shao Wei Wu

研究成果: Conference contribution

摘要

A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the "matrix-computing" element.

原文English
主出版物標題Proceedings of the IASTED International Conference on Communication Systems and Networks
編輯C.E.P. Salvador
頁面254-258
頁數5
出版狀態Published - 2004
事件Proceedings of the IASTED International Conference on Communication Systems and Networks - Marbella, Spain
持續時間: 2004 九月 12004 九月 3

Other

OtherProceedings of the IASTED International Conference on Communication Systems and Networks
國家/地區Spain
城市Marbella
期間04-09-0104-09-03

All Science Journal Classification (ASJC) codes

  • 工程 (全部)

指紋

深入研究「Decoding algorithm for binary BCH codes」主題。共同形成了獨特的指紋。

引用此