Random sequence multisets for synchronous code-division multiple-access channels

被引:62
作者
Grant, AJ [1 ]
Alexander, PD
机构
[1] Univ S Australia, Inst Telecommun Res, Pooraka 5095, Australia
[2] Ctr Wireless Commun, Singapore 117674, Singapore
关键词
code-division multiple-access channels; multi-access; random sequences; sum capacity;
D O I
10.1109/18.737515
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The effect of using randomly selected sequence multisets for the uplink of a synchronous code-division multiple-access channel is considered. A tight lower bound on the expected value of the sum capacity over the ensemble of randomly selected sequence multisets is given. For large systems, the sum rate penalty for using randomly selected multisets is shown to be at most 1 nat and to vanish as the number of users becomes large, compared to the sequence length.
引用
收藏
页码:2832 / 2836
页数:5
相关论文
共 15 条
[1]  
[Anonymous], 1986, CONT MATH
[2]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[3]  
Gradshteyn I.S., 1980, Table of Integrals, Series, and Products
[4]  
GRANT AJ, 1995, 6 INT S PERS IND MOB, V3, P1331
[5]   THE CAPACITY REGION OF THE TOTALLY ASYNCHRONOUS MULTIPLE-ACCESS CHANNEL [J].
HUI, JYN ;
HUMBLET, PA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (02) :207-216
[7]  
Poltyrev G. S., 1983, PROBL PEREDACHI INF, V19, P12
[8]   OPTIMUM SEQUENCE MULTISETS FOR SYNCHRONOUS CODE-DIVISION MULTIPLE-ACCESS CHANNELS [J].
RUPF, M ;
MASSEY, JL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) :1261-1266
[9]   ON THE EMPIRICAL DISTRIBUTION OF EIGENVALUES OF A CLASS OF LARGE DIMENSIONAL RANDOM MATRICES [J].
SILVERSTEIN, JW ;
BAI, ZD .
JOURNAL OF MULTIVARIATE ANALYSIS, 1995, 54 (02) :175-192
[10]  
TSE D, 1997, 1997 ALL C COMM CONT