归一化LMS算法自适应滤波器的MATLAB仿真与DSP实现

固定步长LMS算法自适应滤波器在收敛速度与稳态误差之间存在矛盾,变步长LMS算法的步长因子是变化的,能够灵活避免此矛盾.分析了两种变步长LMS算法自适应滤波器基本原理,先使用MATLAB对其分别进行仿真,之后应用SZ-EPP5416评估板对其分别进行了DSP实现,仿真结果与DSP实现都表明变步长LMS算法改善了收敛速度与稳态误差间矛盾,但归一化LMS算法能更好地改善固定步长LMS算法的矛盾,具有更快收敛速度与更小稳态误差.     

一种改进的解相关LMS自适应算法

针对变步长LMS自适应滤波算法在输入信号高度相关时,收敛速度下降导致性能下降的问题,提出了一种改进的解相关LMS自适应算法,该算法引入解相关原理和归一化处理,用输入向量的正交分量来更新滤波器权系数,有效加快了算法的收敛速度,且稳态误差小,使得算法在有色输入和大范围的动态输入下都能保持良好性能.     

一种新的变步长LMS算法

对已有的一些变步长LMS自适应滤波算法进行了分析,在此基础上提出一种改进的变步长LMS算法.该算法建立了步长因子与误差信号和权系数变化之间的非线性函数关系,从而使权向量异步更新达到最佳.仿真结果表明,该算法具有更快的收敛速度,更小的稳态误差及更平稳的收敛过程.     

LMP凸组合算法的稳态性能分析

为进一步解决最小p阶均方算法(least mean p-pow-er,LMP)收敛速度和稳态误差之间的矛盾,提高自适应算法的性能,提出对算法采用不同p值和不同步长进行凸组合(combination of least mean p-power,CLMP)的方案.该方案在高斯环境下将独立的大步长LMP1滤波器和小步长LMP2滤波器(p1 ＞p2)并联,利用分离假设条件进行稳态误差表达式的理论推导.仿真实验证明,在高斯平稳环境下组合滤波器稳态性能较单一滤波器表现得更好,为自适应滤波算法研究提供了一种新思路.     

一种新的可变步长LMS算法研究

在分析基本最小均方误差算法(LMS)和归一化最小均方误差算法(NLMS)的基础上,提出了一种新的可变步长LMS算法(NVLMS)和它的改进算法(MNVLMS).仿真结果显示,NVLMS算法对于平稳过程中的滤波器,能获得较快的收敛速度和较小的稳态误差.在非平稳环境下,MNVLMS算法在减少算法复杂度的情况下能获得和NLMS算法一样的收敛速度和稳态误差.     

一种基于交互投影原理的快速自适应横向传播建模算法

针对最小均方建模算法用于长记忆有限脉冲响应滤波器模型时收敛速度慢的问题,提出了基于交互投影原理的横向传播建模算法(简称为TPLMS算法).该算法将滤波器按质因数分解为多组滤波器组合,从最短的子滤波器分组开始迭代,逐步过渡到原滤波器,在每一时刻,采用最小均方算法顺序求解分组内各子滤波器的权系数.在迭代过程中,由于滤波器的长度缩短,从而可采用更大的步长,使权系数以更快的速度收敛.随着子滤波器长度的逐步增加,可以逐步减小迭代步长,从而得到较低的失调误差.仿真结果表明,TPLMS算法的收敛速度优于传统的最小均方算法和变步长最小均方算法.该算法收敛速度快,特别适用于长记忆有限脉冲响应滤波器模型的自适应建模.     

有色环境下的LMS算法研究

研究有色噪声和非平稳信号(如回声取消)情况下自适应滤波,提出解相关自适应最小均方(LMS)算法。首先设计出自适应预滤波器同时对输入信号和误差信号解相关,使输入信号和误差信号的白化,然后证明该方法并不改变维纳最优解,最后提出改进的变步长解相关自适应LMS算法。仿真实验表明:无论在有色噪声环境下还是白噪声环境下,该算法都改善了LMS算法性能,即提高了收敛速度又减小稳态误差。     

变步长自适应滤波算法的谐波检测

为提高自适应滤波算法的收敛速度,并降低其稳态误差,建立了LMS算法理论最优步长值与误差信号和输入信号之间的关系,提出了一种新的变步长LMS自适应谐波检测算法。该算法的优点是:根据误差信号的平方时间均值估计来调节步长因子,克服了以往算法在自适应稳态阶段步长调整过程中的不足。即使待检测信号的信噪比较低,检测过程也具有较快的动态响应速度和保持较小的稳态失调噪声。计算机仿真表明,该算法具有更好的收敛精度。     

多步梯度下降的变步长NLMS算法

如何选取一个合适而可靠的步长来折中归一化最小均方(Normalized Least Mean Squares,NLMS)自适应算法的收敛速度以及稳态误差,一直是自适应NLMS算法应用中未能很好解决的问题.针对这个问题,本文提出了一种多步梯度下降的变步长NLMS自适应算法.分析表明:该算法在利用固定的小步长参数来保证小的稳态误差的同时,通过调整动量项来加速自适应算法的收敛速度,从而很好地解决了自适应NLMS算法应用中收敛速度和稳态误差的平衡问题.理论分析给出了调节动量项的步长参数和算法收敛性及稳态误差之间的关系.仿真结果证明了上述分析的正确性.     

一种基于离散小波变换的自适应滤波新算法

将小波变换、变换域自适应算法和变步长自适应算法相结合，得出了一种基于离散小波变换的自适应滤波新算法(NDWT-LMS)，该算法可以有效地降低输入信号的自相关程度，克服固定步长因子所导致算法在快的收敛速度和较低的稳态误差之间存在的矛盾。计算机仿真结果表明该算法与LMS算法相比具有更快的收敛速度和更小的失调噪声，可以很好地应用于自适应系统中。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.