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

Authors:
Ching-Lung Chr;Szu-Lin Su;Shao-Wei Wu
Affiliations:
The authors are with the Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan, R.O.C. E-mail: pipn@ms45.hinet.net,;The authors are with the Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan, R.O.C. E-mail: pipn@ms45.hinet.net,;The authors are with the Department of Electrical Engineering, National Cheng Kung University, Tainan 701, Taiwan, R.O.C. E-mail: pipn@ms45.hinet.net,
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 2

High-speed low-complexity Golay decoder based on syndrome-weight determination

ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A fast parallel (23, 12, 7) QR decoder based on syndrome-weight determination

Computers and Electrical Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.