协作通信系统中的一种高效分集传输技术

研究协作通信系统中结合空时分组码与频域均衡的传输方案,采用判决反馈与干扰抵消等算法对该方案进行优化. 中继节点对发射信号进行空时分组编码后发送,接收机将收到的信号做快速傅里叶变换处理,再进行空间-频域的联合均衡,最后变换回时域判决,即可得到发送信息的估计结果. 该方案可获取中继提供的协作分集增益,且频域处理复杂度很低. 本文通过判决反馈和干扰抵消等信号处理手段降低均衡过程带来的信噪比损失,提高了该算法在协作通信信道下的传输性能,计算机仿真结果表明,当信噪比为12 dB时,新算法可将原算法的误码率从10-2以上降低到10-3以下.      

协作通信中一种高性能空时二维RAKE接收算法

将空时二维RAKE接收机理引入异步协作通信系统,提出了一种高性能RAKE接收算法.首先利用该接收机对发送信息进行粗估计,并判决获得估计结果,给出发射信号的各条多径分量;然后将多径分量依次从接收信号中抵消,以消除所接收信号中由多径衰落产生的符号间干扰,从而获得所期望的直达路径分量.对直达路径分量按照空时分组码的合并译码准则进行空时合并,获得空间分集增益.在此基础上通过判决反馈、循环迭代进一步降低误码率.仿真结果表明,当信噪比高于5,dB后,新算法可显著提高传统空时RAKE接收机的性能.     

基于极化分集的DF机会中继协作通信系统性能分析

提出对机会中继协作通信系统节点配置极化天线,实现节点到节点无线信号的极化分集,达到通过改善通信链路质量来提升DF机会中继协作通信系统整体性能的目的。由于电磁波信号在传播过程中经过地表及障碍物多次反射、折射、散射以及极化偏转,协作节点和目的节点配置的极化天线接收到的两路极化分集信号具有一定相关性和功率不平衡特性。研究了极化分集信号存在相关性和功率不平衡特性对机会中继协作通信系统性能的影响。结果表明,即使两路极化分集信号具有一定的相关性和功率不平衡特性,DF机会中继协作系统在相同信噪比和相同的信道衰落环境下,性能指标也优于未采用极化分集技术的DF机会中继协作通信系统。     

瑞利衰落信道中增量中继协作分集网性能研究

协作分集是利用单天线的辅助节点组成虚拟天线进行通信的一项技术,它通过使用中继节点向信宿转发信源信息获得空间分集.与普通的协作分集相比,它限制中继只处理信道条件差的信号,从而可以节约信道资源.协作分集网可以利用目的终端的反馈信息提高信道利用率,当信宿端提供传错的反馈时,中继才会重传信源信号,并且将信源信号和中继转发的信号整合在一起.在这篇论文中,使用放大中继模式研究在独立的瑞利衰落信道中增量中继协作分集网的性能,并进行了仿真.结果表明:和普通的协作分集网相比,增量中继协作分集网降低了误码率,提高信道利用率.     

采用随机酉矩阵调制的协作分集传输算法

针对分布式空时编码的最大比合并算法(MRC-DSTC)中处理矩阵存在零矩阵的问题,提出了采用随机酉矩阵调制的协作分集传输算法(RU-CD)。在中继节点,该算法首先利用随机生成的酉矩阵对中继节点各个天线上的接收信号进行处理,并通过正交扩频码序列将多个时隙的信号线性合并,随后再通过共轭处理使得中继发送的信号仅占用2个时隙传输;在目的节点,该算法可以利用复信号特性进行解码,实现发送信号实部和虚部的独立解码,因而降低了解码复杂度。仿真结果表明,在系统具有单中继节点以及2个中继节点的条件下,RU-CD算法分别比MRC-DSTC算法的误比特率降低了3dB和5dB左右。     

协作机会波束成形门限算法及性能界分析

节点参加协作波束成形会增加复杂度和能耗,因而中继处理方法和协作区域的选择对整个协作网络非常重要.协作机会波束成形算法,仅选择部分节点发送信号使得目的节点接收信号近似相干叠加,降低了实现复杂度,但最优节点选择矢量的计算复杂度随中继节点数呈指数增加.为了降低计算复杂度,提出了协作机会波束成形的门限算法,并讨论了最优协作区域的大小.理论分析表明,目的节点接收信噪比随节点密度线性增加,且最优协作区域仅覆盖源节点周边有限区域.     

基于神经网络的变换域通信系统接收技术

提出了一种不须要估计本地基函数的变换域通信系统接收机接收方法.详细分析了接收机的接收原理,以相关解调信号能量最大化为目标构建了接收机最优化接收模型,通过对模型求解得到了接收数据自协方差矩阵的最大特征值向量,此向量可作为接收端基函数实现最佳接收,从而引入基于Hebbian学习训练的神经网络完成最大特征值向量的自适应估计与数据接收.仿真结果表明:当算法收敛时,作为基函数估计的网络连接强度矢量与发送端基函数基本一致,并且当发送端改变基函数时,算法依然能够实现准确跟踪.系统的接收性能与收发两端基函数一致条件下的接收性能基本一致,当算法迭代次数为300,误码率为1×10-4时,系统的信噪比损失可小于1dB.     

协作分集中的移动中继研究

协作分集是近几年无线通信技术的研究热点.在协作通信中合理的选择中继能给系统带来更大的增益,进一步提高系统性能.主要研究了在中继中使用放大转发协议,接收端使用提高的信噪比合并方式,中继处于不同位置下的协作分集系统的性能,并对各种情况进行Matlab仿真,对仿真结果进行比较和分析.仿真结果表明,在中继、发送端和接收端三者的距离之比为1∶0.5∶0.5时,系统能够获得较好的性能.     

基于LDPC编码的混合转发协作模型

为有效解决LDPC编码在中继协作系统应用中存在的问题,提出基于LDPC编码的混合转发协作模型(HF-LDPC).根据放大转发(AF)和译码转发(DF)特点,当信道不好时,中继采用译码放大转发模式;而当中继完全正确译码时,中继切换到译码转发模式.同时充分发挥LDPC码字内码元间固有的相关性,通过不同的用户发送码字的不同部分,采用LDPC和-积译码算法,方案可获得分集增益和编码增益.仿真结果表明:基于LDPC 编码的混合转发协作模型性能优于其他协作模型,具有较好性能.     

面向无人机中继通信平台的混合网络编码算法

针对现有远距离中继通信系统吞吐率较低的问题,提出了一种面向无人机移动中继平台的混合网络编码算法。该算法综合考虑网络编码策略和空地信道状态,根据用户实时信噪比选择编码方式。根据循环往复式的无人机飞行轨迹和视距信道(LoS)条件,得出远距离用户与无人机中继平台间的信噪比和误码率;引入用户信噪比约束和无人机位置约束,根据无人机与用户间的信噪比和误码率求解出最优通信方式转换时刻;无人机中继平台在转换时刻前后分别采用三时隙网络编码方式和两时隙直传方式进行数据包的接收和发送,从而有效提高中继通信系统整体吞吐率。实验结果表明：当用户间距离为1 600 m、无人机飞行半径为600 m、飞行速度为10 m/s时,混合网络编码算法与传统三时隙移动中继通信算法相比可提升28.42%的系统总吞吐率,并降低17.8%的吞吐率平均变化率,体现出较高的通信效率和系统稳定性,具有良好的应用前景。     

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.     

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.     

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).     

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.