首页> 外文期刊>IEEE Transactions on Information Theory >An algorithm for near-optimal placement of sensor elements
【24h】

An algorithm for near-optimal placement of sensor elements

机译:传感器元件接近最佳放置的算法

获取原文
获取原文并翻译 | 示例
           

摘要

An important question in array design is that of where to place the elements of a sparse array for optimal performance in terms of its ability to detect and resolve a greater number of sources than conventionally possible. In particular, it has been shown that when sensor elements are arranged in the minimum redundancy fashion, by performing an augmentation technique on the covariances obtained from the array outputs, an M element array can be made to estimate the directions of arrival of as many as M(M-1)/2 uncorrelated sources unambiguously. Constructive procedures are developed to evaluate integer locations for an array of given sensors that span a prescribed distance, such that any missing integer is expressible as the difference of two sensor locations. New upper bounds for the ratio of the square of the minimum number of elements to the spanning distance are also established.
机译:阵列设计中的一个重要问题是,稀疏阵列的元素应放置在何处以实现最佳性能,因为其检测和分辨比常规方法更多的光源的能力。特别地,已经表明,当传感器元件以最小冗余方式布置时,通过对从阵列输出获得的协方差执行增强技术,可以使M元件阵列估计多达200个的到达方向。 M(M-1)/ 2个不相关的来源明确。开发了建设性的程序来评估跨越指定距离的给定传感器阵列的整数位置,以使任何缺失的整数都可表示为两个传感器位置的差。还建立了最小元素数量的平方与跨距之比的新上限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号