Spreading Code Design Using a Global Optimization Method

The performance of a code division multiple access system depends on the correlation properties of the employed spreading code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference and to improve bit error performance. An auto-correlation function with a distinct peak enables proper synchronization and suppresses intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this paper, a global two dimensional optimization method is proposed to minimize the out-of-phase average mean-square aperiodic auto-correlation with average mean-square aperiodic cross-correlation being allowed to lie within a fixed region. This approach is applied to design sets of complex spreading sequences. A design example is presented to illustrate the relation between various correlation characteristics. The correlations of the obtained sets are compared with correlations of other known sequences.     

802.1 x协议分析及其应用

本文对802.1x协议体系结构、流程及其工作原理作了分析,然后介绍了基于该协议的各种传统应用,在此基础上对协议的应用作了进一步扩展,将其引入到网关系统的访问控制中,并概要分析了几种网关模式的应用场景,最后把它同其它认证方式作了分析和比较.     

电子认证与授权管理标准体系研究

以国际上在标识、鉴别与授权标准方面已有的工作为基础，提出了我国电子认证与授权管理标准体系框架。     

第三代移动通信发展概况

介绍了第3代移动通信3种主流技术的市场应用、设备成熟度，以及国际和国内标准化发展状况，我国第3代移动通信技术试验的总体情况。     

基于USB的数据采集系统设计及实现

讲述了一种基于USB的12b高速数据采集与信号分析系统的设计，设计中采用了FPGA(可编程逻辑器件)实现时序逻辑信号的控制，从而整个系统的设计具有很大的灵活性。该系统在Windows2000环境下的驱动程序及用户应用程序采用的是Visual C^ 语言实现的，而固件代码则是用C语言实现的。系统具有低成本、高性能的特点，能够广泛应用于测控、信号分析等多个领域。     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

Solid codes and the uniform density of fd-domains

By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper.     

利用垂直阵列构作Cartesian认证码

利用垂直阵列构作了一类Cartesian认证码,计算了它们的参数,并且在编码规则按等概率分布选取时,成功的模仿攻击和成功的替换攻击概率也被算出。     

格状编码和RS码级连技术在HDTV中应用的性能模拟

设计一种用于ＨＤＴＶ地面数字传输系统的级连格状编码和ＲＳ码方案，并对其在ＨＤＴＶ中应用进行计算机模拟。模拟结果表明：该级连格状编码方案在低信噪比具有较好的误码性能。     

接收机有限带宽对多相码数字脉压的影响

限制接收机带宽是雷达系统中提高信噪比(SNR)的常用方法,相应的也会引起输出波形的失真。本文主要分析了多相码数字脉压雷达系统中,接收机有限带宽对脉压输出结果所造成的影响。运用五点滑动窗平均法在计算机上进行了模拟,并给出了仿真结果。