首页 | 本学科首页   官方微博 | 高级检索  
     

一种适用于大型阵列的递推干扰抑制算法
引用本文:陈晓旭,孙胜贤,李军,龚耀寰. 一种适用于大型阵列的递推干扰抑制算法[J]. 信号处理, 2009, 25(12)
作者姓名:陈晓旭  孙胜贤  李军  龚耀寰
作者单位:电子科技大学电子工程学院,成都,610054
摘    要:天线阵列在雷达与卫星通信中有着广泛的应用,它可以通过波束形成来抑制干扰.对于具有较多阵元数的大型阵列,普通的波束形成算法计算量很高.本文给出一种适用于大型阵列的递推干扰抑制算法,它是在波束空间分解最大信干噪比准则下基于干扰矢量进行变维递推处理,所需递推步数为干扰数,且每步递推中数据矩阵的维数很小,因而所需的总计算量较低.阵元数越多该递推算法的计算效率越高.仿真结果表明,该递推算法可以有效实现干扰抑制.

关 键 词:天线阵列  递推干扰抑制  计算量

A Recursive Interference Suppression Algorithm for Large Array
CHEN Xiao-Xu,SUN Sheng-xian,LI Jun,GONG Yao-huan. A Recursive Interference Suppression Algorithm for Large Array[J]. Signal Processing(China), 2009, 25(12)
Authors:CHEN Xiao-Xu  SUN Sheng-xian  LI Jun  GONG Yao-huan
Abstract:Antenna array is widely used in radar and satellite communication with the capability of interference suppression by beam-forming.For large array with lots of elements,the computational complexity of normal beam-forming algorithm is very high.In this paper,we present a recursive interference suppression algorithm for large array,which performs interference suppression recursively with variable-dimensional data processing based on interference vector under the criteria of Max SINR with beam space decomposition.The number of recursive steps is equal with that of interference,and the dimension of data matrix in each step is small,thus the total computational complexity is low.It is more efficient for array with more elements.Simulation result shows that the reeursive algorithm is valid to implement interference suppression.
Keywords:Antenna Array  Recursive Interference Suppression  Computational Complexity
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号