By use of d4 lattice, plvq and zerotree coding ( zr ) are conjoined . zero lattice vectors are disposed by adopting improved zerotree coding . the significant map is scanned twice from down to up and from up to down respectively in order to reduce the computation complexity of zerotree coding 利用d_4格将plvq和性能优异的零树(zr)编码结合起来,采用改进的零树编码处理零格点,并从下向上、从上向下两次扫描重要图,降低了零树算法的计算复杂度。
Secondly, the performance and computation complexity of various kinds of motion estimation algorithms are analyzed and evaluated . a kind of hierachical quasi full search scheme is proposed . its computation complexity is greatly reduced compared with full search while its match effect is still satisfying 其次,研究了各种运动估值算法的运算复杂度和匹配效果,提出了一种分层准全搜索的运动估值方案,在基本保证匹配效果的前提下,大大减少了运算复杂度。
Secondly, the performance and computation complexity of various kinds of motion estimation algorithms are analyzed and evaluated . a kind of hierachical quasi full search scheme is proposed . its computation complexity is greatly reduced compared with full search while its match effect is still satisfying 其次,研究了各种运动估值算法的运算复杂度和匹配效果,提出了一种分层准全搜索的运动估值方案,在基本保证匹配效果的前提下,大大减少了运算复杂度。
Causes small transmission delay, but computation is complex . the other is called dsova, which does not need to know csi, with low-computation complexity and small transmission delay, and is more suitable in the case when side information is unknown . these two algorithms effectively combine the ofdm technology and the sova algorithm in rayleigh channel, resulting in an efficient sova decoding under frequency-selective channel 另一种是不含信道估计的差分sova算法(简称dsova),该算法不必知道csi,计算复杂度低,传输时延小,适用于边沿信息(sideinformation,si)未知的情况,这两种算法将ofdm技术和rayleigh信道下的sova译码算法有机的结合起来,很好地实现了频率选择信道下的sova译码。
Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem . the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10-citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling 首先分析了旅行商问题在穷举搜索法下的工作量;其次给出了求解旅行商问题的hopfield神经网络方法,同时分析了利用人工神经网络求解旅行商问题所存在的问题;最后利用混饨神经网络模型求解10城市旅行商问题和中国旅行商问题。
Research on electromagnetic scattering of complex targets has been received much attention for a long time, the fast inhomogeneous plane wave algorithm ( fipwa ) in this paper performs well in this purpose, and the computation complexity of its multilevel version ( mlfipwa ) is of the same order as the multilevel fast multipole algorithm ( mlfma ) 复杂目标电磁散射研究长期以来广受关注,本文研究的快速非均匀平面波算法,可以快速精确的求解任意复杂目标的电磁散射问题,其多层形式的计算复杂度与多层快速多极子相当。
Based on adaptive transmission, in this paper, several key technologies are studied on the wide-band wireless digital communications . the basic idea is to decrease system spending, optimize the whole system performance, reduce computation complexity, shorten transmission delay, improve the real-time processing capability, and cut cost 本文基于自适应传输的思想,对宽带无线数字通信中的关键技术进行了研究,力图节省系统开销,从整体上优化系统性能,降低计算复杂度,缩短传输时延提高系统的实时处理能力,节约成本。
If the computation complexity is permitted, we can combine two methods together, which is the improvement trend of noise estimation . there are many speech enhancement techniques, such as filtering, correlation of speech, nonlinear processing, spectrum subtraction, and the adaptive wiener filter 语音增强算法,包括滤波法语音增强、利用相关特性的语音增强、非线性处理语音增强、谱减法语音增强、利用wiener滤波法的语音增强、自适应噪声抵消法语音增强等,我们采用的是目前使用最为广泛的基于短时谱的语音增强算法。
As more and more genome sequencing projects are accomplished one after another, the amount of sequence data has been exponentially increased, the demand for efficient alignment algorithm in sequence analysis is increasingly urgent . based on the concept of sequence segmentation, we applied the multiple-stage dynamic programming algorithm in pairwise alignment to devise a new algorithm named samidp and developed the corresponding programs in visualbasic, we find that samidp not only reduces the computation complexity to o ( n ), but also obtains even satisfactory accuracy, and it is expected that the new algorithm will be important in global sequence alignment 基于段与段比对的概念,我们设计了一个用于核酸序列全局比对的新算法samidp(sequencealignmentbasedonmultiplestageintelligentdynamicprogrammingalgorithm),将多阶段动态规划决策算法用于两两序列比对并用visualbasic编程实现,结果发现该新算法在将计算复杂度减小到o(n)的同时,也能够获得较为理想的计算精度,预期将在序列全局比对中起重要作用。
Computing the moment of two-dimensional images using straightforward algorithm needs lots of additions and multiplications . however, operation speed is crucial in many applications, especially in real-time pattern recognition applications . so it is necessary to investigate fast algorithms for reducing computation complexity 用直接方法求取二维图像的矩值需要计算大量的加法和乘法,而运算速度在许多应用(尤其是实时模式识别)中是非常关键的,因而有必要研究减少计算复杂度的矩快速算法。