自编码扩频通信系统中码元同步问题的研究

基于自编码扩频在传输数字信息时能实现扩频码动态可变的特性,讨论了自编码扩频的通信原理,并针对自编码扩频通信系统中的同步问题,提出了扩频码产生的新方法。通过分析表明,该方法产生的扩频码具有随机性和动态可变性,而且在接收端容易实现同步。     

一种改进的M元扩频通信算法

针对采用码相位循环移位获得的M元扩频需要额外同步信息的问题,提出一种改进型扩频通信算法.该算法采用m序列及其倒序序列构成系统扩频码集;在同相支路上利用扩频码的码极性调制进行传输,同时在正交支路利用扩频码码相位调制,实现M元扩频.该算法利用2种扩频方式的自身特点可快速准确地获取载波相位信息,具有不需要额外提供同步资源的优势.仿真结果表明,该算法可有效提高系统资源的利用率.     

M元扩频信号的一种差分检测方法

提出了一种M元扩频信号的差分检测方法,发端将输入的串行数据转换为并行数据,然后进行M元差分编码、M元扩频编码和载波调制。为了降低了组合相关干扰和选码的难度,发端使用了修正的循环扩频码进行M元扩频。这种扩频码是在原型扩频码的基础上分别添加循环前缀和循环后缀后得到的。接收端利用一个SAWTDL器件对接收信号进行相关检测,根据M元扩频码的编码规则,SAWTDL器件输出的自相关峰之间的间隔包含了发送的数据信息,接收机通过对相邻自相关峰出现的时间间隔进行差分译码,即可恢复出数据信息。该方法只需要一个SAWTDL器件就可实现对M元扩频信号的相关检测,简化了接收机的结构。论文对系统的误码性能和数据传输能力进行了分析,仿真结果与理论分析的结论一致。     

基于RTT编码的不可恢复隐蔽信道的构造

为了提高隐秘信息的安全性,提出了一种具有不可恢复性的网络时间隐蔽信道。将实时获取的网络特征往返时延(RTT)的值嵌入包间间隔中,使隐蔽信道的时间特征随着网络状况实时变化,并在发送方和接收方采用前向纠错编码(Tornado)对隐蔽信道进行前向纠错。实验分别搭建了现有隐蔽信道与新型隐蔽信道的发生器,根据不同网络状况,对传输速率和传输正确率进行对比实验。实验结果显示,在保证较高的解码正确率的同时,新型隐蔽信道的传输速率随着网络状况的不同而变化,对网络情况有一定的适应性,并且通过将实时网络特征编码到新型隐蔽信道中,提升了隐蔽信道整体的数据安全性和不可恢复性。     

一种TD-SCDMA系统局部最优化码规划算法

时分同步码分多址(TD-SCDMA)系统的扩频码和扰码均为短码,其复合扩频码出现高概率的强相关性,易造成较大干扰,影响网络尤其是数据业务的服务质量.在分析码资源相关性及复合码字分组的基础上,提出一种基于图论的TD-SCDMA系统局部最优化码规划算法,对网络中各小区可用的下行同步码及扰码择优分配,以降低相邻小区间干扰.利用该方法对某现网案例进行重新码规划,比原规划方案干扰概率大为降低,在TD-SCDMA网络码规划中具备较高应用价值.     

窃听双向协作网络机会中继选择方案的保密性能分析

对于多中继、窃听双向协作网络,研究使用机会中继选择和模拟网络编码技术来增强窃听系统物理层安全性.具体地,窃听双向协作网络的通信过程共3个时隙.第1和第2时隙,两信源分别发送消息到中继节点;第3时隙,根据最大最小中继选择方案,选取一个成功解码两信源消息的中继节点.使用模拟网络编码技术将两信源消息混合,把混合消息广播给两信...     

使用网络编码技术的同步传输方法

提出基于网络编码的同步传输方法,分析传统传输和分步传输、同步传输的网络编码传输方法,给出相应的归一化吞吐量.仿真结果表明:在低误码率下,相比于其他传输方法,基于网络编码的同步传输方法能够更好地减少传输时隙,有效地提高网络吞吐量.     

GALILEO/GPS中频接收的同步性能研究

本文针对GALILEO/GPS中频接收机同步跟踪性能问题进行研究。主要进行GPS扩频信号和GALILEO BOC(m,n)信号的自相关函数峰值的比较,GPS/GALILEO接收机码跟踪、载波跟踪的速率精度的比较,其中码跟踪采取了延迟锁相环(DLL),载波跟踪采用costas锁相环。从仿真的结果可以看出,扩频码自相关函数具有单峰值,而BOS(m,n)信号自相关函数具有多峰值的特点,GALILEO接收机具有锁相速度快、精度高的特点。     

基于扩跳频相结合的TDMA信号同步干扰研究

针对电磁频谱资源日趋紧张、电子对抗异常激烈的严峻形势以及抗干扰在未来战争中的突出地位,在分析TDMA时隙同步信号的组成、形式、作用后,提出了扩频与跳频相结合TDMA的抗干扰措施,以保证信号传输的安全性.同时,为防止敌方截获我方通信内容,对扩跳频与TDMA信号同步相结合的时隙干扰进行了分析.通过侦察时隙同步信号、识别时隙同步段以及发送时隙同步干扰信号等步骤,增强信号的抗干扰能力.本抗干扰方法对相关干扰设备的研发具有一定的参考价值.     

基于纠删码的低时延卫星时隙ALOHA接入方式

对时隙ALOHA(slotted ALOHA,SA)进行卫星接入的冲突问题进行分析,提出了一种基于纠删码的时隙ALOHA接入方式.该方式将突发数据等分并以包为单位编码,使生成的编码包序列能够通过纠删功能恢复冲突数据包,以实现容忍时隙冲突、缩短接入时延的目的.针对编码策略选取的问题,研究了定长编码策略和喷泉码策略对接入性能的影响.仿真结果表明,基于纠删码ALOHA能有效改善用户接入的时延性能,且喷泉码策略和定长编码相比,性能更为优良.     

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.