Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Design and analysis of turbo codes on Rayleigh fading channels
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We develop an approach to compare different log-likelihood ratio (LLR) metrics for iterative soft decoding. We show that an LLR metric for a function of the received signals is a sufficient statistic to this function about the binary channel input. We also prove that when the function belongs to a set of specific mappings, the corresponding LLR metric can feed the maximal mutual information to the decoder. For decoding low density parity check codes with the belief-propagation decoder, we develop a method to estimate the minimal average number of iterations. The results are applied to compare the Gaussian metric in [1] and the two-symbol-observation-interval LLR metric in [2]. The latter is shown to be superior.