Optimal CDMA Signatures: A Finite-Step Approach

Joel Tropp, Inderjit Dhillon, Robert Heath Jr.

Abstract:   A description of optimal sequences for direct-spread code division multiple access is a byproduct of recent characterizations of the sum capacity. This papers restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that obtains the sequences directly instead of computing the Gram matrix of the optimal signatures.

Download: pdf

Citation

  • Optimal CDMA Signatures: A Finite-Step Approach (pdf, software)
    J. Tropp, I. Dhillon, R. Jr..
    IEEE International Symposium on Spread Spectrum Techniques and Applications,, August 2004.

    Bibtex: