Matthias Brehler

Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-time receivers

A general, asymptotic (high signal-to-noise (SNR)) error analysis is introduced for quadratic receivers in frequency-flat and multipath Rayleigh-fading channels with multiple transmit and receive antennas. Asymptotically tight expressions for the pairwise error probabilities are obtained for coherent, noncoherent, and differentially coherent space-time receivers. Not only is our unified analysis applicable to more general modulation schemes and/or channel models than previously considered, but it also reveals a hitherto unrecognized eigenvalue structure that is common to all of these problems. In addition to providing an easy recipe for computing the asymptotic pairwise error rates, we make some conclusions regarding criteria for the design of signal constellations and codes such as (a) the same design criteria apply for both correlated and independent and identically distributed (i.i.d.) fading processes and (b) for noncoherent communications, unitary signals are optimal in the sense that they minimize the asymptotic union bound.

Signal design and convolutional coding for noncoherent space-time communication on the block-Rayleigh-fading channel

We consider the problem of designing signal constellations for the multiple transmit-multiple receive antenna Rayleigh-fading communication channel, when neither the transmitter nor the receiver know the fading. In particular, by employing the asymptotic union bound (AUB) on the probability of error, we give a new formulation of the problem of signal design for the noncoherent fading channel. Since unitary signals are optimal for this channel (in the limit of large signal-to-noise ratios SNRs), the problem can be posed in terms of packings on the Grassmanian manifold. A key difference in our approach from that of other authors is that we use a notion of distance on this manifold that is suggested by the union bound. As a consequence of our use of this distance measure, we obtain signal designs that are guaranteed to achieve the full diversity order of the channel, a result that does not hold when the chordal distance is used. We introduce a new method of recursively designing signals, termed successive updates, to approximately optimize this performance measure. We then examine the use of our signals with several convolutional codes over the fading channel. An upper bound on the bit error probability of the maximum-likelihood decoder is presented together with an asymptotic analysis of that bound.