Tropp, Joel A. and Dhillon, Inderjit S. and Heath, Robert W., Jr. (2005) Optimal CDMA signatures: a finite-step approach. In: International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004. IEEE , Piscataway, NJ, pp. 335-339. ISBN 0-7803-8408-3. https://resolver.caltech.edu/CaltechAUTHORS:TROissta04
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 515kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:TROissta04
Abstract
A description of optimal sequences for direct-sequence code division multiple access is a byproduct of recent characterizations of the sum capacity. The paper 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.
| Item Type: | Book Section | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| ORCID: |
| ||||||
| Additional Information: | © Copyright 2005 IEEE. Reprinted with permission. [Posted online: 2005-01-03] | ||||||
| Subject Keywords: | code division multiple access, matrix algebra, sequences, spread spectrum communication | ||||||
| Record Number: | CaltechAUTHORS:TROissta04 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:TROissta04 | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 9045 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | Archive Administrator | ||||||
| Deposited On: | 22 Oct 2007 | ||||||
| Last Modified: | 02 Oct 2019 23:56 |
Repository Staff Only: item control page
