Performance of DS/SSMA communications in impulsive channels. II. Hard-limiting correlation receivers

For pt.I see ibid., vol.COM-35, no.11, p.1179-88 (1987). In part I it was demonstrated that impulsive channel noise can be a serious detriment to the performance of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications when conventional linear correlation reception is used. Here, a hard-limiting correlator as an alternative for reception of multiple-access transmission in impulsive channels is considered. For K asynchronous binary PSK DS/SSMA users sharing a linear channel corrupted by impulsive noise that is modeled at the output of the front-end filter of the receiver, techniques are developed for analyzing bit error probabilities of this hard-limiting receiver by exact computation for short spreading sequences, by approximation for longer spreading sequences, and by asymptotic limits for infinitely long spreading sequences. Performance is compared to that of the linear correlator under a variety of conditions, showing that hard-limiting correlation reception can offer substantial improvement over conventional systems in impulsive channels. However, the linear receiver is more effective against multiple-access noise only, and so a tradeoff emerges between rejection of impulsive noise and rejection of multiple-access interference. >

[1]  G. E. Noether,et al.  ON A THEOREM OF PITMAN , 1955 .

[2]  T. Koizumi,et al.  The Effect of Non-Gaussian Noise on the Performance of Binary CPSK System , 1978, IEEE Trans. Commun..

[3]  James W. Modestino,et al.  Detection of weak signals in narrowband non-Gaussian noise , 1979, IEEE Trans. Inf. Theory.

[4]  A. F. Smith,et al.  Statistical analysis of finite mixture distributions , 1986 .

[5]  John B. Thomas,et al.  Detectors for discrete-time signals in non-Gaussian noise , 1972, IEEE Trans. Inf. Theory.

[6]  Audrey E. Taub,et al.  Calculating binomial probabilities when the trial probabilities are unequal , 1982 .

[7]  Richard S. Orr,et al.  Aperiodic correlation constraints on large binary sequence sets , 1975, IEEE Trans. Inf. Theory.

[8]  D. Middleton,et al.  Optimum Reception in an Impulsive Interference Environment - Part II: Incoherent Reception , 1977, IEEE Transactions on Communications.

[9]  Behnaam Aazhang Performance of Ds/ssma Communications in Impulsive Channels (Nongaussian, Hard Limiter) , 1986 .

[10]  E. A. Geraniotis,et al.  Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications - Part II: Approximations , 1982, IEEE Transactions on Communications.

[11]  H. Vincent Poor,et al.  On Optimum and Nearly Optimum Data Quantization for Signal Detection , 1984, IEEE Trans. Commun..

[12]  Michael B. Pursley Spread-Spectrum Multiple-Access Communications , 1981 .

[13]  Robert Lugannani Intersymbol interference and probability of error in digital systems , 1969, IEEE Trans. Inf. Theory.

[14]  Kenneth S. Vastola,et al.  Threshold Detection in Narrow-Band Non-Gaussian Noise , 1984, IEEE Trans. Commun..

[15]  M. Pursley,et al.  Numerical Evaluation of Correlation Parameters for Optimal Phases of Binary Shift-Register Sequences , 1979, IEEE Trans. Commun..

[16]  D. Anderson,et al.  Analysis of a Spread-Spectrum Multiple-Access System with a Hard Limiter , 1969 .

[17]  Arthur D. Spaulding Locally Optimum and Suboptimum Detector Performance in a Non-Gaussian Interference Environment , 1985, IEEE Trans. Commun..

[18]  H. Vincent Poor,et al.  A Relative Efficiency study of Some Popular Detectors , 1982 .

[19]  Kenneth S Vastola Threshold detection in narrowband non-Gaussian noise , 1983 .

[20]  Burton R. Saltzberg,et al.  Intersymbol interference error bounds with application to ideal bandlimited signaling , 1968, IEEE Trans. Inf. Theory.

[21]  Jack Capon,et al.  On the asmptotic efficiency of locally optimum detectors , 1961, IRE Trans. Inf. Theory.

[22]  D. V. Sarwate,et al.  Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications - Part I: Upper and Lower Bounds , 1982, IEEE Transactions on Communications.