Design of Sequence Family Subsets Using a Branch and Bound Technique

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

    Research output: Contribution to journalArticlepeer-review


    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 languageEnglish
    Pages (from-to)3847-3857
    JournalIEEE Transactions on Information Theory
    Issue number8
    Publication statusPublished - 2009


    Dive into the research topics of 'Design of Sequence Family Subsets Using a Branch and Bound Technique'. Together they form a unique fingerprint.

    Cite this