Please use this identifier to cite or link to this item:
|Title:||Optimal detection of digital data over the nonselective Rayleigh fading channel with diversity reception||Authors:||Kam, Pooi Yuen||Issue Date:||Feb-1991||Citation:||Kam, Pooi Yuen (1991-02). Optimal detection of digital data over the nonselective Rayleigh fading channel with diversity reception. IEEE Transactions on Communications 39 (2) : 214-219. ScholarBank@NUS Repository.||Abstract:||Based on the criterion of minimum symbol error probability, an analysis is made of symbol-by-symbol detection of a sequence of digital data transmitted using linear suppressed-carrier modulation over L independent diversity channels with AWGN (additive white Gaussian noise) and slow nonselective Rayleigh fading. The optimal receiver is derived, but is found to be difficult to implement in practice because of its exponential growth in complexity as a function of sequence length. Suboptimal decision-feedback approximations are then suggested which are linear and readily implementable and can be integrated as generalized differentially coherent receivers. The exact bit error probabilities of these suboptimal receivers are obtained. Tight upper bounds on these error probabilities are also obtained which show simply how they behave as a function of signal-to-noise ratio and order of diversity. A main conclusion of this work is that optimal data detection on a fading channel should be performed using MMSE (minimum mean squared error) estimates of the quadrature amplitudes of the channel fading processes as a coherent reference. Conventional receivers employing carrier loops to provide the coherent reference are not optimal and lead to more complicated receiver structures.||Source Title:||IEEE Transactions on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/80906||ISSN:||00961965|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.