English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 60989/93528 (65%)
造访人次 : 1563083      在线人数 : 20
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60804

    题名: Adaptive Linearly Constrained Inverse QRD-RLS Beamforming Algorithm for Moving Jammers Suppression
    作者: 陳巽璋;Chang, C.Y.
    贡献者: 淡江大學電機工程學系
    日期: 2002-08-01
    上传时间: 2011-10-15 00:54:25 (UTC+8)
    摘要: A general, linearly constrained (LC) recursive least squares (RLS) array-beamforming algorithm, based on an inverse QR decomposition, is developed for suppressing moving jammers efficiently. In fact, by using the inverse QR decomposition-recursive least squares (QRD-RLS) algorithm approach, the least-squares (LS) weight vector can be computed without back substitution and is suitable for implementation using a systolic array to achieve fast convergence and good numerical properties. The merits of this new constrained algorithm are verified by evaluating the performance, in terms of the learning curve, to investigate the convergence property and numerical efficiency, and the output signal-to-interference-and-noise ratio. We show that our proposed algorithm outperforms the conventional linearly constrained LMS (LCLMS) algorithm, and the one using the fast linear constrained RLS algorithm and its modified version.
    關聯: IEEE Trans. on Antennas and Propagation 50(8), pp.1138-1150
    DOI: 10.1109/TAP.2002.801276
    显示于类别:[電機工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    Adaptive Linearly Constrained Inverse QRD-RLS Beamforming Algorithm for Moving Jammers Suppression.pdf416KbAdobe PDF0检视/开启



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈