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

Authors:
Ming-Haw Jing;Yih-Ching Su;Jian-Hong Chen;Zih-Heng Chen;Yaotsu Chang
Affiliations:
Dept. of Information Engineering, I-Shou University, Kaohsiung, Taiwan, R.O.C.;Dept. of Information Engineering, I-Shou University, Kaohsiung, Taiwan, R.O.C.;Dept. of Information Engineering, I-Shou University, Kaohsiung, Taiwan, R.O.C.;Dept. of Information Engineering, I-Shou University, Kaohsiung, Taiwan, R.O.C.;Dept. of Applied Mathematics, I-Shou University, Kaohsiung, Taiwan, R.O.C.
Venue:
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Year:
2009

Citing 2
Cited 0

Algebraic decoding of the (23,12,7) Golay code

IEEE Transactions on Information Theory
Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a very high-throughput and area efficient hardware decoder of the binary (23, 12, 7) Golay code is presented. The key feature of this proposed algorithm is fast determination of the error positions through the analysis on the weight of syndromes without large operations of finite fields. Comparing with the algorithm using one syndrome, the proposed algorithm is more suitable for the parallel hardware design by using two syndromes. For some common FPGA technology the complete system occupies only 666 logic elements and the time delay is 25.9 ns; for a 0.18-µm CMOS technology the result is a 0.026 mm2 area and a 2.58 Gbps throughput.