By Topic

Design of Sequence Family Subsets Using a Branch and Bound Technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gregory Cresp ; Sch. of Electr., Electron. & Comput. Eng., Univ. of Western Australia, Crawley, WA, Australia ; Hai Huyen Dam ; Hans-JÜrgen Zepernick

The number of spreading sequences required for direct-sequence code-division multiple-access (DS-CDMA) systems depends on the number of simultaneous users in the system. Often a sequence family provides more sequences than are required; in many cases the selection of the employed sequences is a computationally intensive task. This selection is a key consideration, as the properties of the sequences assigned affect the error performance in the system. In this paper, a branch and bound algorithm is presented to perform this selection based on two different cost functions. Numerical results are presented to demonstrate the improved performance of this algorithm over previous work.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 8 )