Finite-step algorithms for constructing optimal CDMA signature sequences

IEEE Transactions on Information Theory

Volumn 50, Issue 11, 2004, Pages 2916-2921

  Tropp, Joel A ^a   Dhillon, Inderjit S ^b   Heath Jr , Robert W ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; INVERSE PROBLEMS; MATRIX ALGEBRA; OPTIMIZATION; WHITE NOISE;

DIRECT SPREAD CODE DIVISION MULTIPLE ACCESS; INVERSE EIGENVALUE PROBLEMS; OPTIMAL SEQUENCES; SUM CAPACITY;

DIRECT SEQUENCE SYSTEMS;

EID: 8144223740     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.836698     Document Type: Article

References (21)

1. M. Rupf and J. L. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1261-1266, July 1994.
2. P. Viswanath and V. Anantharam, "Optimal sequences and sum capacity of synchronous CDMA systems," IEEE Trans. Inform. Theory, vol. 45, pp. 1984-1991, Sept. 1999.
3. S. Ulukus and R. D. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Trans. Inform. Theory, vol. 47, pp. 1989-1998, July 2001.
4. C. Rose, "CDMA codeword optimization: Interference avoidance and convergence via class warfare," IEEE Trans. Inform. Theory, vol. 47, pp. 2368-2382, Sept. 2001.
5. S. Ulukus and A. Yener, "Iterative joint optimization of CDMA signature sequences and receiver filters," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 2002.
6. P. Viswanath and A. Anantharam, "Optimal sequences for CDMA under colored noise: A Schur-saddle function property," IEEE Trans. Inform. Theory, vol. 48, pp. 1295-1318, June 2002.
7. P. Anigstein and V. Anantharam, "Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum," IEEE Trans. Inform. Theory, vol. 49, pp. 873-885, Apr. 2003.
8. J. A. Tropp, R. W. Heath, and T. Strohmer, "Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, 2003, p. 407.
9. M. T. Chu and G. H. Golub, "Structured inverse eigenvalue problems," Acta Numer., vol. 11, pp. 1-71, Jan. 2002.
10. R. B. Bendel and M. R. Mickey, "Population correlation matrices for sampling experiments," Commun. Statist. Simul. Comp., vol. B7, no. 2, pp. 163-182, 1978.
11. N. N. Chan and K.-H. Li, "Diagonal elements and eigenvalues of a real symmetric matrix," J. Math. Anal. Appl., vol. 91, pp. 562-566, 1983.
12. J. A. Tropp, I. S. Dhillon, R. Heath, and T. Strohmer, "Designing structured tight frames via an alternating projection method," Univ. Texas at Austin, ICES Rep. 0350, 2003.
13. P. Casazza and J. Kovačević, "Equal-norm tight frames with erasures," Adv. Comp. Math. (Special Issue on Frames), pp. 387-430, 2002.
14. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
15. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications. New York: Academic, 1979.
16. P. I. Davies and N. J. Higham, "Numerically stable generation of correlation matrices and their factors," BIT, vol. 40, no. 4, pp. 640-651, 2000.
17. G. H. Golub and C. F. Van Loan, Matrix Computations, 3 ed. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
18. G. W. Stewart, "The efficient generation of random orthogonal matrices with an application to condition estimation," SIAM J. Numer. Anal., vol. 17, no. 30, pp. 403-409, 1980.
19. R. B. Holmes, "On random correlation matrices," SIAM J. Matrix Anal. Appl., vol. 40, no. 4, pp. 640-651, 1991,
20. I. S. Dhillon, R. W. Heath Jr., M. Sustik, and J. A. Tropp, " Generalized finite algorithms for constructing Hermitian matrices with prescribed diagonal and spectrum," UT-Austin, Dept. Comp. Sci., Tech. Rep.TR-03-49, 2003, submitted for publication.
21. J. A. Tropp, "Topics in Sparse Approximation," Ph.D. dissertation, Institute for Computational Engineering and Sciences (ICES , Univ. Texas at Austin, Aug. 2004.