Design of Sequence Family Subsets Using a Branch and Bound Technique

Gregory Cresp; H.J. Zepernick; H.H. Dam

doi:10.1109/TIT.2009.2023719

Design of Sequence Family Subsets Using a Branch and Bound Technique

Gregory Cresp
, H.J. Zepernick
, H.H. Dam

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1109/TIT.2009.2023719
Publication status	Published - 2009

Access to Document

10.1109/TIT.2009.2023719

http://www.itsoc.org/publications/transactions

Cite this

@article{57d297ddc8b849dd80d54cd53d336772,

title = "Design of Sequence Family Subsets Using a Branch and Bound Technique",

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.",

author = "Gregory Cresp and H.J. Zepernick and H.H. Dam",

year = "2009",

doi = "10.1109/TIT.2009.2023719",

language = "English",

volume = "55",

pages = "3847--3857",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

number = "8",

}

TY - JOUR

T1 - Design of Sequence Family Subsets Using a Branch and Bound Technique

AU - Cresp, Gregory

AU - Zepernick, H.J.

AU - Dam, H.H.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1109/TIT.2009.2023719

DO - 10.1109/TIT.2009.2023719

M3 - Article

SN - 0018-9448

VL - 55

SP - 3847

EP - 3857

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 8

ER -

Design of Sequence Family Subsets Using a Branch and Bound Technique

Abstract

Access to Document

Fingerprint

Cite this