Because of the spectral line splitting of the burg algorithm , the recursive algorithm of the ar model , we choice the hamming weighted burg algorithm in this paper . the modified burg algorithm can weaken the spectral line splitting effectively . however , the ar model can ’ t gain the phase of the inter - harmonics 由于ar模型的递推算法burg算法存在谱线分裂现象,文中选择使用hamming窗加权的burg算法来递推ar模型,修正后的burg算法明显减轻了谱线分裂现象,具有较好的抗噪声能力,但无法得到间谐波的相位信息。
Based on a systematic discussion on the contents , characteristics and the up - to - now accomplishments of these three operations in cagd , we present our researches in three ways as follows : ( 1 ) efficient evaluation for parametric curves and surfaces based on generalized ball bases based on the generalization of mathematical model of surface lofting program in the consurf system , two generalized ball surfaces and the recursive algorithms for evaluating them are given . furthermore , the conversion algorithms from bezier form of a surface to these two generalized ball forms are presented 在系统地论述cagd中此三类运算的内容、特点、已有研究成果的基础上,就以下三方面给出了研究成果: ( 1 )基于广义ball基的参数曲线曲面快速求值以前英国航空公司consurf系统机身模线程序数学模型的推广为基础,定义了两类广义ball基曲面,给出了求值的递推算法,推导了b zier曲面到这两类曲面的转换算法
Two block time - recursive algorithms are developed for the efficient and fast computation of the 1 - d rdgt coefficients and for the fast reconstruction of the original signal from the coefficients in both the critical sampling case and the oversampling case . the two algorithms are implemented respectively by a unified parallel lattice structure . and the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster method for the computation of the discrete gabor transforms 首先论证了一维rdgt系数求解算法和由变换系数重建原信号算法,不论是在临界抽样条件下还是在过抽样条件下,都同样具有块时间递归特性,并提出了相应的块时间递归算法及其并行格型结构实现方法,计算机模拟验证了并行格型结构实现的可行性,计算复杂性分析与比较也说明了rdgt块时间递归算法的并行格型结构在计算时间方面所具有的高速和高效性能。
Therefore , the blind beamforming algorithm could keep up with the moving targets more quickly , which is important in practical communication systems . furthermore , the recursive cma to fast track several cm targets is provided . the simulation results show that it takes about one seventh of the time for the recursive algorithm to track the targets than that of the traditional algorithm 针对多个恒模用户信号,具体给出了快速跟踪移动目标的递归恒模算法,计算机仿真结果表明,使用新算法跟踪移动目标所花费的时间是传统算法独立地进行每一次波束形成所花费时间的七分之一。
The fma need the high order hankel function , in chapter 3 the algorithm of calculating the high order hankel function of the second kind is discussed . because of the low effectivity and unsteadiness to use the recursive algorithm to calculate the high order hankel function of the second kind , the paper introduces a kind of new fast algorithm to solve the problem . the worked result indicates : the new fast algorithm is a kind of precise algorithm 由于快速多极子法计算中要用到高阶汉克尔函数,在第三章中,主要针对利用递推算法求解高阶汉克尔函数时速度较慢和可能存在不稳定的问题,给出一种快速计算高阶汉克尔函数方法,最后给出了用快速多极子法计算的四个导体柱体散射截面。