应用科学学报 ›› 1998, Vol. 16 ›› Issue (3): 326-330.

• 论文 • 上一篇    下一篇

基于QR分解算法的自适应抗干扰阵列最优权值并行提取

李承阳, 胡光锐, 龚耀寰   

  1. 上海交通大学
  • 收稿日期:1996-12-07 修回日期:1997-04-24 出版日期:1998-09-30 发布日期:1998-09-30
  • 作者简介:李承阳:上海交通大学电子工程系,上海 200030

Weights Extraction Method for Adaptive Anti-Jamming Array Processing

LI CHENGYANG, HU GUANGRUI, GONG YAOHUAN   

  1. Shanghai Jiaotong University, Electronic Engineering Dept, Shanghai 200030
  • Received:1996-12-07 Revised:1997-04-24 Online:1998-09-30 Published:1998-09-30

摘要: 自适应抗干扰阵列系统通常采用数值稳定性良好的QR分解最小二乘法(QRDLS)进行自适应处理.在需要最优权值的应用中,采用"回代法"或"权冲洗法"从阵列中得到权值.这两种方法对阵列单元施加特殊控制,不能实时实现自适应处理,也难于进行VLSI实现.文中提出的最优权值并行提取算法可以克服上述缺点,它在数据矩阵被三角化的同时从阵列中得到最优权值.另外,由于算法利用Givens旋转完成,全无除法.采用本方法的自适应处理特别适宜通过CORDIC技术进行VLSI实时实现.

关键词: 自适应阵列处理, 脉动阵列, Givens旋转, QR分解最小二乘法

Abstract: In this paper, we present a new optimum weights extraction method-Para-llel Ext raction. It is very efficient in adaptive anti-jamming array processing based on QR decomposition least square algorithm. By using this method, it's possible to obtain real-time implementation of the adaptive anti-jamming processing. The formula from "Parallel Extraction" method is discussed in detail. We also provide one kind of its Systolic array implementations.

Key words: Systolic array, QRD LS algorithm, Givens rotation, adaptive array processing