A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes(Coding Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2005-01-01

著者

• Wu Shao-wei

  Department Of Electrical Engineering National Cheng Kung University

• Su S‐l

  Department Of Electrical Engineering National Cheng Kung University

• Su Szu‐lin

  Institute Of Computer And Communication Engineering Department Of Electrical Engineering National Ch

• CHR Ching-Lung

  the Department of Electrical Engineering, National Cheng Kung University

• SU Szu-Lin

  the Department of Electrical Engineering, National Cheng Kung University

• WU Shao-Wei

  the Department of Electrical Engineering, National Cheng Kung University

• Chr Ching-lung

  Department Of Electrical Engineering National Cheng Kung University:department Of Aviation And Commu

関連論文

• Mobile Location Estimation in Wireless Communication Systems
• Hybrid TOA/AOA Geometrical Positioning Schemes for Mobile Location
• Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme(Coding Theory)
• A Simple Step-by-Step Decoding of Binary BCH Codes(Coding Theory)
• A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes(Coding Theory)

スポンサーリンク