Citation
Abstract
An algorithm has been developed which optimally decodes a block code for minimum probability of symbol error in an iterative manner. The initial estimate is made by looking at each bit independently and is improved by considering bits related to it through the parity check equations. The dependent bits are considered in order of increasing probability of error. Since the computation proceeds in a systematic way with the bits having the greatest effect being used first, the algorithm approaches the optimum estimate after only a fraction of the parity check equations have been used. This decoding algorithm will be tested via simulations of the (128, 64, 22) BCH code over the deep space channel.
Details
- Volume
- 42-47
- Published
- October 15, 1978
- Pages
- 51–59
- File Size
- 749.4 KB