An upper bound on the BER of block coded hierarchical constellations

P.K. Vitthaladevuni; M.-S. Alouini

doi:10.1109/PACRIM.2003.1235941

Back

Conference proceeding

An upper bound on the BER of block coded hierarchical constellations

P.K. Vitthaladevuni and M.-S. Alouini

2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490), Vol.2, pp.950-953 vol.2

2003

DOI: https://doi.org/10.1109/PACRIM.2003.1235941

Abstract

AWGN

Bit error rate

Block codes

Channel coding

Decoding

Error correction codes

Error probability

Modulation coding

Redundancy

Upper bound

In this paper a simple upper bound for block coded hierarchical modulations is presented. Our new bound gives much tighter results compared to the classical union-Chernoff bound.

Metrics

1 Record Views

Details

Title: An upper bound on the BER of block coded hierarchical constellations
Creators - without role: P.K. Vitthaladevuni - Dept. of Electr. & Comput. Eng., Minnesota Univ., USA
M.-S. Alouini - Dept. of Electr. & Comput. Eng., Minnesota Univ., USA
Publication Details: 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490), Vol.2, pp.950-953 vol.2
Publisher: IEEE
Identifiers: 9941053208331
Academic Unit: King Abdullah University of Science & Technology
Language: English
Resource Type: Conference proceeding