基于渐消Kalman滤波的MIMO-OFDM信道估计

针对快时变信道明显的频率选择性,提出了采用Kalman渐消记忆滤波的估计方法.信道采用AR模型建模,并利用LS算法估计时变信道的衰减因子.仿真表明:快时变环境下,所提算法的估计性能优于LS信道估计和传统的Kalman滤波算法估计.     

线性时变信道模型下的OFDM性能及误差分析

当归一化多普勒烦移小于0.1时,信道的时变性是近似线性变化的.文中研究了线性时变信道下OFDM系统的ICI干扰,并分析了线性时变信道模型的系统误差.分析表明,采用线性模型对信道建模时,系统存在建模误差和近似计算误差,同时信道平均建模误差比计算误差大了约7 dB.     

水声通信网络信道建模与仿真研究进展

水声通信网络在海洋目标定位和导航、资源勘探和开发、环境感知和监测等领域有重要应用,其中水声信道特性研究及其建模与仿真是建立通信网络的基础,而目前水声通信网络中的信道建模与仿真尚未有公认的标准方法.因此,基于对水声信道传播特性的分析,探讨了典型水声信道特性给水声通信网络设计带来的挑战;对比了经验模型、声场模型、基于本征路径的多径信道模型和基于统计特性的时变信道模型等水声信道模型,仿真结果表明:水声信道结构的变化明显影响接收性能;阐述了基于水声信道特性的水声网络仿真工具和方法,分析了其特点;最后进行了总结,并展望了未来水声通信网络信道建模与仿真的发展方向.     

时变信道下一种低计算复杂度的信道估计算法

在时变信道中正交频分复用(OFDM)系统下传统信道估计方法存在估计性能差、计算复杂度高的问题.为此,文中提出了一种双对角线性最小均方误差(DD-LMMSE)的信道估计方法.首先建立基于基扩展模型(BEM)的系统模型,然后进行两次对角线性最小均方误差估计得到BEM系数,从而估计出信道的时域冲击响应.仿真实验结果表明,该方法不管在慢时变信道下还是在快时变信道下均具有良好的估计性能,且计算复杂度低.     

一种新的基于分布式压缩感知的时变稀疏信道估计

对OFDM(Orthogonal Frequency Division Multiplexing)系统中快时变稀疏信道估计进行了研究,采用CE-BEM模型(Complex Exponential-Basis Expansion Model)对时变信道进行建模。由于信道是稀疏的,所以对应的CE-BEM基的系数也是稀疏的,由此将估计信道的抽头响应问题转化为求解稀疏CE-BEM系数的问题。针对现实稀疏度未知的场景,提出了一种稀疏度自适应的分布式压缩感知(Distributed Compressive Sensing,DCS)算法。考虑到导频放置对性能影响的重要性,提出了一种新的放置方式。仿真结果表明,本文算法有效地提升了估计性能。     

高速移动环境下信道估计的性能分析

高速移动中,多普勒频移导致的多普勒扩展会破坏OFDM信道中子信道之间的正交性,引起载波干扰,使得时变信道估计算法变得十分复杂。基函数展开模型通过采用确知的少量基函数来近似时变信道,从而简化了信道估计复杂度。在常见的3种基函数展开模型的基础上,分析了子载波间干扰、模型参数以及移动速率对基函数信道估计算法性能的影响,并进行了仿真验证。     

面向5G高速移动场景的基于GFDM调制的BEM-wiener信道估计算法

针对5G中的高速移动场景,设计了面向快时变信道的导频结构,对快时变信道下系统ICI进行了分析,并提出了一种基于GFDM数据块的BEM 2维滑动维纳滤波信道估计方案以降低ICI所带来的性能损失.仿真结果能够有效地抑制高速移动带来的频域弥散,降低相邻子载波间的干扰,同时由于滑动维纳滤波的采用,降低了运算的复杂度.     

对称α稳定分布噪声下基于Kalman滤波迭代信道估计

为了提高加性脉冲噪声衰落信道环境下的通信传输性能,提出了一种适用于对称稳定分布噪声的基于Kalman滤波的迭代信道估计方法。该方法利用时变信道的先验统计信息将信道建模为一阶自回归模型,并将最小分散系数准则应用于Kalman滤波信道估计方法中,从而更充分地利用了时变信道和非高斯噪声的先验信息。在较为严重的时变脉冲信道下,该方法比最小平均p范数估计方法性能要优约2 dB。仿真结果表明:该方法能消除脉冲噪声和稳定分布二阶矩不存在等不利因素的影响,能快速准确地跟踪并预测时变信道的变化,且性能显著地优于传统的最小均方误差和最小平均p范数信道估计方法。     

多天线有限反馈系统下基于Grassmannian流形的信道预测

针对时变信道下多天线有限反馈预编码系统存在反馈延迟的问题,在充分利用信道的时域相关性的基础上,提出将多天线时域相关信道的方向向量建模于Grassmannian流形上,利用Grassmannian流形的测地线对时变信道进行跟踪预测,以补偿反馈延迟对于系统性能的影响.同时,从Grassmannian流形的几何特性入手,针对Grassmannian流形的切空间提出了一种自适应的高分辨率动态聚焦码本.计算机仿真表明,基于Grassmannian流形的信道预测预编码的系统性能明显优于无记忆量化预编码,而且采用高分辨率动态聚焦码本对时变信道的跟踪性能也优于采用固定码本的信道预测.     

基于联合稀疏模型的OFDM线性时变信道估计

为了进一步提高OFDM线性时变信道估计性能,利用信道抽头的时域稀疏特性和相关性,提出一种基于联合稀疏模型的信道估计方法.首先,将线性时变信道模型下对连续多个符号周期的信道估计转换成一个联合稀疏重构模型;其次,采用基于测量矩阵互相关性最小化的分组导频设计准则,在应对子载波干扰的同时,保证了稀疏重构算法的性能;最后,设计一种基于循环并行树的分组导频优化算法.仿真结果表明:与传统线性时变信道估计方法和联合稀疏模型下的信道估计方法相比,所提方法所需导频数量少,信道估计性能更好,同时便于工程应用.     

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.