arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.04646cs.ITmath.IT
收藏

盲测量选择:一种随机矩阵理论方法

Blind Measurement Selection: A Random Matrix Theory Approach

Khalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini

摘要:

本文考虑从$n$可用的传感器观测值中选择一组$k$测量值的问题。所选择的测量应当最小化评估在估计某个$m$维度参数向量中的误差的某个误差函数。检查每个$n\choose k$可能选择的穷举搜索将需要非常高的计算复杂性,并且因此对于大的$n$和$k$是不实际的。最近已经研究了具有低复杂性的替代方法,但是它们的主要缺点是1)它们需要测量矩阵的完美知识,以及2)它们需要以测量矩阵的变化的速度应用。为了克服这些问题,我们考虑的渐近制度,其中$k$,$n$和$m$以相同的速度增长大。然后使用随机矩阵理论的工具以封闭形式近似常用的最重要的误差测量。然后利用渐近近似值来选择适当的$k$测量值,该测量值对于渐近误差测量值表现出低值。提出了两种启发式算法:第一种只是将凸优化技巧应用于渐近误差测度。第二个算法是一个低复杂度的贪心算法,试图寻找一个足够好的解决方案,为原来的最小化问题。贪心算法可以应用于精确和渐近误差测量,因此可以以盲和信道感知的方式实现。我们提出了两个潜在的应用,所提出的算法可以使用,即天线选择在大规模多用户系统和无线传感器网络的传感器选择的上行链路传输。数值结果也提出和支持所提出的盲方法在达到信道感知算法的性能的效率。

英文摘要:

This paper considers the problem of selecting a set of $k$ measurements from $n$ available sensor observations. The selected measurements should minimize a certain error function assessing the error in estimating a certain $m$ dimensional parameter vector. The exhaustive search inspecting each of the $n\choose k$ possible choices would require a very high computational complexity and as such is not practical for large $n$ and $k$. Alternative methods with low complexity have recently been investigated but their main drawbacks are that 1) they require perfect knowledge of the measurement matrix and 2) they need to be applied at the pace of change of the measurement matrix. To overcome these issues, we consider the asymptotic regime in which $k$, $n$ and $m$ grow large at the same pace. Tools from random matrix theory are then used to approximate in closed-form the most important error measures that are commonly used. The asymptotic approximations are then leveraged to select properly $k$ measurements exhibiting low values for the asymptotic error measures. Two heuristic algorithms are proposed: the first one merely consists in applying the convex optimization artifice to the asymptotic error measure. The second algorithm is a low-complexity greedy algorithm that attempts to look for a sufficiently good solution for the original minimization problem. The greedy algorithm can be applied to both the exact and the asymptotic error measures and can be thus implemented in blind and channel-aware fashions. We present two potential applications where the proposed algorithms can be used, namely antenna selection for uplink transmissions in large scale multi-user systems and sensor selection for wireless sensor networks. Numerical results are also presented and sustain the efficiency of the proposed blind methods in reaching the performances of channel-aware algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑