DocumentCode
1205910
Title
Optimum sequence multisets for synchronous code-division multiple-access channels
Author
Rupf, Marcel ; Massey, James L.
Volume
40
Issue
4
fYear
1994
fDate
7/1/1994 12:00:00 AM
Firstpage
1261
Lastpage
1266
Abstract
It is shown that the sum capacity of the symbol-synchronous code-division multiple-access channel with equal average-input-energy constraints is maximized precisely by those spreading sequence multisets that meet Welch´s lower bound on total squared correlation. It is further shown that the symmetric capacity of the channel determined by these same sequence multisets is equal to the sum capacity
Keywords
channel capacity; code division multiple access; codes; optimisation; Welch´s lower bound; equal average-input-energy constraints; optimum sequence multisets; spreading sequence multisets; sum capacity; symmetric capacity; synchronous code-division multiple-access channels; total squared correlation; Autocorrelation; Computer science; Continuous wavelet transforms; Equations; Gold; Multiaccess communication; Polynomials; Random sequences; Space technology; Spread spectrum communication;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.335940
Filename
335940
Link To Document