Optimal sequences and sum capacity of synchronous CDMA systems

Pramod Viswanath, Venkat Anantharam

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)1984-1991
Number of pages8
JournalIEEE Transactions on Information Theory
Volume45
Issue number6
DOIs
StatePublished - Dec 1 1999

Fingerprint

Code division multiple access

Keywords

  • CDMA
  • Capacity region
  • Optimal signature sequences
  • Sum capacity

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Optimal sequences and sum capacity of synchronous CDMA systems. / Viswanath, Pramod; Anantharam, Venkat.

In: IEEE Transactions on Information Theory, Vol. 45, No. 6, 01.12.1999, p. 1984-1991.

Research output: Contribution to journalArticle

@article{8436eb82982946a8a62f3766fb646424,
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",
year = "1999",
month = "12",
day = "1",
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

PY - 1999/12/1

Y1 - 1999/12/1

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

VL - 45

SP - 1984

EP - 1991

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -