FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we introduce a class of decoding algorithms for binary Raptor codes used for transmission over q-ary channels, where q = 2m. The algorithms provide a trade-off between complexity and decoding capability. Whereas the running time of the q-ary belief-propagation algorithms is m2m times that of its binary counterpart, in our case the complexity factor can be chosen between m and 2m, depending on the error-correction capability required. As such, the running time can be much better than the q-ary belief-propagation algorithm. The main idea behind our algorithm is to apply an appropriate set of GF(2)-linear forms of GF(q) to the Raptor code to obtain a set of binary codes which can be decoded independently in parallel. After a prescribed number of iterations, for each of the input symbols of the Raptor code and each of the linear forms an estimate is obtained on the probability that this linear form applied to the input symbol is zero. By gathering these probabilities and performing a maximum-likelihood decoding on a suitable code of very small blocklength, we are able to obtain a good estimate of the value of the input symbol. Simulations results are provided for a families of q-ary symmetric channels and non-symmetric channels which show the performance of our decoding algorithms.