Abstract
The number of spreading sequences required for direct-sequence code-division multiple-access (DS-CDMA) systemsdepends on the number of simultaneous users in the system. Oftena sequence family provides more sequences than are required; inmany cases the selection of the employed sequences is a computationallyintensive task. This selection is a key consideration, asthe properties of the sequences assigned affect the error performancein the system. In this paper, a branch and bound algorithmis presented to perform this selection based on two different costfunctions. Numerical results are presented to demonstrate the improvedperformance of this algorithm over previous work.
Original language | English |
---|---|
Pages (from-to) | 3847-3857 |
Journal | IEEE Transactions on Information Theory |
Volume | 55 |
Issue number | 8 |
DOIs | |
Publication status | Published - 2009 |