High-Speed Decoding of the Binary Golay Code

 

H. P. Lee,*¹ C. H. Chang,¹ S. I. Chu²

 

¹ Department of Computer Science and Information Engineering, Fortune Institute of Technology, Kaohsiung 83160, Taiwan. *hpl@fotech.edu.tw.

² Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan.

 

ABSTRACT

Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate syndromes and its memory size is significantly smaller than other existing lookup tables. Computer software simulation results show that the decoding speed of the proposed MSDA is superior to other proposed TLDAs.

Keywords: Golay code, weight, syndrome, error pattern.

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

References

[1] M. Golay, "Notes on digital coding," Proc. IRE, vol. 37, p. 657, 1949.         [ Links ]

[2] S. Wicker, "Error Control Systems for Digital Communication and Storage", Prentice Hall: Upper Saddle River, NJ, 1995.         [ Links ]

[3] M. Elia, "Algebraic decoding of the (23, 12, 7) Golay code," IEEE Trans Inf Theory, vol. 33, no. 1, pp. 150-151, 1987.         [ Links ]

[4] I. S. Reed et al., "Decoding the (24, 12, 8) Golay code," IEE P-COMPUT DIG T, vol. 137, no. 3, pp. 202-206, 1990.         [ Links ]

[5] Y. H. Chen et al., Algebraic decoding of quadratic residue codes using Berlekamp-Massey algorithm, J Inf Sci Eng, vol. 23, no. 1, 2007, pp. 127-145.         [ Links ]

[6] H. Chang et al., "A weight method of decoding the (23, 12, 7) Golay code Using Reduced Lookup Table," 2008 International Conference On Communication, Circuits and Systems (ICCCAS 2008), Xiamen, China, 2008, pp. 1-5.         [ Links ]

[7] Y. H. Chen et al., "Efficient decoding of systematic (23, 12, 7) and (41, 21, 9) quadratic residue codes," J Inf Sci Eng, vol. 26, no. 5, pp. 1831-1843, 2010.         [ Links ]

[8] T. C. Lin et al., "On the decoding of the (24, 12, 8) Golay code," Inf Sci, vol. 180, no. 23, pp. 4729-4736, 2010.         [ Links ]

[9] T. C. Lin et al., "High speed decoding of the binary (47, 24, 11) quadratic residue code," Inf Sci, vol. 180, no. 20, pp. 4060-4068, 2010.         [ Links ]

[10] S. Lin and E. J. Jr Weldon, "Long BCH codes are bad," Inf Contr, vol. 11, no. 4, pp. 445-451, 1967.         [ Links ]

[11] S. I. Chu et al., "Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability," Eur Trans Telecomm, vol, 22, no. 7, pp. 388-395, 2011.         [ Links ]

[12] C. A. Vázquez-Fernández and G. Vega-Hernández, "On the Weight Distribution of the Dual of some Cyclic Codes with Two Non Conjugated Zeros," J Appl Res Technol, vol.9, no.1, pp. 36-48, 2011.         [ Links ]

[13] MIL-STD-188/141B. Department of Defense Interface Standard: Interoperability and Performance Standards for Medium and High Frequency Radio Systems. http://www.everyspec.com/MIL-STD/MIL-STD+(0100+-+0299)/MIL_STD_188_141B_1703.         [ Links ]

[14] I. S Reed et al., "The algebraic decoding of the (41, 21, 9) quadratic residue code," IEEE Trans Inf Theory, vol. 38, no. 3, pp. 974-986, 1992.         [ Links ]