卫星导航定位系统中伪随机码的研究

伪随机码在扩频通信中得到广泛应用。目前的卫星导航定位系统大多采用扩频通信技术来传输导航信息 ,常用的伪随机码是平衡Gold码。对平衡Gold码的特性和产生方法作了研究 ,对全球定位系统 (GPS)粗码的平衡性作了分析 ,最后给出了在SystemView平台上相应的仿真结果。此研究对开展相关领域的研究工作具有借鉴意义     

基于解析梯度的近地小天体探测机会搜索问题研究

研究近地小天体的探测机会搜索问题.针对交会型探测任务,通过结合变分理论和状态转移矩阵推导了性能指标关于可调参数的解析偏导数,然后在搜索空间中随机生成初始点,并从这些初始点出发利用解析偏导数寻优,从而得到搜索空间内对应潜在发射机会的全部局部极小值点.此方法既在一定程度上保持了传统搜索方法全局搜索的特点,又克服了传统搜索方法的盲目性,因此计算速度获得很大提高.此外该方法可以对探测机会的搜索精度进行有效地控制.     

基于解析梯度的近地小天体探测机会搜索问题研究木

研究近地小天体的探测机会搜索问题．针对交会型探测任务,通过结合变分理论和状态转移矩阵推导了性能指标关于可调参数的解析偏导数,然后在搜索空间中随机生成初始点,并从这些初始点出发利用解析偏导数寻优,从而得到搜索空间内对应潜在发射机会的全部局部极小值点．此方法既在一定程度上保持了传统搜索方法全局搜索的特点,又克服了传统搜索方法的盲目性,因此计算速度获得很大提高．此外该方法可以对探测机会的搜索精度进行有效地控制．     

一种提高CAPS导航通信融合系统保密性的新方法

根据导航通信融合系统的特点,通过伪随机序列码与混沌序列码的复合得到GC(Gold-Chebyshev)序列码,新序列码克服了混沌序列平衡性差的缺点,满足了系统短码的要求,得到的GC序列具有码组数量几乎无限多和序列线性复杂度好的优点。系统以伪随机跳变的方式更换码序列集合,极大地提升了系统的安全性。对换码模式和系统性能进行实验验证,表明复合新码GC序列采用换码模式易于实现可靠通信,还可以有效提高系统的保密性能。     

日珥线光谱的降维法分析

本文提出了多搜索变量的目标函数直接优化法。该方法不涉及目标函数的导数计算,通用性强;同时该方法可控制搜索变量在值域内取值,这在一定程度上保证了解的可靠性。用此方法,本文分析了1984年2月18日太阳边缘环珥的一些Hα谱线,结果表明,本文方法具有收敛半径大,精度高的特点。     

一种北斗二代MEO/IGSO卫星B1频点I支路导航信号的捕获算法及其软件实现

根据北斗二代导航系统扩频信号结构及其性质,研究和仿真了B1频点I支路导航信号的捕获算法,设计了滑动相关器来实现相关,并使用匹配滤波法剥离导航电文上调制的Neumann-Hoffman码。最后对捕获结果进行了误差分析。该算法对接收信号的载波多普勒频移和初始码相位进行粗估计,为导航数据的解调、用户接收机的定位创造了必要条件。     

时间扩频码信号及研究(摘要)

扩频码又叫测距码或伪随机噪声码。人们已对它作了广泛的研究,它的应用已随着对其研究发展而迅速扩展,除应用于通信、雷达、导航及密码学外,还应用于自动控制、计算机、声学与光学的测量、数字式跟踪、测频及数字网络等方面。本文所研究的是最长周期的伪随机序列(m序列)。及其短截式m序列。详细分析了     

GALILEO搜救定位处理的分布式数据融合方法

对遇险目标搜索救援的支持是GALILEO全球卫星导航系统的一项重要民用服务.文章介绍了GALILEO搜索救援子系统(SAR)定位的基本原理.在GALILEO SAR中测量量为时间信号与频率信号,文章详细地给出了两种测量信号的定位方法.基于多传感器信息融合技术,对搜索救援系统中不同测量信号进行综合状态估计.在仿真计算中,采用带噪声的模拟测量数据进行定位,数值计算的结果显示基于多传感器数据融合方法的综合状态估计是可靠的.     

基于先验信息的空间碎片探测方法

提出了一种基于先验信息的空间碎片图像探测方法.该方法通过先验信息,在图像中碎片星像的邻域设置波门,计算波门内的局部背景阈值,辅以相关的判据识别目标.随后使用矩方法计算碎片质心相对波门中心的偏离值,通过线性平移计算碎片质心在整幅图像中的位置.实验表明:该方法复杂度低、便于实现、实时性好,可以高效、准确地探测空间碎片,比较精确地确定碎片的质心位置.     

关于GPS载波相位中的野值周跳与模糊度

对于双频ＧＰＳ接收机,Ｇｉｐｓｙ软件可以对单站载波相位测量中野值,周跳进行自动检测与修复,本文用实测数据对Ｇｉｐｓｙ算法的效率进行评估。计算表明,对Ｐ码伪距的情形,该算法对周跳的修复基本无误;对Ｃ／Ａ码的伪距情形,则会有正负几周的误差。本文提出在Ｇｉｐｓｙ算法中加进小波方法,用来估计模糊度,计算表明,可极大地提高Ｇｉｐａｙ算法的效率。     

Parallel Tree–SPH: A Tool for Galaxy Formation

We describe a new implementation of a parallel Tree-SPH code with the aim of simulating galaxy formation and evolution. The code has been parallelized using SHMEM, a Cray proprietary library to handle communications between the 256 processors of the Silicon Graphics T3E massively parallel supercomputer hosted by the Cineca Super-computing Center (Bologna, Italy). The code combines the smoothed particle hydrodynamics (SPH) method to solve hydrodynamical equations with the popular Barnes and Hut (1986) tree-code to perform gravity calculation with a N × log N scaling, and it is based on the scalar Tree-SPH code developed by Carraro et al. (1998). Parallelization is achieved by distributing particles along processors according to a workload criterion. Benchmarks of the code, in terms of load balance and scalability, are analysed and critically discussed against the adiabatic collapse of an isothermal gas sphere test using 2 × 10⁴ particles on eight processors. The code turns out to be balanced at more than 95% level. If the number of processors is increased, the load balance worsens slightly. The deviation from perfect scalability at increasing number of processors is negligible up to 64 processors. Additionally we have incorporated radiative cooling, star formation, feedback and an algorithm to follow the chemical enrichment of the interstellar medium. This revised version was published online in July 2006 with corrections to the Cover Date.     

Monte Carlo Simulation of Lyα Line Profiles

In this paper, a code for simulating the Lyα line profiles by the Monte Carlo method is introduced. This code is developed on the basis of an idea given by Anne Verhamme et al. and by combining with another simulation method. For different models, the Lyα line profiles under different conditions are simulated. The simulation method of this code is given in detail, and the simulated results are discussed as well.     

Super resolution for astronomical observations

In order to obtain detailed information from multiple telescope observations a general blind super-resolution (SR) reconstruction approach for astronomical images is proposed in this paper. A pixel-reliability-based SR reconstruction algorithm is described and implemented, where the developed process incorporates flat field correction, automatic star searching and centering, iterative star matching, and sub-pixel image registration. Images captured by the 1-m telescope at Yunnan Observatory are used to test the proposed technique. The results of these experiments indicate that, following SR reconstruction, faint stars are more distinct, bright stars have sharper profiles, and the backgrounds have higher details; thus these results benefit from the high-precision star centering and image registration provided by the developed method. Application of the proposed approach not only provides more opportunities for new discoveries from astronomical image sequences, but will also contribute to enhancing the capabilities of most spatial or ground-based telescopes.     

A multidimensional magnetohydrodynamics code based on semidiscrete central WENO and PPM schemes

We present a multidimensional magnetohydrodynamics code based on semidiscrete central Godunov-type schemes and high order weighted essentially non-oscillatory data reconstruction and incorporate elements of the piecewise parabolic method into the reconstruction schemes. This algorithm avoids spectral decomposition into characteristic waves and is easily implemented. We have implemented this algorithm and carried out one and two dimensional tests, which verifies that this code can achieve the accuracy and efficiency to solve the astrophysical problems.     

A GPU accelerated Barnes–Hut tree code for FLASH4

We present a GPU accelerated CUDA-C implementation of the Barnes Hut (BH) tree code for calculating the gravitational potential on octree adaptive meshes. The tree code algorithm is implemented within the FLASH4 adaptive mesh refinement (AMR) code framework and therefore fully MPI parallel. We describe the algorithm and present test results that demonstrate its accuracy and performance in comparison to the algorithms available in the current FLASH4 version. We use a MacLaurin spheroid to test the accuracy of our new implementation and use spherical, collapsing cloud cores with effective AMR to carry out performance tests also in comparison with previous gravity solvers. Depending on the setup and the GPU/CPU ratio, we find a speedup for the gravity unit of at least a factor of 3 and up to 60 in comparison to the gravity solvers implemented in the FLASH4 code. We find an overall speedup factor for full simulations of at least factor 1.6 up to a factor of 10.     

Thinned simulations of extremely energetic showers in dense media for radio applications

This paper presents our results for full 3-D simulations of very-high to ultra-high energy electromagnetic cascades – and the associated coherent Cherenkov radiation – as might be produced by high-energy neutrino interactions in dense media. Using “thinning” techniques, we develop an algorithm based on the existing “ZHS” code, and demonstrate that the new “ZHS-thinned” code can produce fast and accurate results for showers up to . Using ZHS-thinned, we develop new parameterisations for the radiation from showers in ice, salt, and the lunar regolith, with a separate treatment of the megaregolith (deep regolith). Our parameterisations include for the first time a method to simulate fluctuations in shower length induced by the LPM effect. Our results, which avoid the pit-falls of scaling simulations from lower energies, allow improved calculations of the detection probability for experiments searching for high-energy neutrinos using the radio technique.     

GPS接收机的中频信号处理算法研究

该文对GPS接收机的中频信号处理算法进行了研究,内容主要涉及信号捕获、载波恢复和伪码跟踪3部分,详细分析了信号捕获过程中所采用的匹配滤波器法、快速傅里叶算法(FFT)、锁频环(FLL)、锁相环(PLL)以及延迟锁定环(DLL)的算法原理,并对环路滤波器作了相应的阐述,给出环路对应的递推公式．     

On the solution space of differentially rotating neutron stars in general relativity

A highly accurate, multidomain spectral code is used in order to construct sequences of general relativistic, differentially rotating neutron stars in axisymmetry and stationarity. For bodies with a spheroidal topology and a homogeneous or an   N = 1  polytropic equation of state, we investigate the solution space corresponding to broad ranges of degree of differential rotation and stellar densities. In particular, starting from static and spherical configurations, we analyse the changes of the corresponding surface shapes as the rate of rotation is increased. For a sufficiently weak degree of differential rotation, the sequences terminate at a mass-shedding limit, while for moderate and strong rates of differential rotation they exhibit a continuous parametric transition to a regime of toroidal fluid bodies. In this article, we concentrate on the appearance of this transition, analyse in detail its occurrence and show its relevance for the calculation of astrophysical sequences. Moreover, we find that the solution space contains various types of spheroidal configurations, which were not considered in previous work, mainly due to numerical limitations.