Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme(Coding Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme.

• 社団法人電子情報通信学会の論文
• 2006-08-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

  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

  Department of Electrical Engineering, National Cheng Kung University

• Chr Ching-lung

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

関連論文

• Acquisition Performance of PN Synchronization Loop for DS-SS Signals with Doppler Shift (Special Section on Spread Spectrum Techniques and Applications)
• 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)

スポンサーリンク