Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels

T. M. Duman, E. Kurtas

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

Abstract

In this paper, we study the problem of turbo coding for magnetic recording channels from a theoretical perspective. In particular we assume that the magnetic recording channel is modeled as a Lorentzian channel, and we develop performance bounds on the bit error probability of turbo codes (parallel or serial) with maximum likelihood decoding. The bound is also applicable to any (uniformly interleaved) binary linear code. This work is an extension of our recent work on performance bounds for partial response channels. The use of the bound is illustrated via some numerical examples, and comparisons based on the simulation results are provided.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages2194-2198
Number of pages5
Volume7
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

Turbo codes
Magnetic recording
Maximum likelihood
Decoding
Error probability

ASJC Scopus subject areas

  • Media Technology

Cite this

Duman, T. M., & Kurtas, E. (2001). Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. In IEEE International Conference on Communications (Vol. 7, pp. 2194-2198)

Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. / Duman, T. M.; Kurtas, E.

IEEE International Conference on Communications. Vol. 7 2001. p. 2194-2198.

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

Duman, TM & Kurtas, E 2001, Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. in IEEE International Conference on Communications. vol. 7, pp. 2194-2198, International Conference on Communications (ICC2001), Helsinki, Finland, 6/11/00.
Duman TM, Kurtas E. Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. In IEEE International Conference on Communications. Vol. 7. 2001. p. 2194-2198
Duman, T. M. ; Kurtas, E. / Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. IEEE International Conference on Communications. Vol. 7 2001. pp. 2194-2198
@inproceedings{5bbb9d067643495d8de94ef84ac2e527,
title = "Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels",
abstract = "In this paper, we study the problem of turbo coding for magnetic recording channels from a theoretical perspective. In particular we assume that the magnetic recording channel is modeled as a Lorentzian channel, and we develop performance bounds on the bit error probability of turbo codes (parallel or serial) with maximum likelihood decoding. The bound is also applicable to any (uniformly interleaved) binary linear code. This work is an extension of our recent work on performance bounds for partial response channels. The use of the bound is illustrated via some numerical examples, and comparisons based on the simulation results are provided.",
author = "Duman, {T. M.} and E. Kurtas",
year = "2001",
language = "English (US)",
volume = "7",
pages = "2194--2198",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels

AU - Duman, T. M.

AU - Kurtas, E.

PY - 2001

Y1 - 2001

N2 - In this paper, we study the problem of turbo coding for magnetic recording channels from a theoretical perspective. In particular we assume that the magnetic recording channel is modeled as a Lorentzian channel, and we develop performance bounds on the bit error probability of turbo codes (parallel or serial) with maximum likelihood decoding. The bound is also applicable to any (uniformly interleaved) binary linear code. This work is an extension of our recent work on performance bounds for partial response channels. The use of the bound is illustrated via some numerical examples, and comparisons based on the simulation results are provided.

AB - In this paper, we study the problem of turbo coding for magnetic recording channels from a theoretical perspective. In particular we assume that the magnetic recording channel is modeled as a Lorentzian channel, and we develop performance bounds on the bit error probability of turbo codes (parallel or serial) with maximum likelihood decoding. The bound is also applicable to any (uniformly interleaved) binary linear code. This work is an extension of our recent work on performance bounds for partial response channels. The use of the bound is illustrated via some numerical examples, and comparisons based on the simulation results are provided.

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

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

M3 - Conference contribution

VL - 7

SP - 2194

EP - 2198

BT - IEEE International Conference on Communications

ER -