Fast algorithms for decoding the (23, 12) binary golay code with four-error-correcting capability

Two new algorithms for decoding the (23, 12) binary Golay code are developed with channel measurement information. For a white gaussian noise channel, each of the two algorithms achieves about 0·8 dB of decoding 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 hardware implementation owing to its simple and regular operation. The hardware 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 clock cycle.