An Upper Bound on the BER of Block Coded Hierarchical Constellations

Pavan K. Vitthaladevuni; Mohamed Slim Alouini

An Upper Bound on the BER of Block Coded Hierarchical Constellations

Pavan K. Vitthaladevuni^*, Mohamed Slim Alouini

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

A simple upper bound for block coded hierarchical modulations was presented. Numerical examples showed that the new upper-bound was much tighter than the classical union-Chernoff bound and was close to the exact results obtained by Monte-Carlo simulations. Equal error protection was possible only for a particular range of carrier-to-noise ratio values and the results could be easily extended to flat fading case.

Original language	English (US)
Pages	950-953
Number of pages	4
State	Published - 2003
Externally published	Yes
Event	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada Duration: Aug 28 2003 → Aug 30 2003

Other

Other	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
Country/Territory	Canada
City	Victoria, B.C.
Period	08/28/03 → 08/30/03

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Cite this

@conference{0cb2106b4d00417c9028dd1220a10f55,

title = "An Upper Bound on the BER of Block Coded Hierarchical Constellations",

abstract = "A simple upper bound for block coded hierarchical modulations was presented. Numerical examples showed that the new upper-bound was much tighter than the classical union-Chernoff bound and was close to the exact results obtained by Monte-Carlo simulations. Equal error protection was possible only for a particular range of carrier-to-noise ratio values and the results could be easily extended to flat fading case.",

author = "Vitthaladevuni, {Pavan K.} and Alouini, {Mohamed Slim}",

year = "2003",

language = "English (US)",

pages = "950--953",

note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

TY - CONF

T1 - An Upper Bound on the BER of Block Coded Hierarchical Constellations

AU - Vitthaladevuni, Pavan K.

AU - Alouini, Mohamed Slim

PY - 2003

Y1 - 2003

N2 - A simple upper bound for block coded hierarchical modulations was presented. Numerical examples showed that the new upper-bound was much tighter than the classical union-Chernoff bound and was close to the exact results obtained by Monte-Carlo simulations. Equal error protection was possible only for a particular range of carrier-to-noise ratio values and the results could be easily extended to flat fading case.

AB - A simple upper bound for block coded hierarchical modulations was presented. Numerical examples showed that the new upper-bound was much tighter than the classical union-Chernoff bound and was close to the exact results obtained by Monte-Carlo simulations. Equal error protection was possible only for a particular range of carrier-to-noise ratio values and the results could be easily extended to flat fading case.

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

M3 - Paper

AN - SCOPUS:0142230878

SP - 950

EP - 953

T2 - 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)

Y2 - 28 August 2003 through 30 August 2003

ER -

An Upper Bound on the BER of Block Coded Hierarchical Constellations

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this