The union bound for turbo-coded modulation systems over fading channels

Tolga M. Duman; Masoud Salehi

doi:10.1109/26.795818

The union bound for turbo-coded modulation systems over fading channels

Tolga M. Duman, Masoud Salehi

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

We derive performance bounds for turbo-coded modulation systems over fading channels. We consider a Ricean fading channel model both with and without channel-state information (CSI). This model obviously includes Rayleigh fading channel as a special case. The bounds are extensions of similar bounds derived for additive white Gaussian noise channels. For the special case of a Rayleigh fading channel with CSI, we also derive a tighter version of the bound. We illustrate the use of the new bounds via some numerical examples.

Original language	English (US)
Pages (from-to)	1495-1502
Number of pages	8
Journal	IEEE Transactions on Communications
Volume	47
Issue number	10
DOIs	https://doi.org/10.1109/26.795818
State	Published - Oct 1999
Externally published	Yes

Keywords

Error probability bounds
Fading channels
Parallel concatenated codes
Turbo-coded modulation
Turbo-codes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/26.795818

Cite this

@article{6b16d45be1aa4b7a85a338b70114851b,

title = "The union bound for turbo-coded modulation systems over fading channels",

abstract = "We derive performance bounds for turbo-coded modulation systems over fading channels. We consider a Ricean fading channel model both with and without channel-state information (CSI). This model obviously includes Rayleigh fading channel as a special case. The bounds are extensions of similar bounds derived for additive white Gaussian noise channels. For the special case of a Rayleigh fading channel with CSI, we also derive a tighter version of the bound. We illustrate the use of the new bounds via some numerical examples.",

keywords = "Error probability bounds, Fading channels, Parallel concatenated codes, Turbo-coded modulation, Turbo-codes",

author = "Duman, {Tolga M.} and Masoud Salehi",

note = "Funding Information: Paper approved by M. Fossorier, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received May 20, 1998; revised January 28, 1999. This research was supported in part by a grant from GTE Government Systems.",

year = "1999",

month = oct,

doi = "10.1109/26.795818",

language = "English (US)",

volume = "47",

pages = "1495--1502",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - The union bound for turbo-coded modulation systems over fading channels

AU - Duman, Tolga M.

AU - Salehi, Masoud

N1 - Funding Information: Paper approved by M. Fossorier, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received May 20, 1998; revised January 28, 1999. This research was supported in part by a grant from GTE Government Systems.

PY - 1999/10

Y1 - 1999/10

N2 - We derive performance bounds for turbo-coded modulation systems over fading channels. We consider a Ricean fading channel model both with and without channel-state information (CSI). This model obviously includes Rayleigh fading channel as a special case. The bounds are extensions of similar bounds derived for additive white Gaussian noise channels. For the special case of a Rayleigh fading channel with CSI, we also derive a tighter version of the bound. We illustrate the use of the new bounds via some numerical examples.

AB - We derive performance bounds for turbo-coded modulation systems over fading channels. We consider a Ricean fading channel model both with and without channel-state information (CSI). This model obviously includes Rayleigh fading channel as a special case. The bounds are extensions of similar bounds derived for additive white Gaussian noise channels. For the special case of a Rayleigh fading channel with CSI, we also derive a tighter version of the bound. We illustrate the use of the new bounds via some numerical examples.

KW - Error probability bounds

KW - Fading channels

KW - Parallel concatenated codes

KW - Turbo-coded modulation

KW - Turbo-codes

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

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

U2 - 10.1109/26.795818

DO - 10.1109/26.795818

M3 - Article

AN - SCOPUS:0033316878

SN - 0090-6778

VL - 47

SP - 1495

EP - 1502

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 10

ER -

The union bound for turbo-coded modulation systems over fading channels

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this