首页> 外文会议>IEEE International Telecommunications Symposium >Set-Membership Adaptive Algorithms based on Time-Varying Error Bounds and their Application to Interference Suppression
【24h】

Set-Membership Adaptive Algorithms based on Time-Varying Error Bounds and their Application to Interference Suppression

机译:基于时变错误限制及其在干扰抑制的应用程序的Set-Membership自适应算法

获取原文

摘要

This work presents set-membership adaptive algorithms based on time-varying error bounds. A bounding ellipsoidal adaptive constrained (BEACON) recursive least-squares algorithm is described for parameter estimation subject to time-varying error bounds. The important issue of error bound specification is addressed in a new framework that takes into account parameter estimation dependency, multi-access (MAI) and inter-symbol interference (ISI) for DS-CDMA communications. An algorithm for tracking and estimating the interference power is presented and incorporated into the time-varying error bound and the BEACON technique. Computer simulations show that the new algorithms are capable of outperforming previously reported techniques with a smaller number of parameter updates and a reduced risk of overbounding or underbounding.
机译:此工作基于时变错误界限介绍了Set-Commership自适应算法。描述对经受时变误差界限的参数估计来描述限定椭圆自适应约束(信标)递归最小二乘算法。错误绑定规范的重要问题是在用于考虑参数估计依赖性,多访问(MAI)和用于DS-CDMA通信的符号间干扰(ISI)的新框架中解决的。呈现用于跟踪和估计干扰功率的算法并结合到时变误差绑定和信标技术中。计算机仿真表明,新算法能够优于先前报告的技术,具有较少数量的参数更新以及降低过度录制或欠禁区的风险。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号