Tropp, Joel A. and Dhillon, Inderjit S. and Heath, Robert W., Jr. (2004) Finite-step algorithms for constructing optimal CDMA signature sequences. IEEE Transactions on Information Theory, 50 (11). pp. 2916-2921. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b
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.
|Additional Information:||© Copyright 2004 IEEE. Reprinted with permission. Manuscript received March 17, 2004. [Posted online: 2004-10-25] The work of I. Dhillon was supported by the National Science Foundation under CAREER Grant ACI-0093404. The work of R. Heath was supported by the Texas Advanced Technology Program under Grant 003658–0380-2003. Communicated by K. G. Paterson, Associate Editor for Sequences. The authors wish to thank an anonymous referee who identified several subtle errors.|
|Subject Keywords:||Algorithms, code-division multiple access (CDMA), inverse eigenvalue problems, optimal sequences, sum capacity|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||22 Oct 2007|
|Last Modified:||26 Dec 2012 09:44|
Repository Staff Only: item control page