Performance bounds for space-time trellis codes

A. Stefanov, T. M. Duman

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

12 Scopus citations

Abstract

We derive performance bounds for space-time trellis codes over quasi-static fading channels. We describe a technique for obtaining a tight bound on the error probability which is based on expurgation of the union bound and limitation of the conditional union bound before averaging over the fading statistics.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages82
Number of pages1
StatePublished - 2001
Event2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States
Duration: Jun 24 2001Jun 29 2001

Other

Other2001 IEEE International Symposium on Information Theory (ISIT 2001)
CountryUnited States
CityWashington, DC
Period6/24/016/29/01

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Performance bounds for space-time trellis codes'. Together they form a unique fingerprint.

  • Cite this

    Stefanov, A., & Duman, T. M. (2001). Performance bounds for space-time trellis codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 82)