The vulnerability of geometric sequences based on fields of odd characteristic

A new method of cryptologic attack on binary sequences is given, using their linear complexities relative to odd prime numbers. We show that, relative to a particular prime number p, the linear complexity of a binary geometric sequence is low. It is also shown that the prime p can be determined with high probability by a randomized algorithm if a number of bits much smaller than the linear complexity is known. This determination is made by exploiting the imbalance in the number of zeros and ones in the sequences in question, and uses a new statistical measure, the partial imbalance.This project was sponsored by the National Security Agency under Grant No. MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon.     

完全可分的三元系TS(v,4)的支撑集

§ 1　 IntroductionA triple system of order v and indexλ,denoted by TS(v,λ) ,is a collection of3- ele-mentsubsets Aof a v- set X,so thatevery 2 - subsetof X appears in preciselyλ subsets of A.L etλ≥ 2 and (X,A) be a TS(v,λ) .If Acan be partitioned into t(≥ 2 ) parts A1,A2 ,...,Atsuch that each (X,Ai) is a TS(v,λi) for 1≤ i≤ t,then (X,A) is called de-composable.Otherwise it is indecomposable.If t=λ,λi=1for 1≤ i≤ t,the TS(v,λ) (X,A) is called completely decomposable.It …     

一种适用于高数据速率和高速移动环境的新型信道估计方法——双正交通道信道估计方法

本文给出了一种适用于高数据速率和高速移动环境下的新型有效的信道估计方法-双正交通道信道估计方法(CETOC,Channel Estimation by using Two Orthogonal Channels),这种信道估计方法通过采用两个独立通道的联合估计,可以有效的克服快衰落的影响,从而使得在快衰落信道下应用多维状态调制成为可能.     

几类数列通项的矩阵求法

本利用矩阵给出了几类数列的通项公式的求法，把数列通项公式的求法转化为矩阵幂的计算，思路简单、计算简便，并能判别其敛散性。     

Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

OFDM系统信道盲估计的一种新算法

利用循环前缀（CP）引入的信息冗余，在利用接受信号的二阶统计特性实现正交频分复用（OFDM）系统信道盲估计的子空间算法基础上，采用矩阵变换的方法，改善信息序列的非周期相关函数，推导出信道估计的新算法。     

MIMO系统中的分组全分集全码率空时编码

针对未编码的多输入多输出（MIMO，Multi—Input Multi—Output）系统，提出一种复杂度适中的分组全分集全码率（GFDFR，Group—wise Full Diversity Full Rate）空时编码方案。该方案通过在发送端进行天线分组，各组独立编码，减小全分集全码率（FDFR，Full Diversity Full Rate）编码块的大小从而降低系统编解码复杂度；在频率选择性信道中，进一步对子载波分组进行独立编码，获得频率分集（或多径分集），以适中的复杂度在不降低系统分集度的情况下保证了信息的全码率传输，是一种在MIMO信道中极具实用价值的空时编码方案。     

基于HMM方法的动态手势轨迹训练性能研究

基于HMM(Hidden Markov Model,隐形马尔可夫模型)对动态手势轨迹的训练是手势识别的关键技术之一。本文对HMM的模型训练采用Baum.Welch算法,并分别从迭代次数,样本个数选取,以及模型初值选取等方面对动态手势轨迹的训练性能进行了研究。实验结果表明HMM方法对具有时空特性的动态手势轨迹识别是非常有效的。     

相干OFDM系统中导引符号功率优化

在瑞利衰落信道下，本文研究了导引符号功率对相干OFDM系统性能的影响，计算了由于不精确信道估计引起的系统性能损失，优化分析了导引符号与数据符号功率比，并给出完整的最优功率分配数学表达式。理论分析和仿真结果给出了各种参数对最优功率比的影响，同时理论结果为系统设计提供了依据。     

多目标最优化的一种积分型实现算法

在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法．本文利用数论中的一致分布佳点集列，较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则．并经过有关函数数值计算表明该算法是有效的，可用来求解多目标最优化问题的有效解．