Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 407-

  Tropp, Joel A ^a   Heath Jr , Robert W ^b   Strohmer, Thomas ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b The University of Texas at Austin   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; EIGENVALUES AND EIGENFUNCTIONS; INVERSE PROBLEMS; MATRIX ALGEBRA; OPTIMAL SYSTEMS; VECTORS;

SIGNATURE SEQUENCES; STRUCTURE INVERSE EIGENVALUE PROBLEM; UNIT NORM FRAMES; WELCH BOUND EQUALITY SEQUENCES;

BINARY SEQUENCES;

EID: 0141938660     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228424     Document Type: Conference Paper

References (5)

1. S. Ulukus and R. D. Yates. "Iterative construction of optimal signature sequences in synchronous CDMA systems," IEEE Trans. IT, 47(5), 1989-1998, Jul. 2001.
2. P. Viswanath and V. Anantharan, "Optimal sequences for CDMA under colored noise," IEEE Trans. IT, 48(6), 1295-1318, Jun. 2002.
3. M. T. Chu and G. H. Golub, "Structured inverse eigenvalue problems," Acta Numerica, 11, 1-71, Jan. 2002.
4. R. R. Meyer. "Sufficient conditions for the convergence of monotonic mathematical programming algorithms," J. Comp. Syst. Sci., 12, 108-121, 1976.
5. J. A. Tropp, I. S. Dhillon, R. W. Heath Jr. and T. Strohmer. "Optimal CDMA signature sequences and inverse eigenvalue problems." In preparation, 2003.