(cache)A Laguerre polynomial-based bound on the symbol error probability for adaptive antennas with optimum combining | IEEE Journals & Magazine | IEEE Xplore

A Laguerre polynomial-based bound on the symbol error probability for adaptive antennas with optimum combining


Abstract:

We derive a simple closed-form upper bound on the symbol error probability for coherent detection of M-ary phase-shift keying using antenna arrays with optimum combining,...Show More

Abstract:

We derive a simple closed-form upper bound on the symbol error probability for coherent detection of M-ary phase-shift keying using antenna arrays with optimum combining, in the presence of multiple uncorrelated equal-power cochannel interferers and thermal noise in a Rayleigh fading environment. The new bound, based on Laguerre polynomials, is valid for an arbitrary number of antenna elements as well as arbitrary number of interferers, and it is proven to be asymptotically tight. Comparisons with Monte Carlo simulation are also provided, showing that our bound is useful in many cases of interest.
Published in: IEEE Transactions on Wireless Communications ( Volume: 3, Issue: 1, January 2004)
Page(s): 12 - 16
Date of Publication: 31 January 2004

ISSN Information:


I. Introduction

Adaptive antennas can significantly improve the performance of wireless communication systems by suitably combining the received signals to reduce fading effects and suppress interference. In particular, with optimum combining (OC), the received signals are weighted and combined to maximize the output signal-to-interference-plus-noise power ratio (SINR). This technique provides substantial improvement in performance over maximal ratio combining (MRC), where the received signals are combined to maximize the desired signal-to-noise ratio (SNR) only, when interference is present.

Contact IEEE to Subscribe

References

References is not available for this document.