...
首页> 外文期刊>International journal of antennas and propagation >Efficient Rank-Adaptive Least-Square Estimation and Multiple-Parameter Linear Regression Using Novel Dyadically Recursive Hermitian Matrix Inversion
【24h】

Efficient Rank-Adaptive Least-Square Estimation and Multiple-Parameter Linear Regression Using Novel Dyadically Recursive Hermitian Matrix Inversion

机译:使用新型二元递归埃尔米特矩阵求逆的有效秩自适应最小二乘估计和多参数线性回归

获取原文
           

摘要

Least-square estimation (LSE) and multiple-parameter linear regression (MLR) are the importantestimation techniques for engineering and science, especially in the mobile communications and signalprocessing applications. The majority of computational complexity incurred in LSE and MLR arisesfrom a Hermitian matrix inversion. In practice, the Yule-Walker equations are not valid, and hence theLevinson-Durbin algorithm cannot be employed for general LSE and MLR problems. Therefore, themost efficient Hermitian matrix inversion method is based on the Cholesky factorization. In this paper,we derive a new dyadic recursion algorithm for sequential rank-adaptive Hermitian matrix inversions. In addition, we provide the theoretical computational complexity analyses to compare our new dyadicrecursion scheme and the conventional Cholesky factorization. We can design a variable model-orderLSE (MLR) using this proposed dyadic recursion approach thereupon. Through our complexity analysesand the Monte Carlo simulations, we show that our new dyadic recursion algorithm is more efficient thanthe conventional Cholesky factorization for the sequential rank-adaptive LSE (MLR) and the associatedvariable model-order LSE (MLR) can seek the trade-off between the targeted estimation performanceand the required computational complexity. Our proposed new scheme can benefit future portable andmobile signal processing or communications devices.
机译:最小二乘估计(LSE)和多参数线性回归(MLR)是工程和科学领域的重要估算技术,尤其是在移动通信和信号处理应用中。 LSE和MLR引起的大多数计算复杂性来自Hermitian矩阵求逆。在实践中,Yule-Walker方程无效,因此Levinson-Durbin算法不能用于一般的LSE和MLR问题。因此,最有效的Hermitian矩阵反演方法基于Cholesky分解。本文推导了一种新的二阶递归算法,用于顺序秩自适应的埃尔米特矩阵反演。此外,我们提供了理论上的计算复杂度分析,以比较我们的新dyadicrecursion方案和常规的Cholesky因式分解。我们可以使用此提议的二元递归方法来设计变量model-orderLSE(MLR)。通过我们的复杂度分析和蒙特卡洛模拟,我们表明,对于顺序秩自适应LSE(MLR),我们的新二元递归算法比常规的Cholesky分解更有效,并且相关的变量模型阶LSE(MLR)可以寻求权衡在目标估算性能和所需的计算复杂度之间。我们提出的新方案可以使未来的便携式和移动信号处理或通信设备受益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号