TY - GEN
T1 - Heuristic algorithms for binary sequence assignment in DS-CDMA systems
AU - Sung, Chi Wan
AU - Kwan, Ho Yuet
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33645713808
U2 - 10.1109/PIMRC.2002.1046560
DO - 10.1109/PIMRC.2002.1046560
M3 - Conference contribution
AN - SCOPUS:33645713808
SN - 0780375890
SN - 9780780375895
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
SP - 2327
EP - 2331
BT - 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2002
ER -