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

Rathnakumar Radhakrishnan, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
DOIs
StatePublished - 2009
Event2009 IEEE International Conference on Communications, ICC 2009 - Dresden, Germany
Duration: Jun 14 2009Jun 18 2009

Other

Other2009 IEEE International Conference on Communications, ICC 2009
CountryGermany
CityDresden
Period6/14/096/18/09

Fingerprint

Message passing
Equalizers
Decoding
Computational complexity
Detectors

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels. / Radhakrishnan, Rathnakumar; Vasic, Bane V.

IEEE International Conference on Communications. 2009. 5199115.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Radhakrishnan, R & Vasic, BV 2009, Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels. in IEEE International Conference on Communications., 5199115, 2009 IEEE International Conference on Communications, ICC 2009, Dresden, Germany, 6/14/09. https://doi.org/10.1109/ICC.2009.5199115
Radhakrishnan, Rathnakumar ; Vasic, Bane V. / Joint message-passing symbol-decoding of LDPC coded signals over partial-response channels. IEEE International Conference on Communications. 2009.
@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 Vasic, {Bane V}",
year = "2009",
doi = "10.1109/ICC.2009.5199115",
language = "English (US)",
isbn = "9781424434350",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

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

AU - Radhakrishnan, Rathnakumar

AU - Vasic, Bane V

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

BT - IEEE International Conference on Communications

ER -