Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization

Author

Tropp, J.A. ; Heath, Robert W., Jr. ; Strohmer, Thomas

Author_Institution

Inst. for Comp. Engr. & Sci., Texas Univ., Austin, TX, USA

fYear

2003

fDate

29 June-4 July 2003

Firstpage

407

Abstract

This paper desribes 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.

Keywords

channel capacity; code division multiple access; correlation theory; eigenvalues and eigenfunctions; inverse problems; matrix algebra; spread spectrum communication; white noise; Welch-bound-equality sequence; alternating minimization; channel capacity; inverse eigenvalue problem; matrix-theory; optimal CDMA signature sequence; received power; synchronous code-division multiple-access channel; total squared correlation; unit-norm tight frame; white noise; Buildings; Channel capacity; Convergence; Eigenvalues and eigenfunctions; Explosions; Gradient methods; Mathematics; Multiaccess communication; White noise;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2003. Proceedings. IEEE International Symposium on

Print_ISBN

0-7803-7728-1

Type

conf

DOI

10.1109/ISIT.2003.1228424

Filename

1228424