DocumentCode :
1537920
Title :
Optimal sequences and sum capacity of synchronous CDMA systems
Author :
Viswanath, Pramod ; Anantharam, Venkat
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume :
45
Issue :
6
fYear :
1999
fDate :
9/1/1999 12:00:00 AM
Firstpage :
1984
Lastpage :
1991
Abstract :
The sum capacity of a multiuser synchronous CDMA system is completely characterized in the general case of asymmetric user power constraints-this solves the open problem posed by Rupf and Massey (see ibid., vol.40, p.1261-6, 1994) which had solved the equal power constraint case. We identify the signature sequences with real components that achieve sum capacity and indicate a simple recursive algorithm to construct them
Keywords :
AWGN; channel capacity; code division multiple access; multiuser channels; optimisation; sequences; spread spectrum communication; AWGN; asymmetric user power constraints; channel model; equal power constraint; multiuser synchronous CDMA system; optimal sequences; real components; recursive algorithm; signature sequences; sum capacity; Additive white noise; Bandwidth; Code division multiplexing; Constraint optimization; Design optimization; Information rates; Multiaccess communication; Power system reliability; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.782121
Filename :
782121
Link To Document :
بازگشت