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

Rathnakumar Radhakrishnan; Bane Vasić

doi:10.1109/ICC.2009.5199115

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

Rathnakumar Radhakrishnan, Bane Vasić

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

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.

Original language	English (US)
Title of host publication	Proceedings - 2009 IEEE International Conference on Communications, ICC 2009
DOIs	https://doi.org/10.1109/ICC.2009.5199115
State	Published - 2009
Event	2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany Duration: Jun 14 2009 → Jun 18 2009

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Other

Other	2009 IEEE International Conference on Communications, ICC 2009
Country/Territory	Germany
City	Dresden
Period	6/14/09 → 6/18/09

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.2009.5199115

Cite this

Radhakrishnan, R & Vasić, B 2009, Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels. in Proceedings - 2009 IEEE International Conference on Communications, ICC 2009., 5199115, IEEE International Conference on Communications, 2009 IEEE International Conference on Communications, ICC 2009, Dresden, Germany, 6/14/09. https://doi.org/10.1109/ICC.2009.5199115

@inproceedings{55f495f8e61b444c9122735e4d2d368c,

title = "Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels",

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.",

author = "Rathnakumar Radhakrishnan and Bane Vasi{\'c}",

year = "2009",

doi = "10.1109/ICC.2009.5199115",

language = "English (US)",

isbn = "9781424434350",

series = "IEEE International Conference on Communications",

booktitle = "Proceedings - 2009 IEEE International Conference on Communications, ICC 2009",

note = "2009 IEEE International Conference on Communications, ICC 2009 ; Conference date: 14-06-2009 Through 18-06-2009",

}

TY - GEN

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

AU - Radhakrishnan, Rathnakumar

AU - Vasić, Bane

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449490541&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449490541&partnerID=8YFLogxK

U2 - 10.1109/ICC.2009.5199115

DO - 10.1109/ICC.2009.5199115

M3 - Conference contribution

AN - SCOPUS:70449490541

SN - 9781424434350

T3 - IEEE International Conference on Communications

BT - Proceedings - 2009 IEEE International Conference on Communications, ICC 2009

T2 - 2009 IEEE International Conference on Communications, ICC 2009

Y2 - 14 June 2009 through 18 June 2009

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this