Published November 2004
| Version public
Journal Article
Open
Finite-step algorithms for constructing optimal CDMA signature sequences
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.
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.Files
TROieeetit04b.pdf
Files
(235.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a2afcc58e5cfbf0667c90f837491840b
|
235.7 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 9037
- Resolver ID
- CaltechAUTHORS:TROieeetit04b
Dates
- Created
-
2007-10-22Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field