COMPUTATIONAL-COMPLEXITY OF OPTIMUM MULTIUSER DETECTION

被引:208
作者
VERDU, S
机构
关键词
D O I
10.1007/BF01553893
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:303 / 312
页数:10
相关论文
共 14 条
[1]  
BITERBI AJ, 1979, PRINCIPLES DIGITAL C
[2]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[3]   REDUCED STATE VARIANT OF MAXIMUM LIKELIHOOD SEQUENCE DETECTION ATTAINING OPTIMUM PERFORMANCE FOR HIGH SIGNAL-TO-NOISE RATIOS [J].
FOSCHINI, GJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (05) :605-609
[4]  
Garey M. R., 1979, COMPUTERS INTRACTABI
[5]   COMPUTATIONAL SAVINGS AND IMPLEMENTATION OF MAXIMUM LIKELIHOOD DETECTORS [J].
KAZAKOS, D .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :124-126
[6]   LINEAR MULTIUSER DETECTORS FOR SYNCHRONOUS CODE-DIVISION MULTIPLE-ACCESS CHANNELS [J].
LUPAS, R ;
VERDU, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) :123-136
[7]  
Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI
[8]   OPTIMUM DETECTION OF CODE DIVISION MULTIPLEXED SIGNALS [J].
SCHNEIDER, KS .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1979, 15 (01) :181-185
[9]  
SIMON MK, 1985, SPREAD SPECTRUM COMM, V3
[10]   OPTIMUM MULTIUSER ASYMPTOTIC EFFICIENCY [J].
VERDU, S .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (09) :890-897