Design of Sequence Family Subsets Using a Branch and Bound Technique

Document type: Journal Articles
Article type: Original article
Peer reviewed: Yes
Author(s): Gregory Cresp, Hai Huyen Dam, Hans-Jürgen Zepernick
Title: Design of Sequence Family Subsets Using a Branch and Bound Technique
Journal: IEEE Transactions on Information Theory
Year: 2009
Volume: 55
Issue: 8
Pagination: 3847-3857
ISSN: 0018-9448
Publisher: IEEE
URI/DOI: 10.1109/TIT.2009.2023719
ISI number: 000268107200032
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. of Signal Processing (Sektionen för teknik – avd. för signalbehandling)
School of Engineering S- 372 25 Ronneby
+46 455 38 50 00
http://www.tek.bth.se/
Authors e-mail: crespg@watri.org.au, h.dam@exchange.curtin.edu.au, hans-jurgen.zepernick@bth.se
Language: English
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.
Subject: Telecommunications\General
Signal Processing\General
Keywords: Branch and Bound Technique, Sequences, Subset Design, CDMA
Edit