Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
IEEE Transactions on Wireless Communications
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
IEEE Transactions on Information Theory
Optimal OSTBC sequence detection over unknown correlated fading channels
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Adaptive binary signature design for code division multiplexing
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 754.90 |
Over the real/complex field, the spreading code that maximizes the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR linear filter is the minimum-eigenvalue eigenvector of the interference autocovariance matrix. In the context of binary spreading codes, the maximization problem is NP-hard with complexity exponential in the code length. A new method for the optimization of binary spreading codes under a rank-2 approximation of the inverse interference autocovariance matrix is presented where the rank-2-optimal binary code is obtained in lower than quadratic complexity. Significant SINR performance improvement is demonstrated over the common binary hard-limited eigenvector design which is shown to be equivalent to the rank-1-optimal solution.