可变遗忘因子的PASTd算法
PASTd Algorithm Based on Variable Forgetting Factor
着重研究了子空间跟踪的PASTd算法。PASTd算法的复杂度比PAST算法低的多,但是其收敛速度很慢。Matlab仿真表明,其向量跟踪误差和收敛速度与遗忘因子的取值有关。对较小的遗忘因子,PASTd算法的向量跟踪误差较大,其收敛速度较快;对较大的遗忘因子,PASTd算法的向量跟踪误差较小,其收敛速度较慢。于是将PASTd算法的遗忘因子修改为可变因子,既能保证向量跟踪误差足够小,又能加快其收敛速度。当信道发生突变时,可根据向量跟踪误差及时地调节遗忘因子的大小。
his paper focuses on PASTd algorithm.The complexity of this algorithm is much lower than the PAST algorithm's, but its convergence rate is slower. Matlab simulation shows that PASTd algorithm's vector tracking error and convergence rate are interrelated with the forgetting factor. When the forgetting factor is small, its vector tracking error is large and its convergence rate is fast; when the forgetting factor is large, its vector tracking error is small and its convergence rate is slow. So this article defines a variable forgetting factor ,it can reduce the vector tracking error and accelerate the speed of convergence .When the channel is mutated, it can quickly find a suitable forgetting factor.
李艳萍、赵三伟
通信无线通信
可变遗忘因子PASTd算法多用户检测
a variable forgetting factorPASTd algorithmmulti-user detection
李艳萍,赵三伟.可变遗忘因子的PASTd算法[EB/OL].(2010-09-15)[2025-08-10].http://www.paper.edu.cn/releasepaper/content/201009-340.点此复制
评论