A graph based construction of high-rate soft decodable codes for partial response channels

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

6 Citations (Scopus)

Abstract

In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages2716-2720
Number of pages5
Volume9
StatePublished - 2001
EventInternational Conference on Communications (ICC2001) - Helsinki, Finland
Duration: Jun 11 2000Jun 14 2000

Other

OtherInternational Conference on Communications (ICC2001)
CountryFinland
CityHelsinki
Period6/11/006/14/00

Fingerprint

Directed graphs
Maximum likelihood
Decoding

ASJC Scopus subject areas

  • Media Technology

Cite this

Vasic, B. V. (2001). A graph based construction of high-rate soft decodable codes for partial response channels. In IEEE International Conference on Communications (Vol. 9, pp. 2716-2720)

A graph based construction of high-rate soft decodable codes for partial response channels. / Vasic, Bane V.

IEEE International Conference on Communications. Vol. 9 2001. p. 2716-2720.

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

Vasic, BV 2001, A graph based construction of high-rate soft decodable codes for partial response channels. in IEEE International Conference on Communications. vol. 9, pp. 2716-2720, International Conference on Communications (ICC2001), Helsinki, Finland, 6/11/00.
Vasic BV. A graph based construction of high-rate soft decodable codes for partial response channels. In IEEE International Conference on Communications. Vol. 9. 2001. p. 2716-2720
Vasic, Bane V. / A graph based construction of high-rate soft decodable codes for partial response channels. IEEE International Conference on Communications. Vol. 9 2001. pp. 2716-2720
@inproceedings{e3dc52dab3484472b3e141d6487e8df4,
title = "A graph based construction of high-rate soft decodable codes for partial response channels",
abstract = "In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.",
author = "Vasic, {Bane V}",
year = "2001",
language = "English (US)",
volume = "9",
pages = "2716--2720",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - A graph based construction of high-rate soft decodable codes for partial response channels

AU - Vasic, Bane V

PY - 2001

Y1 - 2001

N2 - In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.

AB - In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.

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

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

M3 - Conference contribution

VL - 9

SP - 2716

EP - 2720

BT - IEEE International Conference on Communications

ER -