SURVEY OF LINEAR BLOCK ESTIMATION ALGORITHMS FOR THE DETECTION OF SPREAD-SPECTRUM SIGNALS TRANSMITTED OVER FREQUENCY-SELECTIVE CHANNELS

Citation
Pw. Baier et al., SURVEY OF LINEAR BLOCK ESTIMATION ALGORITHMS FOR THE DETECTION OF SPREAD-SPECTRUM SIGNALS TRANSMITTED OVER FREQUENCY-SELECTIVE CHANNELS, IEICE transactions on communications, E76B(8), 1993, pp. 825-834
Citations number
NO
Categorie Soggetti
Engineering, Eletrical & Electronic",Telecommunications
ISSN journal
09168516
Volume
E76B
Issue
8
Year of publication
1993
Pages
825 - 834
Database
ISI
SICI code
0916-8516(1993)E76B:8<825:SOLBEA>2.0.ZU;2-2
Abstract
The well known optimum approach to detect spread spectrum signals tran smitted in bursts over frequency selective radio channels is matched f iltering, which performs despreading, and subsequent Viterbi equalizat ion (VE) to cope with intersymbol interference (ISI). With respect to complexity, VE is feasible only if data modulation schemes with a few symbol levels as e.g. 2PSK are used and if the delay spread of the cha nnel is not too large. The paper gives a survey of suboptimum data det ectors based on linear block estimation. Such data detectors are less expensive than VE especially in the case of multilevel data modulation schemes as 4PSK or 16QAM. Special emphasis is laid on data detectors based on Gauss-Markoff estimation because these detectors combine the advantages of unbiasedness and minimum variance of the estimate. In co mputer simulations, the Gauss-Markoff estimation algorithm is applied to spread spectrum burst transmission over radio channels specified by COST 207. It is shown that the SNR degradation which is a measure of the suboptimality of the detector does not exceed a few dB, and that e ven moderate spectrum spreading considerably reduces the detrimental e ffect of channel frequency selectivity.