A low-complexity step-by-step decoding algorithm for binary BCH codes

Ching Lung Chr, Szu Lin Su, Shao Wei Wu

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decoder is less than the conventional step-by-step decoding algorithm, since it reduces at least half of the matrix computations and the most complex element in the conventional step-by-step decoder is the "matrix-computing" element.

原文English
頁(從 - 到)359-365
頁數7
期刊IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E88-A
發行號1
DOIs
出版狀態Published - 2005 一月

All Science Journal Classification (ASJC) codes

  • 訊號處理
  • 電腦繪圖與電腦輔助設計
  • 電氣與電子工程
  • 應用數學

指紋

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

引用此