Title :
Finite-step algorithms for constructing optimal CDMA signature sequences
Author :
Tropp, Joel A. ; Dhillon, Inderjit S. ; Heath, Robert W., Jr.
Author_Institution :
Dept. of Math., Michigan Univ., Ann Arbor, MI, USA
Abstract :
A description of optimal sequences for direct-spread code-division multiple access (DS-CDMA) is a byproduct of recent characterizations of the sum capacity. This paper restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods.
Keywords :
binary sequences; code division multiple access; matrix inversion; numerical stability; optimisation; singular value decomposition; spread spectrum communication; DS-CDMA; direct-spread code-division multiple access; finite-step algorithms; inverse singular value problem; matrix theory; numerical stability; optimal signature sequences; sum capacity; Algorithm design and analysis; Computational complexity; Eigenvalues and eigenfunctions; Engineering profession; Information theory; Mathematics; Multiaccess communication; Numerical stability; Resistance heating; White noise; Algorithms; CDMA; code-division multiple access; inverse eigenvalue problems; optimal sequences; sum capacity;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.836698
