CaltechAUTHORS
  A Caltech Library Service

Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization

Tropp, Joel A. and Heath, Robert W., Jr. and Strohmer, Thomas (2003) Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization. In: International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June - 4 July 2003. IEEE , Piscataway, NJ, p. 407. ISBN 0-7803-7728-1 http://resolver.caltech.edu/CaltechAUTHORS:TROisit03

[img]
Preview
PDF
See Usage Policy.

140Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:TROisit03

Abstract

This paper describes the matrix-theoretic ideas known as Welch-bound-equality sequences or unit-norm tight frames that are used to alternate minimizing the total squared correlation. This paper shows the construction of an optimal signature sequences for the synchronous code-division multiple-access (S-CDMA) channel in the presence of white noise and uniform received powers to solve inverse eigenvalue problems that maximize the sum capacity of the S-CDMA channel.


Item Type:Book Section
Additional Information:© Copyright 2003 IEEE. Reprinted with permission. Many thanks to Dr. I. S. Dhillon for helpful conversations. [J.A.T. was] [s]upported in part by NSF DMS-Grant 0208568.
Subject Keywords:channel capacity, code division multiple access, correlation theory, eigenvalues and eigenfunctions, inverse problems, matrix algebra, spread spectrum communication, white noise
Record Number:CaltechAUTHORS:TROisit03
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:TROisit03
Alternative URL:http://dx.doi.org/10.1109/ISIT.2003.1228424
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9044
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:22 Oct 2007
Last Modified:26 Dec 2012 09:44

Repository Staff Only: item control page