Analysis of pseudo-random number generators in QMC-SSE method

In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.

Pseudo-Random Sequences Generator Based on Discrete Hyperchaotic Systems

We first design a discrete hyperchaotic system via piece-wise linear state feedback. The states of the closed loop system are locally expanding in two directions but absolutely bounded on the whole, which implies hyperchaos. Then, we use three suchlike hyperchaotic systems with different feedback gain matrices to design a pseudo-random sequence generator (PRSG). Through a threshold function, three sub-sequences generated from the output of piecewise linear functions are changed into 0-1 sequences. Then, followed by XOR operation, an unpredictable pseudo-random sequence (PRS) is ultimately obtained. The analysis and simulation results indicate that the PRS, generated with hyperchaotic systems, has desirable statistical features.

Blind parameter estimation of pseudo-random binary code-linear frequency modulation signal based on Duffing oscillator at low SNR

Conventional parameter estimation methods for pseudo-random binary code-linear frequency modulation(PRBC-LFM)signals require prior knowledge,are computationally complex,and exhibit poor performance at low signal-to-noise ratios(SNRs).To overcome these problems,a blind parameter estimation method based on a Duffing oscillator array is proposed.A new relationship formula among the state of the Duffing oscillator,the pseudo-random sequence of the PRBC-LFM signal,and the frequency difference between the PRBC-LFM signal and the periodic driving force signal of the Duffing oscillator is derived,providing the theoretical basis for blind parameter estimation.Methods based on amplitude method,short-time Fourier transform method,and power spectrum entropy method are used to binarize the output of the Duffing oscillator array,and their performance is compared.The pseudo-random sequence is estimated using Duffing oscillator array synchronization,and the carrier frequency parameters are obtained by the relational expressions and characteristics of the difference frequency.Simulation results show that this blind estimation method overcomes limitations in prior knowledge and maintains good parameter estimation performance up to an SNR of-35 dB.

HIERACHICAL STRUCTURES FOR GENERATING PSEUDO-RANDOM SEQUENCES AND ARRAYS

This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.

Pseudo-Random Coding Side-Lobe Suppression Method Based on CLEAN Algorithm

A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.

BIT COMMITMENT USING PSEUDO-RANDOM SYNTHESIZER

This paper presents two practical message commitment schemes: one is suitable for committing many bits, and another is useful for committing any bit-long message. They are provably secure based on pseudo-random synthesizers. In these schemes, the sender may be unbounded to polynomial time and the receiver is bounded. The advantage of these schemes is that the secure parameter may be small.

A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.

Performance Analysis Concerning Antinoise for Several Pseudo-random Code Fuzes

Introduces in brief the principle of three kinds pseudo-random code fuzes, viz. the pseudo-random code phase modulation fuze,the pseudo-random code phase modulation and pulse amplitude modulation(PAM) combined fuze,and the pseudo-random code phase modulation and random(pseudo-random) pulse position modulation(PPM) combined fuze. On this basis, their SNR gains in signal processing after band pass filter to the correlation detection, and the overall SNR gains of the whole procedure after correlation detection are deduced in detail. The results show that the latter two kinds of fuzes have the same performances concerning antinoise that are stronger than that of the pseudo-random code phase modulation fuze.

基于虚拟激励法的大跨度桥梁非平稳随机振动分析闭合解

针对大跨度结构考虑地面空间运动的非一致地震响应分析问题,结合虚拟激励法,应用傅里叶分析建立了结构非平稳随机振动响应演变功率谱分析的频域方法。建立的方法完全基于频域执行,给出了响应演变功率谱的闭合解表达式。由于实现了确定性调制过程与随机过程的有效分离,应用离散傅里叶变换进行计算不需要较高的采样分析频率就可以获得较好精度的数值结果。数值算例研究了某斜拉桥的考虑地面运动空间效应非平稳随机地震响应,与通常时频分析方法进行对比,验证了本文频域方法的正确性和有效性。

基于中国剩余定理的NFC安全认证算法

针对近场通信技术在应用中出现的安全隐患问题,给出一种基于中国剩余定理的算法。算法利用中国剩余定理实现对传送信息进行加密,中国剩余定理基于数学中大素数分解难题,使得攻击者无法进行破解;所有信息加密过程中混入随机数,用于保证消息的新鲜性;算法在进行信息更新时采用伪随机函数计算,因伪随机函数具备的单向性,使得攻击者无法分析出有用隐私信息。将不同算法对比安全分析,表明该算法能够抵抗重放攻击、异步攻击等多种攻击。通过性能角度及仿真实验对多个算法进行分析,结果表明该算法计算时间复杂度低于其他算法。

垂直水声通信中的伪随机序列精确定时算法

针对垂直水声通信中时变多普勒引起的定时偏差问题,研究一种基于伪随机序列的迭代定时估计及补偿算法。该方法利用伪随机序列作为同步信号,分三步估计时变多普勒:采用低复杂度的模糊函数法粗补偿接收信号内的平均多普勒;通过迭代插值法实现残留时变多普勒的精确估计及补偿;利用基于信道相关函数的相位信息,纠正均衡后信号的偏转相位。为实现高阶海试数据的有效解调,采用基于伪随机序列均方误差的多通道加权合并方式,获得空间分集增益。仿真及海试数据处理结果证明所提方法具有良好的时变多普勒估计及补偿性能,同时对30个通道内的1024QAM数据进行合并处理,在500 m的通信距离下,误码率为0.04,信道容量达到7.6 bits/symbol。与传统数据帧结构相比,无需使用线性调频信号,可以提高有效数据传输率。

Blind reconnaissance of the pseudo-random sequence in DS/SS signal with negative SNR

This paper introduces a new theory and algorithm that can be used in blind detection of the carrier wave signal and the pseudo-random sequence of the direct sequence spread spectrum （DS/SS） signal with negative SNR. First, without any a priori knowledge of the DS/SS signal, the carrier wave signal can be detected from DS/SS signal with negative SNR by using stochastic differential equations and energy detection method. Based on this, the pseudo-random sequence can also be blindly detected in DS/SS signal with negative SNR by reducing noise of the nonlinear signal and the algorithm of wavelet multiscale decomposition algorithm. Finally, the computer simulation shows that we can detect the carrier wave signal with SNR=-27 dB and the pseudo-random sequence under error code ratio 10^-4with SNR =-10 dB.

北斗卫星船载导航信号并行捕获算法

信号捕获作为实现北斗卫星船载导航的第一阶段,也是最重要的一环,为此研究基于北斗卫星船载导航信号并行捕获算法,在短时间内捕获卫星信号,为船舶提供高精度的定位和导航服务。建立北斗卫星导航信号模型,依据模型生成的北斗卫星导航信号,采用傅里叶变换(Fast Fourier Transformation,FFT)算法以及快速傅里叶逆变换(Inverse Fast Fourier Transform,IFFT)算法,通过并行频率搜索和并行码相位搜索分别将伪随机码相位、载波频移的二维搜索变成一维进行并行搜索,获取北斗卫星信号的伪随机码和载波频移,实现北斗卫星船载导航信号并行捕获。实验结果表明,该算法可以成功地捕获船载导航信号,并且捕获耗时短;对船载导航信号的载波频率估计误差小。

基于加密模式的协同式激光敌我识别技术

为了解决普通的激光敌我识别中,信号容易被侦收后破解的问题,提出了一种基于加密模式的协同式激光敌我识别技术,对激光敌我识别系统工作原理进行了研究与分析,采用通过时间信息产生一组伪随机数,利用一组高强度的改进加密算法对这组伪随机数进行变换产生加密数据,并经过扩频函数对变换后的加密数据进行扩频,结合RS纠错码产生最终编码的方法,增强数据的抗干扰能力,经实验测试实现了提高信号保密性和安全性的目的,为激光敌我识别的发展提供了新的思路。

Pseudo-random sequence generator based on the generalized Henon map

By analysis and comparison of several chaotic systems that are applied to generate pseudo-random sequence, the generalized Henon map is proposed as a pseudo-random sequence generator. A new algorithm is created to solve the problem of non-uniform distribution of the sequence generated by the generalized Henon map. First, move the decimal point of elements in the sequence to the fight; then, cut off the integer; and finally, quantify it into a binary sequence. Statistical test, security analysis, and the application of image encryption have strongly supported the good random statistical characteristics, high linear complexity, large key space, and great sensitivity of the binary sequence.

Pseudo-Randomness of Certain Sequences of k Symbols with Length pq

The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols （or k-ary sequences）. Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.

逻辑内建自测试技术进展综述

逻辑内建自测试(logic buit-in self-test,LBIST)是一种可测试性设计技术,利用芯片、板级或系统上的部分电路测试数字逻辑电路本身。LBIST对于许多应用来说至关重要,尤其是国防、航空航天、自动驾驶等生命和任务关键型的应用。这些应用需要执行片上、板上或系统内自检,以提高整个系统的可靠性及执行远程诊断的能力。该文首先给出了常用的LBIST分类,并描述了经典的,也是工业界应用最成功的LBIST架构——使用多输入特征寄存器和并行移位序列产生器的自测试架构;其次,对国内外研究团队、研究进展进行了总结;再次,详细剖析了LBIST的基本原理、时序控制、确定性自测试设计、低功耗设计、“X”容忍等关键技术点,列举出了主流的LBIST商业工具,并逐一分析了其软件架构和技术特点;最后,讨论当前LBIST技术仍需进一步解决的问题,并进行展望。

Chaotic block iterating method for pseudo-random sequence generator

A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier, and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the ＂m＂ block sequence is two-valued; the block field value is [0, 2^m - 1 ], and the block period is 2^m＋8 - 1.