A FAMILY OF SUBOPTIMUM DETECTORS FOR COHERENT MULTIUSER COMMUNICATIONS

被引：458

作者：

XIE, ZH ^{[1
]}

SHORT, RT ^{[1
]}

RUSHFORTH, CK ^{[1
]}

机构：

[1] UNISYS CORP,DIV COMMUN SYST,SALT LAKE CITY,UT 84116

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 1990年 / 8卷 / 04期

关键词：

D O I：

10.1109/49.54464

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper we consider a class of suboptimum detectors for data transmitted asynchronously by K users employing direct sequence spread spectrum multiple access (DS/SSMA) on the additive white Gaussian noise (AWGN) channel. The general structure of these detectors consists of a bank of matched filters, a linear transformation that operates on the matched-filter outputs, and a set of threshold devices. The linear transformations are chosen to minimize either a mean squared error or a weighted squared error performance criterion. Each detector can be implemented using a tapped delay line. The number of computations performed per detected bit is linear in K in each case, and the resulting detectors are thus much simpler than the optimum detector. Under typical operating conditions, these detectors will perform much better than the conventional receiver and often nearly as well as the optimum detector. © 1990 IEEE

引用

页码：683 / 690

页数：8

共 13 条

[1]

GEBHARDT F, 1972, USCEE430 U SO CAL DE

[2]

Golub G.H., 1983, MATRIX COMPUTATIONS

[3] ERROR PROBABILITIES FOR BINARY DIRECT-SEQUENCE SPREAD-SPECTRUM COMMUNICATIONS WITH RANDOM SIGNATURE SEQUENCES [J].