Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Heuristic algorithms for binary sequence assignment in DS-CDMA systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chi Wan Sung ; Dept. of Comput. Eng. & Inf. Technol., City Univ. of Hong Kong, Kowloon, China ; Ho Yuet Kwan

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

Published in:

Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on  (Volume:5 )

Date of Conference:

15-18 Sept. 2002