This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ab...This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ability, and adaptability greatly in learning processes of networks. The simulation results have been shown that the method can be applied to the modeling and identification of complex dynamic control systems.展开更多
High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms...High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, the approximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modified CORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to be with a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finite register length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practical applications.展开更多
针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐...针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐符号高斯近似,基于置信传播算法与联合因子图进行消息传递,用边缘后验概率替代GA-MP中的外部信息以减少运算量,结合阻尼因子提升收敛速度,同时引入概率阈值减少后续更新的节点数,从而使运算复杂度得到有效降低。实验结果表明,改进后的GA-MP算法在保证误码率性能的前提下具有更低的复杂度。展开更多
文摘This paper presents a multi-ANN approximation approach to approximate complex non-linear function. Comparing with single-ANN methods the proposed approach improves and increases the approximation and generalization ability, and adaptability greatly in learning processes of networks. The simulation results have been shown that the method can be applied to the modeling and identification of complex dynamic control systems.
基金This project was supported by the Natural Science Foundation of Shaanxi Province.
文摘High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, the approximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modified CORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to be with a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finite register length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practical applications.
文摘针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐符号高斯近似,基于置信传播算法与联合因子图进行消息传递,用边缘后验概率替代GA-MP中的外部信息以减少运算量,结合阻尼因子提升收敛速度,同时引入概率阈值减少后续更新的节点数,从而使运算复杂度得到有效降低。实验结果表明,改进后的GA-MP算法在保证误码率性能的前提下具有更低的复杂度。
