Abstract: A description of optimal sequences for direct-spread code- division multiple access (S-CDMA) is a byproduct of recent characteri- zations of the sum capacity. This correspondence 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.
- Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences (pdf)
J. Tropp, I. Dhillon, R. Jr..
IEEE Transactions on Information Theory 50(11), pp. 2916-2921, November 2004.