XML在列控系统仿真测试平台中的应用

CTCS-3级列控系统仿真测试平台用于CTCS-3级列控系统的技术规范验证、系统研究、方案比较、设备测试评估等。为了使在真实环境中需要人工通知的测试序列执行过程在列控系统仿真测试平台中自动执行,将XML技术引入仿真测试平台,利用XML良好的数据交互性,将文本形式的测试序列文件转化成供仿真平台中仿真测试管理器读取的XML文件,通过仿真测试管理器对仿真测试平台的控制,使测试序列能自动执行。     

一种改进的DSSS信号扩频码估计算法研究

在低信噪比条件下检测出直接序列扩频(DSSS)信号后,要恢复出原始信息,估计出扩频码序列是非常关键的,因此有必要研究DSSS信号的扩频码序列估计算法。提出了一种基于改进的协方差矩阵迭代算法应用于估计扩频码序列。理论分析和计算机仿真实验都表明了该算法能在低信噪比下估计出扩频码序列,与其他一些扩频码序列估计算法如基于投影子空间的算法、基于神经网络的算法相比,具有运算量更小等优势。     

负信噪比直扩信号伪码盲估计方法

给出了一种采用延迟相关积累和信号子空间分析实现对负信噪比直扩（DSSS）信号伪码盲估计的方法。计算机仿真结果表明，该方法可以在-15dB信噪比条件下检测信号并估计出伪码、载波频率等参数，估计结果可以实现非合作解扩解调。     

瑞利信道下的自适应MLSE算法

由于在数字移动通信中要考虑多径和多普勒频移的影响,建立了瑞利时变衰落信道模型,并使用最大似然序列检测算法实现均衡.它的基本思想是在MLSE算法中插入信道估计算法,不断跟踪实时信道变化并及时更新.为降低复杂度,研究了传统的自适应MLSE算法和运幸存MLSE两种经典算法,仿真表明,当多普勒频移较小时,两种算法有相近的性能,...     

基于正交矩阵构造非周期组间互补序列集

基于正交矩阵,该文提出一类非周期组间互补序列集的构造法。构造的非周期组间互补序列集的零相关区长度可灵活设定,且参数达到了理论界限。通过选取二元或多相正交矩阵,可以得到二元或多相非周期组间互补序列集。构造的组间互补序列可以用于同步和非同步码分多址通信系统。     

基才隐马尔可夫模型的蛋白质序列筛选算法

对蛋白质序列筛选算法进行了研究,针对蛋白质数据库中存在大量的冗余序列,提出了一种基于隐马尔可夫模型的蛋白质序列筛选算法。详细阐述了在蛋白质数据库中如何建立隐马尔可夫模型。对模型中主要参数的求解和估计给出了主要计算公式。然后利用所建立的模型对蛋白质数据库进行的序列筛选测试,测试结果表明本文设计的算法对同源蛋白质序列筛选精...     

A parametric method for non-stationary interference suppression in direct sequence spread-spectrum systems

The problem of non-stationary interference suppression in direct sequence spread-spectrum (DS-SS) systems is considered. The phase of interference is approximated by a polynomial within the considered interval. According to the local polynomial Fourier transform (LPFT) principle, the received signal is dechirped by using the obtained phase approximation and the interference is, in turn, suppressed by excising the corrupted low-pass frequency band. For the estimation of polynomial coefficients, we use the product high-order ambiguity function (PHAF), known for its capability to successfully resolve components of a multicomponent polynomial-phase signal (PPS). The proposed method can suppress interferences with both polynomial and non-polynomial phase. In addition, it can suppress both monocomponent and multicomponent interferences. The simulations show that the proposed method outperforms time-frequency (TF) methods, that successfully deal with multicomponent interferences, in terms of the error probability and computational complexity.     

A Polynomial Complexity Optimal Multiuser Detection Algorithm Based on Monotonicity Properties

An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple‐access systems which have constant cross‐correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross‐correlation value.     

A random sequence generator based on chaotic circuits

In this paper, a random sequence generator based on chaotic circuits is presented. Fundamental principle and experimental circuit have been carried out in case of Chua's circuit. The statistical results are in good agreement with probability characteristics of random sequence.