纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

A digital secure image communication scheme based on the chaotic Chebyshev map

In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained by computer simulation indicate that the transmitted source image can be correctly and reliably recovered using the proposed scheme, even through a noisy channel. Notably, the scheme possesses relatively high security and can be easily implemented. Moreover, the quality of the recovered image is satisfactory, quantified by such common criteria as the bit‐error rate performance. Copyright © 2004 John Wiley & Sons, Ltd.     

自适应RBF神经网络在CDMA移动通信上行链路功率控制中的应用研究

提出了一种自适应RBF神经网络功率控制方案。详细研究了该网络在DS-CDMA通信中，进行上行链路闭环功率控制(基于信扰比(SIR))的应用理论，给出了该网络参数的计算方法。最后用计算机仿真法模拟出该控制器的运行性能。结果表明基于SIR的自适应RBF神经网络功率控制器能自适应地调整移动台的发射功率，使基站接收信号的信扰比始终非常接近于一个常数，且有比定步长功率控制更小的SIR跟踪误差，从而可以降低接收信号的中断概率、提高信道容量。     

Revisiting Gouy phase

The aim of this paper is to highlight the added value of the generalized Gouy phase shift introduced by Siegman. Although suited for optical systems study, including those more complex than free space, we note that it did not meet the use that it deserves so far. The analysis of the whole of the ideas and analytical approaches associated to the important concept of the Gouy phase proves its effectiveness.

Usually, the resonance condition is systematically built on the basis of the equivalent empty cavity. Unfortunately, this approach does not cover some of the useful parameters of the real resonator. By means of the generalized Gouy phase and the self-consistent complex parameter q, we derive here a new approach for the calculation of the resonance condition for the real cavity. Moreover, the use of the generalized Gouy phase clearly simplifies the study of resonators, while making it possible to avoid the use of the Huygens’ Fresnel integral.     

Partial scan design and test sequence generation based on reduced scan shift method

This paper presents a partial scan algorithm, calledPARES (PartialscanAlgorithm based onREduced Scan shift), for designing partial scan circuits. PARES is based on the reduced scan shift that has been previously proposed for generating short test sequences for full scan circuits. In the reduced scan shift method, one determines proch FFs must be controlled and observed for each test vector. According to the results of similar analysis, PARES selects these FFs that must be controlled or observed for a large number of test vectors, as scanned FFs. Short test sequences are generated by reducing scan shift operations using a static test compaction method. To minimize the loss of fault coverage, the order of test vectors is so determined that the unscanned FFs are in the state required by the next test vector. If there are any faults undetected yet by a test sequence derived from the test vectors, then PARES uses a sequential circuit test generator to detect the faults. Experimental results for ISCAS'89 benchmark circuits are given to demonstrate the effectiveness of PARES.     

The performance of a direct-sequence spread-spectrum acquisition system using a linear prediction filter for narrowband interference suppression

The coarse acquisition performance of a direct sequence spread-spectrum receiver is analyzed when a linear prediction filter is used for narrowband interference suppression. We show that once an appropriate matching strategy is identified, the linear prediction filter can provide favorable performance when narrowband interference is present over a considerable range of both interference power and bandwidth. In addition, the presence of the filter dramatically improves the performance over the case where there is no filter, except when the interference bandwidth and the power are both small (i.e., when the processing gain provides sufficient interference immunity without the filter). If long spreading sequences are used with moderately sized observation windows, the acquisition performance can be severely degraded when a parallel acquisition scheme is used due to the linear predication filter. We show, however, that a slower serial receiver will provide reliable performance.This work was supported in part by the Office of Naval Research under contract ONR N00014-91-J-1234, the Army Research Office under contract ARO DAAL03-91-0071, and the NSF Center for Ultra-High Speed Circuits and Systems (ICAS).     

Determination of generalized quadrangles with distinct elation points

In this paper, we classify the finite generalized quadrangles of order (s,t), s,t > 1, which have a line L of elation points, with the additional property that there is a line M not meeting L for which {L, M} is regular. This is a first fundamental step towards the classification of those generalized quadrangles having a line of elation points. Mathematics Subject Classification (2000): 51E12, 51E20, 20B25, 20E42     

An improved algorithm for computing topological entropy

A new algorithm is presented for computing the topological entropy of a unimodal map of the interval. The accuracy of the algorithm is discussed and some graphs of the topological entropy which are obtained using the algorithm are displayed.     

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

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

GENERALIZED INVERSE GROUP OF SIGNAL AND ITS IMPLEMENTATION WITH NEURAL NETWORKS

A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.