Heuristic algorithms for binary sequence assignment in DS-CDMA systems

Chi Wan Sung, Ho Yuet Kwan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Citations (Scopus)

Abstract

For a given set of background interference signals, it is well known that the optimal sequence can be obtained by solving an eigenvalue problem. However, one usual practical constraint on the sequences in that the sequence elements should have a constant amplitude. We show that when the choice is limited to binary sequences, the sequence assignment problem is NP-hard. We propose a Local Search method to find suboptimal solutions. This method can also be applied when polyphase sequences are used. Performance evaluation when applied to multipath channels is made.

Original languageEnglish
Title of host publication13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2002
Pages2327-2331
Number of pages5
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2002 - Lisboa, Portugal
Duration: 15 Sept 200218 Sept 2002

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Volume5

Conference

Conference13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2002
Country/TerritoryPortugal
CityLisboa
Period15/09/0218/09/02

Fingerprint

Dive into the research topics of 'Heuristic algorithms for binary sequence assignment in DS-CDMA systems'. Together they form a unique fingerprint.

Cite this