二元Bent序列的前馈生成＊

通过对[1]中二元Bent序列的等价定义,本文给出了使用前馈网络生成二元Bent序列的快速方法,使二元Bent序列的产生比[2]中的方法简单,迅速。     

产生2元de Bruijn序列的一个新算法

２元ｎ级ｄｅＢｒｕｉｊｎ序列是由ｎ级移位寄存器产生的周期为２ｎ的移位寄存器序列，给出了２元ｄｅＢｒｕｉｊｎ序列的一个新的生成算法，该算法能生成２ｓ·ｇ（ｎ，ｓ）个ｎ级如ｄｅ　Ｂｒｕｉｊｉｎ序列，其中，０≤ｓ≤２（ｎ－７）／３；当 ２ｌ－１＜ｓ≤２Ｌ时，ｇ（ｎ，ｓ）＝ｎ－３Ｌ－６－［（ｎ－２Ｌ－６）／（Ｌ＋１）］。     

Binary Sequences Derived from Dickson Permutation Polynomials over Binary Extension Field

In this paper, based on a result of Lidl and Mullen (Mathematical Journal of Okayama University, 1991), the maximum length and the second maximum length that can be attained by cycles of Dickson permutation polynomial (of the first kind) with parameter 1 are studied. Necessary and sufficient conditions for these two lengths to be attained are given, which are connected with Fermat primes and Mersenne primes, respectively. Furthermore, a class of coordinate sequences that maintains a large period is obtained, which is shown to be the coordinate sequences derived from cycles of the second maximum length. Explicit formulas for their periodicity and shift-equivalences are also presented.     

混沌二进制序列构成的安全性研究

由混沌映射驱动得到的伪随机二进制序列应确保有足够的比特安全性。信息有规律地泄漏,会导致有可能利用有限长度的输出序列完全地破译混沌驱动序列,并恢复有限长度的初始密钥,重建全部的输出序列。     

The 2-error Linear Complexity of 2n-Periodic Binary Sequences

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences. For a random 2n-periodic binary sequence, the number of sequences with given 2-error linear complexityis provided. Then the expected 2-error linear complexity of a random 2n-periodic binary sequence is given.     

并元互补二元序列族的布尔函数刻划

本文首先给出了并元互补二元序列族与一类布尔函数族的等价关系，然后采用布尔函数族对并元互补二元序列族进行了研究     

一种混沌序列密码的产生

受到时延混沌系统对时延时间段初值函数极端敏感特点的启发,利用一一映射与混沌映射相组合在数字滤波器的结构上产生混沌密码序列,使序列同样受到时延时间段初值的影响,增加序列的复杂度,提高保密通信的安全性,并给出了理论分析。同时对该序列的相关性等特性进行了模拟,将其与混沌跳频、非一一映射所产生的混沌序列进行比较,证明了该方法是可行性。     

交错并联磁集成Boost变换器在光伏发电系统中应用

文章采用了自适应模糊控制来跟踪光伏发电系统的最大功率输出点.自适应模糊控制算法比传统的模糊控制算法对如负载跳变、太阳能电池以及外部条件的改变具有更强的适应能力,能更准确的跟踪系统的最大功率输出点.光伏发电系统由太阳能电池、交错并联磁集成Boost变换器和自适应模糊控制器组成.采用交错并联磁集成技术可以减小电感的稳态相电流纹波,提高变换器的效率,同时还能提高光伏发电系统的暂态性能.自适应模糊控制方法对外界条件的改变具有更强的适应能力.最后使用了ORCAD软件对整个系统进行了仿真,并对负载突变和太阳能电池电流改变进行了仿真.仿真结果表明了采用自适应模糊控制算法可以提高光伏发电系统的总体性能.     

一类二元序列的互相关函数

本文讨论Ｎｏ Ｓｅｑｕｅｎｃｅｓ的一种扩展的互相关特性，给出了Ｎｏ Ｓｅｑｕｅｎｃｅｓ及其扩展形式的互相关函数值与分配。     

二元GMW序列Niho采样下的互相关性分析

GMW序列是一种线性复杂度很高的非线性序列,在直接序列扩频系统中有着很好的应用前景.通过证明级联二元GMW序列与其采样序列的互相关性在特定条下和构造级联GMW序列的幂无关,将二元GMW序列与其采样序列的互相关性与m序列联系起来.通过现有二元m序列在Niho采样下的互相关性研究结论,分析证明了级联二元GMW序列在Niho采样下的互相关性具有四值、五值、六值特性.     

Classification of Random Binary Sequences Using Walsh-Fourier Analysis

The concept of a finite binary random sequence does not seem to be covered in the classical foundations of the theory of probability. Solomonoff, Kolmogorov and Chaitin have tried to include this case by considering the lengths of programs required to generate these sequences: a longer program implying more randomness. However this definition is difficult to apply. This paper presents a straightforward procedure using Walsh functions to determine the pattern in a binary sequence. A quantitative measure of randomness has also been proposed. This has been defined as the number of independent data (via the Walsh transform) required to generate the sequence divided by the length of the sequence. However at present this classification procedure is restricted to sequences of length 2k only. When extended to infinite sequences it yields results agreeing with those by the classical probability theory.     

Low-Power High-Speed Hybrid Wave-Pipeline Architectures for Binary Morphological Dilation

Dilation and erosion are two fundamental operations of mathematical morphology for image processing. This paper presents three hybrid wave-pipeline (HWP) architectures for real-time binary dilation operator. With minor changes to the number and/or to the type of the basic gates, they can be employed as erosion operator. In the first HWP-architecture, each single cell utilizes the wave technique along with delay units for balancing the data paths. By minimizing the number of delay units, the second HWP-architecture with reduced power consumption and hardware complexity is obtained. The third HWP-architecture employs wave technique in each three cascaded cells. This architecture improves the above performance further, at the cost of slight reduction in maximum clock frequency and clock frequency range. Simulation results, using a 0.18 μm CMOS technology, indicate that the HWP architectures have higher speed, less hardware complexity, and lower power consumption compared to pipeline (P) architecture. Also, they are faster than wave-pipeline (WP) architecture, without the difficulty of balancing the delay of long signal paths. Simulation illustrates that the third HWP-architecture dilates a 1024 × 1024 image by a 21 × 21 structuring element (SE) in 214.64 μs. The maximum frequency of operation is 5 GHz for the power supply of 1.8 V. The power dissipation is 410 mW, and the chip area is 0.075 mm².     

一种改进型交织ZCZ序列族的设计

本文提出了一族长ZCZ区间序列构造方法,此方法在已有基于交织方法构造ZCZ序列基础之上,通过m次递归构造,在保持序列数目M不变的条件下,序列的零相关区宽度和序列长度都变成了原序列的Mm倍,相比于以往方法得到的序列在零相关区宽度和序列长度上都得到了扩展.这些序列族可用于近乎同步CDMA系统中.     

一种新的二元多址序列--NPC序列

CDMA通信系统中,以多址序列作为地址码标识移动用户,多址序列的特性对于CDMA系统的通信性能和安全性都具有决定性的作用。多址序列的设计已成为CDMA技术中的一个关键问题。本文提出了一类新的多址序列的设计称为NPC序列。证明了NPC序列具有优良的相关特性,极大的线性复杂度和较多的同族序列数量,解决了现有非线性伪(?)机序列在实际应用中数量不足的限制,可适用于CDMA通信系统中。     

最佳二元序列偶族的构造方法

文中利用并元变换的不进位性质,给出了一种构造最佳周期互补二元序列偶族的新方法。使用这种方法,可以用已知的最佳周期互补二元序列偶族构造出更多的性能相同的新的最佳周期互补二元序列偶族,如原最佳周期互补二元序列偶族为长度为n,个数为q,则新生成最佳周期互补二元序列偶族的个数为qn,为实际工作中提供了更多的最佳信号。     

On the p-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

The purpose of this paper is to determine the p-adic complexity of the Ding-Helleseth-Martinsen (DHM) sequences with period N = 2q, where q ≡ 5 (mod 8) is a prime number. We firstly use the p-adic exponential valuation, cyclotomic numbers of order four,Gauss periodsandquadratic Gauss sumson finite field Fq and valued in ZpN?1 to determine the p-adic complexity of the DHM sequences.     

Jittery Signal Generation for High-Speed Interconnect Simulation

By generating clock and data waveforms in the frequency domain through a truncated Fourier series, absolute control over both voltage noise and symbol transition timing is achieved. A parameterized Fourier series signal model is derived and used to form clock and data waveforms exhibiting arbitrary noise and jitter characteristics. The method not only facilitates more accurate interconnect modeling in tools like Matlab and Simulink, but also provides a simple means for generating realistic signals that may be imported into Spice-based simulators.      

最优二叉树的生成及应用

衡量一个算法的优劣有许多因素,效率就是其中之一。而效率指的就是算法的执行时间。提高效率是软件开发必须注重的问题。对同一个问题往往有多个算法可以解决,在同等条件下,执行时间短的算法其效率是最高的。从霍夫曼树的定义以及霍夫曼算法出发,介绍如何构造霍夫曼树以及利用霍夫曼算法优化程序设计的原理,重点讨论在判定类问题中利用霍夫曼树可以建立最佳判定算法,提高程序的执行速度。     

适用于任意频隙数的跳频序列族产生方法研究

在现有跳频序列产生理论的基础上,从工程实现的角度研究了一种跳频序列族的构造方法。该方法利用GF(p)上的反馈移位寄存器和若干非线性逻辑运算,产生出性能较好、可用频隙数为p~k-p~m的跳频序列,并通过有限域的多项式长除法实现了系统时间TOD与跳频状态的对应,使其具有实用性。通过对各项性能进行分析仿真,证明生成的跳频序列具有分布均匀、独立性好及线性复杂度大的特点,并易于工程实现。