Adaptive Binary Spreading Sequence Assignment Using Semidefinite Relaxation

被引：3
作者：
Gao, Kanke [1 ]
Ding, Lei [1 ]
机构：
[1] SUNY Buffalo, Dept Elect Engn, Buffalo, NY 14260 USA
来源：
IEEE WIRELESS COMMUNICATIONS LETTERS | 2013年 / 2卷 / 01期
关键词：
Binary sequences; code-division multiplexing; Boolean quadratic program; semidefinite programming; semidefinite relaxation; signal-to-interference-plus-noise ratio (SINR);
D O I：
10.1109/WCL.2012.120312.120518
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the problem of designing binary spreading sequences in code-division multiplexing (CDM) systems. Our objective is to find the binary spreading sequence that maximizes the pre-detection signal-to-interference-plus-noise (SINR) at the output of maximum-SINR (MSINR) linear filter. However, the maximization problem over the binary field is NP-hard with complexity exponential in the sequence length. In this paper, we present a semidefinite-relaxation-based algorithm with a polynomial computational complexity that outputs the desirable binary solution with the deterministic SINR performance guarantee. Simulation studies demonstrate performance improvement over other known binary sequence assignment algorithms.
引用
收藏
页码：94 / 97
页数：4
相关论文
共 11 条
[1]   Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets [J].
Ding, CS ;
Golin, M ;
Klove, T .
DESIGNS CODES AND CRYPTOGRAPHY, 2003, 30 (01) :73-84
[2]   Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming [J].
Goemans, MX ;
Williamson, DP .
JOURNAL OF THE ACM, 1995, 42 (06) :1115-1145
[3]  
Grover R., P 2005 IEEE MIL COMM, V2, P930
[4]   On the karystinos-pados bounds and optimal binary DS-CDMA signature ensembles [J].
Ipatov, VP .
IEEE COMMUNICATIONS LETTERS, 2004, 8 (02) :81-83
[5]   Rank-2-optimal Adaptive design of binary spreading codes [J].
Karystinos, George N. ;
Pados, Dimitris A. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (09) :3075-3080
[6]   New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets [J].
Karystinos, GN ;
Pados, DA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (01) :48-51
[7]   Binary-code-allocation scheme in DS-CDMA systems [J].
Kwan, Ho Yuet ;
Lok, Tat M. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2007, 56 (01) :134-145
[8]   OPTIMUM SEQUENCE MULTISETS FOR SYNCHRONOUS CODE-DIVISION MULTIPLE-ACCESS CHANNELS [J].
RUPF, M ;
MASSEY, JL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) :1261-1266
[9]   Iterative construction of optimum signature sequence sets in synchronous CDMA systems [J].
Ulukus, S ;
Yates, RD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) :1989-1998
[10]   Adaptive binary signature design for code-division multiplexing [J].
Wei, Lili ;
Batalama, Stella N. ;
Pados, Dimitris A. ;
Suter, Bruce W. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (07) :2798-2804
12