Rank-$2$-Optimal Adaptive Design of Binary Spreading Codes
Rank-$2$-Optimal Adaptive Design of Binary Spreading Codes
复制标题
DOI：
10.1109/tit.2007.903130
复制
发表时间：
2007-09
影响因子：
2.5
通讯作者：
G. N. Karystinos;D. Pados
中科院分区：
文献类型：
--
作者：
G. N. Karystinos;D. Pados
在实数/复数域上，使最大 SINR 线性滤波器输出处的信号与干扰加噪声比 (SINR) 最大化的扩频码是干扰自协方差矩阵的最小特征值特征向量。在二进制扩频码的情况下，最大化问题是 NP 难问题，其复杂度呈指数级增长。提出了一种在逆干扰自协方差矩阵的秩2近似下优化二进制扩频码的新方法，其中以低于二次的复杂度获得秩2最优二进制码。与常见的二进制硬限制特征向量设计相比，SINR 性能得到了显着的改进，该设计被证明与 1 级最优解决方案等效。
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.