...
首页> 外文期刊>IEEE transactions on circuits and systems . I , Regular papers >SMI-MVDR Beamformer Implementations for Large Antenna Array and Small Sample Size
【24h】

SMI-MVDR Beamformer Implementations for Large Antenna Array and Small Sample Size

机译:适用于大型天线阵列和小样本量的SMI-MVDR Beamformer实现

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

摘要

Two online implementations of the sample matrix inversion minimum variance distortionless response (SMI-MVDR) antenna array beamformer, based on recursive updating of the diagonal loading triangular matrix decomposition, are presented. The first proposed beamformer uses the Cholesky factorization recursive updating of the matrix whose dimension is increasing. The second beamformer uses the Householder transform (HT) recursive updating of the modified input data matrix. The proposed implementations consist primarily of vector operations, that is, they are suitable for parallel implementations with FPGAs or DSPs. The computational cost of the proposed beamforming algorithms is $O(Nk)$, where $N$ is the number of antenna array elements, and $k$ is the number of processing snapshots. The proposed implementations are especially useful for large antenna array applications, where the number of available snapshots does not exceed the number of the array antenna elements. The simulation result shows that the numerical performance of the proposed beamformers is superior, relative to the conventional recursive MVDR beamformer implementation.
机译:基于对角线加载三角矩阵分解的递归更新,提出了两种在线实现的样本矩阵求逆最小方差无失真响应(SMI-MVDR)天线阵列波束形成器。首先提出的波束形成器使用维数不断增加的矩阵的Cholesky分解递归更新。第二个波束形成器使用修改后的输入数据矩阵的Householder变换(HT)递归更新。所提出的实现主要由向量运算组成,也就是说,它们适合于使用FPGA或DSP的并行实现。所提出的波束成形算法的计算成本为$ O(Nk)$,其中$ N $是天线阵列元素的数量,而$ k $是处理快照的数量。所提出的实施方式对于大型天线阵列应用尤其有用,在大型天线阵列应用中,可用快照的数量不超过阵列天线元件的数量。仿真结果表明,相对于传统的递归MVDR波束形成器,所提出的波束形成器的数值性能更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号