摘要
分别描述6种盲均衡算法的原理和迭代更新式,这些算法的收敛速度、稳态误差等性能,在许多文献中都有详细分析,而对计算量的分析并不多见,从每次迭代计算量的角度来分析各种算法的性能,以求给后续研究者对算法的改进提供参考。
This paper describes the principle and iterative updating of six blind equalization algorithms.The convergence speed,steady-state error and other performance of these algorithms had been analyzed in detail in many literature,but the analysis of calculation was rare.Therefore,this paper attempts to analyze the performance of various algorithms from the perspective of calculation amount of each iteration,in order to provide reference for the researchers to improve the algorithm.
作者
苏静
Su Jing(School of Information Science and Engineering,Hunan First Normal University,Changsha,City,Hunan Praovince 410205)
出处
《黄河科技学院学报》
2020年第2期68-70,共3页
Journal of Huanghe S&T College
基金
湖南省教育厅资助科研项目“高阶QAM调制方式下的混合型CMA软决策盲均衡算法研究”(18C0950)
基础教育信息化技术湖南省重点实验室阶段性成果(2015TP1017)。
关键词
盲均衡
恒模
最大后验概率
计算量
blind equalization
constant modulus
maximum posterior probability
calculation
