A simple step-by-step decoding of binary BCH codes

  • Ching Long Chyr
  • , Szu Lin Su
  • , Shao Wei Wu

研究成果: Conference contribution

摘要

This paper proposes a simple step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes. By using logical analysis, we obtain a simple rule, which can directly determine whether any bit in received codeword is correct or not without finding the error-location polynomial. Compared to a previously proposed step-by-step decoding algorithm, the new method significantly reduces the matrix calculation. Since the most complex element in the conventional step-by-step decoder is the "matrix calculation", the computation complexity of this decoder can be much less than the conventional step-by-step decoding algorithm.

原文English
主出版物標題Proceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications
編輯A.O. Fapojuwo
頁面318-322
頁數5
出版狀態Published - 2004
事件Proceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications - Banff, Canada
持續時間: 2004 7月 82004 7月 10

出版系列

名字Proceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications

Other

OtherProceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications
國家/地區Canada
城市Banff
期間04-07-0804-07-10

All Science Journal Classification (ASJC) codes

  • 一般工程

指紋

深入研究「A simple step-by-step decoding of binary BCH codes」主題。共同形成了獨特的指紋。

引用此