FAST ALGORITHMS FOR DECODING THE (23,12) BINARY GOLAY CODE WITH 4-ERROR-CORRECTING CAPABILITY

Citation
Eh. Lu et al., FAST ALGORITHMS FOR DECODING THE (23,12) BINARY GOLAY CODE WITH 4-ERROR-CORRECTING CAPABILITY, International Journal of Systems Science, 26(4), 1995, pp. 937-945
Citations number
11
Categorie Soggetti
System Science","Computer Science Theory & Methods","Operatione Research & Management Science
ISSN journal
00207721
Volume
26
Issue
4
Year of publication
1995
Pages
937 - 945
Database
ISI
SICI code
0020-7721(1995)26:4<937:FAFDT(>2.0.ZU;2-W
Abstract
Two new algorithms for decoding the (23, 12) binary Golay code are dev eloped with channel measurement information. For a white gaussian nois e channel, each of the two algorithms achieves about 0.8 dB of decodin g performance over a conventional hard-decision decoding. Furthermore, one of the algorithms requires a very small amount of computation for decoding a received block, and the other is very suitable for hardwar e implementation owing to its simple and regular operation. The hardwa re decoder, based on the latter algorithm, is designed with a pipeline such that it decodes one bit of a received block in a single system c lock cycle.