Optimized simple bounds for diversity systems

  • Authors:

  • Andrea Conti;Wesley M. Gifford;Moe Z. Win;Marco Chiani

  • Affiliations:

  • ENDIF, University of Ferrara and WiLAB, University of Bologna, Italy;DEIS, WiLAB, University of Bologna, Italy;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Diversity techniques play a key role in modern wireless systems, whose design benefits from a clear understanding of how these techniques affect system performance. To this aim we propose a simple class of bounds, whose parameters are optimized, on the symbol error probability (SEP) for detection of arbitrary two-dimensional signaling constellations with diversity in the presence of non-ideal channel estimation. Unlike known bounds, the optimized simple bounds are tight for all signal-to-noise ratios (SNRs) of interest. In addition, these bounds are easily invertible, which enables us to obtain bounds on the symbol error outage (SEO) and SNR penalty. As example applications for digital mobile radio, we consider the SEO in log-normal shadowing and the SNR penalty for both maximal ratio diversity, in the case of unequal branch power profile, and subset diversity, in the case of equal branch power profile, with non-ideal channel estimation. The reported lower and upper bounds are extremely tight, that is, within a fraction of a dB from each other.