Please use this identifier to cite or link to this item: https://doi.org/10.1109/18.737515
Title: Random sequence multisets for synchronous code-division multiple-access channels
Authors: Grant, A.J.
Alexander, P.D. 
Keywords: Code-division multiple-access channels
Multiaccess
Random sequences
Sum capacity
Issue Date: 1998
Citation: Grant, A.J., Alexander, P.D. (1998). Random sequence multisets for synchronous code-division multiple-access channels. IEEE Transactions on Information Theory 44 (7) : 2832-2836. ScholarBank@NUS Repository. https://doi.org/10.1109/18.737515
Abstract: 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. © 1998 IEEE.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/112288
ISSN: 00189448
DOI: 10.1109/18.737515
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.