采用导频子载波的OFDM系统频偏跟踪算法

为了进一步提高多径快衰落环境下,正交频分复用(orthogonal frequency-division multiplexing,OFDM)系统的载波频偏估计精度,研究了利用在OFDM符号中插入的导频子载波进行小数倍频偏跟踪的算法在多径快衰落信道下的频偏跟踪性能.通过与常规的基于循环前缀的跟踪算法进行比较,采用导频子载波的频偏跟踪算法,不仅在高斯白噪声信道下能达到很好的频偏跟踪性能,而且在多径快衰落信道下也能实现更准确的频偏估计,因此采用导频子载波的算法更适合用于多径快衰落信道下的频偏跟踪.     

采用导频子载波的OFDM系统频偏跟踪算法

为了进一步提高多径快衰落环境下,正交频分复用（orthogonal frequency division multiplexing,OFDM）系统的载波频偏估计精度,研究了利用在OFDM符号中插入的导频子载波进行小数倍频偏跟踪的算法在多径快衰落信道下的频偏跟踪性能。通过与常规的基于循环前缀的跟踪算法进行比较,采用导频子载波的频偏跟踪算法,不仅在高斯白噪声信道下能达到很好的频偏跟踪性能,而且在多径快衰落信道下也能实现更准确的频偏估计,因此采用导频子载波的算法更适合用于多径快衰落信道下的频偏跟踪。     

基于导频和循环前缀联合的OFDM系统频率同步算法

正交频分复用（OFDM）是一种高效的数据传输技术,具有良好的抗衰落能力,可实现并行传输.但是OFDM对同步误差十分敏感,特别是频率同步误差.传统的基于导频和循环前缀的算法虽对频偏估计很有效,但计算复杂度较高.该文在联合算法的基础上提出了一种改进的频率同步算法.该算法通过简化最大似然函数降低了频偏估计的计算复杂度并提高了估计性能.通过仿真表明,在信噪比较高时,改进的算法频偏估计性能更优于联合算法.     

OFDM移动通信系统中的最大多普勒频移估计

为了估计移动正交频分复用(OFDM)系统中衰落信道下的多普勒干扰,提出了利用OFDM符号的循环前缀检测最大多普勒频移的方法.在已有的单载波系统多普勒估计算法的基础上,结合OFDM符号已有的循环前缀,通过计算循环前缀的归一化自相关函数,得到最大多普勒频移.在衰落信道下的计算机仿真结果表明,该算法可以准确地估计出最大多普勒频移.该方法只需利用OFDM符号的循环前缀,不需要其他辅助数据或者插入导频,可以方便地应用于现有OFDM系统中.     

无循环前缀正交频分复用多址上行链路处理算法

提出了一种无循环前缀正交频分复用多址(OFDMA)上行链路发射信号帧结构,为消除因无循环前缀造成的正交频分复用(OFDM)符号块间干扰(IBI),接收端对接收信号进行时域过采样,对过采样后OFDM符号中无符号块间干扰部分采用最小均方误差(MMSE)算法进行信号检测.采用最大似然估计算法进行时间同步和频偏参数估计,利用伪随机(PN)序列的相关性对信道参数进行估计.仿真证明:本文提出的频偏信道参数估计算法具有良好的抗噪特性、衰落信道适应性和高的估计精度,而MMSE算法也具有较好的误比特率性能.     

一种适用于高速多径信道下的OFDM联合同步算法

基于正交频分复用系统（OFDM）循环前缀（CP）,尾部数据的能量差分和集相关特性未受到多径衰落干扰的特点,提出了一种新的联合同步算法。仿真表明,与现有算法比较,联合同步算法在多径衰落信道下能够获得准确的频偏估计,且随着多普勒频移的增加,其同步性能会进一步提高,特别适合于高速多径衰落信道下的符号定时同步。     

采样频偏对MB-OFDM-UWB系统影响分析和估计算法

分析了多带-正交频分复用-超宽带系统(MB-OFDM-UWB)中采样频偏对系统性能的影响,并进一步推导出存在采样频偏时接收端符号相位旋转的表达式,结果表明,MB-OFDM-UWB系统中采样频偏对系统的影响不仅与数据帧的符号个数、子载波数相关,而且与循环前缀长度有关。在上述分析的基础上提出了一种基于导频符号的采样频偏估计算法,该方法只需要发送一个OFDM导频符号即可较为精确地估计出采样频偏,方法简单,易于实现。     

时变瑞利信道中存在频偏的OFDM系统性能分析

分析了时变瑞利信道中存在载波频率偏移的正交频分复用(OFDM)系统的性能.首先计算和分析了接收信号不同分量的功率(期望信号、载波间干扰、噪声),然后给出了16-QAM正交频分复用系统的误比特率.理论分析与仿真结果表明:(1)频偏和信道变化极大地降低了0FDM系统的性能;(2)由频偏或信道变化造成的载波间干扰主要集中在循环相邻的几个子载波边界,这一结论对于开发低复杂度载波问干扰消除算法非常有用;(3)频偏对正交频分复用系统性能的影响可等效为信道变化的影响,提出了一个包含载波频偏的时变信道模型.     

基于MATLAB的OFDM多普勒频移估计算法仿真分析

在移动正交频分复用OFDM系统中,该文介绍了基于循环前缀的最大多普勒频移估计算法,并运用MATLAB软件搭建系统仿真平台进行仿真分析,仿真结果表明：在假定系统符号已经同步的情况下,循环前缀长度的选取对多普勒估计的精度有一定的影响。     

一种适用于正交频分复用通信系统的信道估计盲算法

提出了一种适用于正交频分复用(OFDM)通信系统的信道估计盲算法,给出了该算法的理论基础和计算机仿真结果.该算法以子空间方法为基础,并利用了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.