Design of sequence family subsets using a branch and bound technique

Authors:
Gregory Cresp;Hai Huyen Dam;Hans-Jürgen Zepernick
Affiliations:
MRX Technologies, Perth, Australia and School of Electrical, Electronic and Computer Engineering, The University of Western Australia, Crawley, Australia;Department of Mathematics and Statistics, Curtin University of Technology, Perth, Australia;Blekinge Institute of Technology, Ronneby, Sweden
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 3
Cited 0

Optimization

Optimization
Introduction to Algorithms

Introduction to Algorithms
A generalized utility for parallel branch and bound algorithms

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

Quantified Score

Hi-index	754.85

Visualization

Abstract

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.