扩频通信系统相位的捕获与跟踪技术

本文讨论扩展频谱通信系统中有关相位的捕获与跟踪技术问题，道德在扩频通信系统原理的基础上结合实际系统中的应用条件，详细分析了捕获的方法、性能特点，给出了比较适用的2种捕获与跟踪原理图。理论分析与实验结果表明，所采用的分析方法和捕获方案是可行的。     

Special simplices and Gorenstein toric rings

Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs.     

GF(2)上本原多项式的三项倍式的次数研究

研究了二元域上本原多项式的三项倍式的计数问题,通过对三项倍式进行分类,导出了本原多项式三项倍式最低次数的一个上界.利用这一结果,使构造本原多项式的次数最低的三项倍式的计算复杂性降到原来的九分之一.     

全面成绩管理的初探

利用数量化方法,数字特征法,W ilcoxon顺序和检验法以及试卷分析的各种方法(试题难度,区分度,信度,效度等),定量地解决了影响学生成绩的主要因素,并引入全面管理方法,明显地改善了学生成绩,学生综合能力明显加强.     

关于M序列的自相关函数的一点注记

本文讨论了Ｍ序列的自相关性，并证明了：当０＜｜ｔ－２＾ｎ－１｜≤［ｎ－１／２］时，｜ＣＭ（ｔ）｜≤２＾ｎ－１。     

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 …     

Mixed-Signal Circuit Classification in a Pseudo-Random Testing Scheme

Pseudo-random testing techniques for mixed-signal circuits offer several advantages compared to explicit time-domain and frequency-domain test methods, especially in a BIST structure. To fully exploit these advantages a suitable choice of the pseudo-random input parameters should be done and an investigation on the accuracy of the circuit response samples needed to reduce the risk of misclassification should be carried out. Here these issues have been addressed for a testing scheme based on the estimation of the impulse response of the device under test (DUT) by means of input-output cross-correlation. Moreover, new acceptance criteria for the DUT are suggested which solve some ambiguity problems arising if the classification of the DUT as good or bad is based on a few samples of the cross-correlation function. Examples of application of the proposed techniques to real cases are also shown in order to assess the impact of the measurement system inaccuracies on the reliability of the test.     

几类数列通项的矩阵求法

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

基于"替换法"的汉字加、解密实现技术

文章讨论的基于“替换法”的汉字信息加、解密实现技术,改变了传统的汉字加密结果,使加密后的密文仍是可以识别和再利用的汉字,发送者可以在任何可编辑汉字的通讯设备上发送和接收密文,确保中文信息传输过程中的安全性。加、解密算法实现的代码语言为VFP6.0。