Pseudorandom properties of prime factors

In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

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

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

A Pseudo-Random Frequency Modulation Continuous Wave Coherent Lidar Using an Optical Field Correlation Detection Method

We propose a new detection method for a pseudo-random frequency modulation continuous wave (RM-CW) coherent lidar. The feature of this method is modulation of local beam with a time delayed pseudo-random sequence. Heterodyne detection and correlation detection between the received beam and the local beam are simultaneously carried out in an optical field. In the RM-CW coherent lidar using the optical field correlation detection method, the received equipment is greatly simplified. We carried out preliminary experiments and demonstrated that the new method is effective for detection of a CW coherent lidar.     

伪随机码光栅锐化光栅于涉仪条纹

本文报道了伪随机序列编码的光栅干涉仪,可以取得锐化条纹,给出了理论分析和实验结果.     

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(PRBCLFM) 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 d B.     

机抖激光陀螺随机噪声注入方法研究

机抖激光陀螺通过在抖动驱动信号中注入一定强度的随机噪声来消除动态闭锁误差.为了适应机抖激光陀螺小型化和其控制电路数字化的发展,设计了在以抖动驱动信号采用方波形式的基础上,其随机噪声的注入采取了应用寄存器产生的伪随机噪声-m序列按照对方波占空比进行调制的方式,并建立了抖动机构的数学模型,应用所建立的模型通过Matlab中的Simulink进行了仿真.依照随机噪声注入效率的计算方法,文中采用的方式其噪声注入效率要高于以往采用的应用高斯白噪声对交变正弦波驱动信号进行幅值调制的方式,对此进行了实验验证,证明这种随机噪声注入方式效果良好.     

A CLASS OF RANDOM NUMBER GENERATORS BASED ON WEYL SEQUENCE

The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.     

Two-Dimensional Cellular Automata for Pseudo-Random Pattern Generators and for Highly Secure Stream Ciphers

Pseudo-random properties of a class of two-dimensional (2-D) 5-neighborhood cellular automata (CA), built around nonlinear (OR, AND) and linear (XOR) Boolean functions are studied. The site values at each step of the 2-D CA evolution are taken in parallel and form pseudo-random sequences, which satisfy the criteria established for pseudo random number generator (PRNG): long period, excellent random qualities, single bit error propagation (avalanche criteria), easy and fast generation of the random bits. A block-scheme for secure Stream Cipher based on 2-D CA is proposed. The 2-D CA based PRNG algorithm has simple structure, use space-invariant and local interconnections and can be easily realized in very large scale integration or parallel optoelectronic architectures.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.