对流层散射信道下MIMO-OFDM系统性能分析

针对对流层散射信道下的通信存在信号微弱和多变的问题,采用MIMO-OFDM技术能够有效解决。论文分析了对流层散射信道的突出特性,建立了散射信道模型;在MIMO-OFDM系统模型基础上,结合实际进行了参数选取,搭建了散射信道下MIMO-OFDM系统实验平台;在验证散射信道下MIMO-OFDM系统性能的基础上,对不同传输速率和不同调制方式在同一散射信道下的系统性能进行了仿真分析。仿真结果表明,MIMO-OFDM在高速率信号传输情况下带来的信道容量的提升是明显的,在满足系统BER要求前提下,能够实现高速率散射通信;在高速率传输时,64QAM调制更加有利于降低散射通信中的BER,而BPSK、QPSK和16QAM调制方式差别不大。该仿真为散射通信设备中多速率多体制调制解调器设计与优化提供了思路,为实现大容量高可靠度散射通信提供了方向指导。     

MIMO-OFDM系统自适应排序K-best检测器研究

针对IEEE 802.11n MIMO-OFDM系统提出一种基于相干带宽估计的自适应排序K-best检测器(adaptive sorted K-best detector,ASK-best).通过皮尔逊相关系数(Pearson correlation coefficient)对相干带宽进行估计,据此将频带有效子载波划分...     

一种低复杂度的MIMO检测软输出算法

新一代无线通信系统均采用多流空分复用、高阶调制、高码率信道编码等技术以提高吞吐量。针对使用高阶调制的高阶MIMO(Multiple Input Multiple Output)系统,研究低复杂度的检测算法和软输出算法是降低接收机整体复杂度的关键一环。选定了复杂度低、易于硬件实现的K-Best为MIMO检测的搜索方法,在探讨了几种近似的次优计算算法基础上,提出了一种复杂度低、性能较好的K-Best软信息简化算法——限幅替代法。仿真结果表明,该方法无论是性能还是复杂度都全面占优。因此,适合用于新一代无线通信系统的MIMO软输出检测。     

宽带高阶OFDM调制解调的软件无线电研究

针对IEEE802.11a标准中OFDM调制解调原理,结合软件无线电的思想,在Matlab/Simulink的环境下,用SystemGenerator进行64QAM-OFDM部分调制解调模块的设计与实现.设计中采用了64QAM对数据符号进行调制,可以有效提高系统的频带利用率.仿真结果表明,所设计的64QAM-OFDM系统模型具有较高的可靠性.     

高阶MIMO检测中的低复杂度软判决算法研究

新一代无线通信系统均采用了多流空分复用、高阶调制、高码率信道编码等技术以提高吞吐量。针对使用高阶调制的高阶MIMO（Multiple Input Multiple Output）系统,研究低复杂度的检测算法和软输出算法是降低接收机整体复杂度的关键一环。本文选定了复杂度低、易于硬件实现的K-Best为MIMO检测的搜索方法,在探讨了几种近似的次优计算算法基础上,提出了一种复杂度低、性能较好的K-Best软信息简化算法——限幅替代法。仿真结果表明,该方法无论是性能还是复杂度都全面占优。因此,适合用于新一代无线通信系统的MIMO软输出检测。     

多载波OFDM与单载波QAM传输系统性能比较

为了研究多载波正交频分复用(OFDM)与传统单载波正交幅度调制(QAM)系统传输性能,文章基于无线局域网IEEE 802.11a标准,分别在高斯白噪声(AWGN)信道和存在码间干扰两种情况下,利用MATLAB比较多载波OFDM和单载波QAM系统的可靠性与计算复杂度.结果表明,在两种信道环境下,多载波OFDM系统的传输可靠性能均优于单载波QAM,但增加了计算复杂度.     

MIMO-OFDM系统中降低PAPR的SLM算法的研究

OFDM技术存在高峰均功率比(PAPR)问题,高PAPR要求系统功率放大器具备较大的线性放大范围以避免传输信号的频谱扩散和非线性失真,同时还会增加A/D和D/A转换器件的复杂度,导致系统性能严重下降。显而易见,作为MIMO技术和OFDM技术结合产物的MIMOOFDM系统也受到了高PAPR的影响。本文搭建了MIMO-OFDM仿真模型,实现了选择性映射(SLM)算法,并研究了不同序列数、不同调制方式对SLM算法的影响。仿真结果表明:随着序列数的增加,SLM算法的峰均功率比将会降低,但是其复杂度也会随之增大; QPSK调制降低系统PAPR的效果都最佳,其次是16QAM调制方式,而64QAM调制的效果最差。因此,在使用SLM算法时,增加序列数并且选用QPSK调制方式更利于降低MIMO-OFDM系统的PAPR值。     

多输入多输出无线系统的迭代可配置树型搜索检测

提出了一种复杂度低的,应用于多输入多输出(MIMO)系统迭代接收机中的迭代可配置树型搜索(IRTS)检测方法.不同于最优的最大后验概率检测器对所有可能的发送符号向量进行完全搜索,该算法仅处理对检测器的软输出有较大贡献的符号向量.IRTS算法首先基于最小均方误差(MMSE)准则估计发送符号的可靠度;然后依据此可靠度对发送符号和信道矩阵进行排列来构造可配置的树型结构;并以该树型结构进行宽度优先搜索.在准静态信道条件下的仿真结果表明,即使在相对较小的搜索序列数目的情况下,IRTS算法也具有优越的性能.     

OFDM性能的模拟研究

OFDM（正交频分复用）是一种多载波宽带数字调制技术，它能有效地克服传输中的多径干扰和消除码间串扰，适合于高速率的地面信道视频传输．就OFDM技术进行了较为详尽的分析，并对OFDM的传输特性进行了基于FFT算法实现Matlab软件模拟及模拟结果分析．仿真中采用16QAM和QPSK2种调制进行系统仿真比较分析，结果表明，采用QPSK调制解调OFDM系统的性能优于采用16QAM调制解调的OFDM系统．     

基于FPGA的QAM调制器的设计

通过对QAM调制原理的分析,提出了16QAM系统的FPGA建模方案,给出了仿真波形。结果表明,设计方法正确,方案可行,能够实现数字信号的16QAM调制。同时,其实现的基本方法和基本思想亦为基于FPGA的数字调制系统的设计奠定了较好的基础。     

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.