Optimal sequences and sum capacity of synchronous CDMA systems

Pramod Viswanath; Venkat Anantharam

doi:10.1109/18.782121

Optimal sequences and sum capacity of synchronous CDMA systems

Pramod Viswanath, Venkat Anantharam

Research output: Contribution to journal › Article › peer-review

272 Scopus citations

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 in [7] 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.

Original language	English (US)
Pages (from-to)	1984-1991
Number of pages	8
Journal	IEEE Transactions on Information Theory
Volume	45
Issue number	6
DOIs	https://doi.org/10.1109/18.782121
State	Published - 1999
Externally published	Yes

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

CDMA
Capacity region
Optimal signature sequences
Sum capacity

Access to Document

10.1109/18.782121

Cite this

@article{5ba28ed4bbb1414a87f11c9609091258,

title = "Optimal sequences and sum capacity of synchronous CDMA systems",

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 in [7] 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 = "CDMA, Capacity region, Optimal signature sequences, Sum capacity",

author = "Pramod Viswanath and Venkat Anantharam",

note = "Funding Information: Manuscript received July 13, 1998; revised January 28, 1999. This work was supported by the National Science Foundation under Grants NCR 94-22513 and IRI 95-05561. The authors are with the Electrical Engineering and Computer Science Department, University of California at Berkeley, Berkeley, CA 94720 USA. Communicated by S. Shamai, Associate Editor for Shannon Theory. Publisher Item Identifier S 0018-9448(99)05879-4.",

year = "1999",

doi = "10.1109/18.782121",

language = "English (US)",

volume = "45",

pages = "1984--1991",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Optimal sequences and sum capacity of synchronous CDMA systems

AU - Viswanath, Pramod

AU - Anantharam, Venkat

N1 - Funding Information: Manuscript received July 13, 1998; revised January 28, 1999. This work was supported by the National Science Foundation under Grants NCR 94-22513 and IRI 95-05561. The authors are with the Electrical Engineering and Computer Science Department, University of California at Berkeley, Berkeley, CA 94720 USA. Communicated by S. Shamai, Associate Editor for Shannon Theory. Publisher Item Identifier S 0018-9448(99)05879-4.

PY - 1999

Y1 - 1999

N2 - 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 in [7] 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.

AB - 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 in [7] 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.

KW - CDMA

KW - Capacity region

KW - Optimal signature sequences

KW - Sum capacity

UR - http://www.scopus.com/inward/record.url?scp=0033185351&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033185351&partnerID=8YFLogxK

U2 - 10.1109/18.782121

DO - 10.1109/18.782121

M3 - Article

AN - SCOPUS:0033185351

SN - 0018-9448

VL - 45

SP - 1984

EP - 1991

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

Optimal sequences and sum capacity of synchronous CDMA systems

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this