Optimal sequences and sum capacity of synchronous CDMA systems

  • Authors:
  • P. Viswanath;V. Anantharam

  • Affiliations:
  • Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 755.02

Visualization

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