Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels

Authors:
Rathnakumar Radhakrishnan;Bane Vasic
Affiliations:
Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ;Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 3
Cited 0

On LDPC codes over channels with memory

IEEE Transactions on Wireless Communications
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Joint message-passing decoding of LDPC codes and partial-response channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of joint detection and decoding of low-density parity-check (LDPC) coded signals over partial response (PR) channels. A method to graphically represent the constraints imposed by the channel and the code on the channel output sequence is introduced. This enables the design of a detector and decoder that estimates a posteriori probabilities of noiseless channel output symbols rather than binary channel inputs. By running the sum-product algorithm (SPA) on this graph, a joint decoder is obtained that is shown to perform significantly better than the turbo-equalizer, at the cost of increased computational complexity.