An Upper Bound on the BER of Block Coded Hierarchical Constellations

Pavan K. Vitthaladevuni*, Mohamed Slim Alouini

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish (US)
Title of host publicationIEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings
EditorsF. Gebali
Pages950-953
Number of pages4
VolumeII
StatePublished - 2003
Externally publishedYes
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: Aug 28 2003Aug 30 2003

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period08/28/0308/30/03

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'An Upper Bound on the BER of Block Coded Hierarchical Constellations'. Together they form a unique fingerprint.

Cite this