Performance of some block codes on a Gaussian channel
Abstract
A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.
- Publication:
-
International Telemetering Conference
- Pub Date:
- 1975
- Bibcode:
- 1975isa..conf..189B
- Keywords:
-
- Bch Codes;
- Binary Codes;
- Channels (Data Transmission);
- Decoding;
- Error Correcting Codes;
- Information Theory;
- Algorithms;
- Maximum Likelihood Estimates;
- Performance Prediction;
- Redundancy Encoding;
- Signal Encoding;
- Signal To Noise Ratios;
- Transmission Efficiency;
- Viterbi Decoders;
- Communications and Radar