首页> 外文期刊>Physical Communication >Reduced complexity Kalman filtering for phase recovery in XPIC systems
【24h】

Reduced complexity Kalman filtering for phase recovery in XPIC systems

机译:降低复杂度的卡尔曼滤波,用于XPIC系统中的相位恢复

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

摘要

Reduced-complexity Kalman-based algorithms are proposed to recover the phase of cross-polar interference cancellation (XPIC) receivers in microwave radio relay links. In particular, two completely independent radio frequency (RF) transceiver chains are considered for the two different polarizations, in order to have the maximum flexibility to connect different single carrier transceivers to dual-polarized antennas. A one-state Kalman model is proposed, which is of low complexity and thus suitable for a modern higher data rates M-ary quadrature amplitude modulation (M-QAM) receiver. Moreover, a further reduced complexity version is developed that uses a lower amount of information to recover the phase at the receiver, as well as a downsampling procedure to speed up the Kalman algorithm, and an alternative error computation that is essential to ease the Kalman implementation. It is worth noting that the three last simplifications are general and can be applied not only to a one-state Kalman model. Simulation results compare the proposed simplified Kalman solutions to typical phase-locked loop (PLL) algorithms proving their comparable performance with the benefit of lower complexity. Finally, the relationships between the Extended Kalman and the PLL approaches are investigated. The obtained relation is essential for the cross-polar phase recovery, since, as far as the authors know, there are not closed-form solutions for the PLL parameter optimization in cross schemes.
机译:提出了基于复杂度降低的卡尔曼算法,以恢复微波无线电中继链路中交叉极化干扰消除(XPIC)接收机的相位。尤其是,对于两个不同的极化,考虑了两个完全独立的射频(RF)收发器链,以便最大程度地灵活地将不同的单载波收发器连接到双极化天线。提出了一种单态卡尔曼模型,该模型具有较低的复杂度,因此适用于现代更高数据速率的M进制正交幅度调制(M-QAM)接收机。此外,还开发了进一步降低复杂度的版本,该版本使用较少的信息量来恢复接收器处的相位,并使用下采样过程来加快Kalman算法的速度,以及一种替代的误差计算,这对于简化Kalman实施至关重要。值得注意的是,最后三个简化是通用的,不仅可以应用于单态卡尔曼模型。仿真结果将提出的简化卡尔曼解决方案与典型的锁相环(PLL)算法进行了比较,证明了它们具有可比的性能,并且具有较低的复杂度。最后,研究了扩展卡尔曼和PLL方法之间的关系。所获得的关系对于交叉极性相位恢复至关重要,因为据作者所知,交叉方案中没有用于PLL参数优化的闭式解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号