Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
IEEE Transactions on Wireless Communications
A near-optimal multiuser detector for DS-CDMA systems using semidefinite programming relaxation
IEEE Transactions on Signal Processing
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
IEEE Transactions on Signal Processing
Optimal Joint Detection/Estimation in Fading Channels With Polynomial Complexity
IEEE Transactions on Information Theory
Rank-2-Optimal Adaptive Design of Binary Spreading Codes
IEEE Transactions on Information Theory
Transmitter adaptation in multicode DS-CDMA systems
IEEE Journal on Selected Areas in Communications
The application of semidefinite programming for detection in CDMA
IEEE Journal on Selected Areas in Communications
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
IEEE Transactions on Wireless Communications
Optimal OSTBC sequence detection over unknown correlated fading channels
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Hi-index | 754.84 |
The maximization of a full-rank quadratic form over the binary alphabet can be performed through exponential-complexity exhaustive search. However, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. By introducing auxiliary spherical coordinates, we show that the rank-deficient quadratic-form maximization problem is converted into a double maximization of a linear form over a multidimensional continuous set, the multidimensional set is partitioned into a polynomial-size set of regions which are associated with distinct candidate binary vectors, and the optimal binary vector belongs to the polynomial-size set of candidate vectors. Thus, the size of the candidate set is reduced from exponential to polynomial. We also develop an algorithm that constructs the polynomial-size candidate set in polynomial time and show that it is fully parallelizable and rank-scalable. Finally, we demonstrate the efficiency of the proposed algorithm in the context of adaptive spreading code design.