Method to generate the pseudo random sequence based on the statistical properties by Sen BAI, Long-fu ZHOU, Hui GUO, Bing YAN

Subjects: “…pseudo-random sequence…”
Get full text

Research on high security G function algorithm by Rui CHEN, Zan LI, Jia SHI, Lei GUAN

Subjects: Get full text

AdaBoost algorithm based on target perturbation by Shufen ZHANG, Yanling DONG, Jingcheng XU, Haoshi WANG

Subjects: Get full text

RESEARCH OF PARAMETERS OF ENCODING OF THE ALGORITHM WITH VARIABLE FRAGMENTATION OF THE UNIT by K. O. Zakharova

Subjects: Get full text

Assembly Sequence Optimization based on Improved Genetic Algorithm by Yang Wei, Meng Guanjun, Cao Wengang, Xie Kunfeng, Yu Pengfei

“…According to the assembly sequence optimization problem of mechanical products,the assembly sequence is used as initial population,and the reference set is added to the genetic algorithm,and the intelligent iterative mechanism of the decentralized search algorithm is used to avoid the random nature of the search.The continuous optimization of the assembly,the optimal solution is obtained. …”
Get full text

A measure of the difference between test sets for generating controlled random tests by V. N. Yarmolik, V. V. Petrovskaya, I. Mrozek

Subjects: “…controlled random tests…”
Get full text

GAN-based pseudo random number generation optimized through genetic algorithms by Xuguang Wu, Yiliang Han, Minqing Zhang, Yu Li, Su Cui

“…Abstract Pseudo-random number generators (PRNGs) are deterministic algorithms that generate sequences of numbers approximating the properties of random numbers, which are widely utilized in various fields. …”
Get full text

Blind estimation of pseudo-random codes in non-periodic long code direct-sequence spread-spectrum signals by HAOZhi-jin Z, UXiao-wei G, HENLei S, HANYi Z

“…The existence of common peaks in triple correlation functions of different m-sequences is proven based on the detail study of the characteristics of triple correlation functions of m-sequences,the features of common peaks and the direct relationship between common peak coordinates and the primitive polynomials of m-sequences are deduced.An es-timation algorithm of pseudo-random (PN) codes in non-periodic long code direct-sequence spread-spectrum (NPLC-DSSS) signals is proposed based on the above theories.Simulations under additive white Gaussian noise show that the probability of spreading code and scrambling code being both correctly estimated can reach 99% when the signal with a quarter of the cycle length of the long PN code is used only and the signal-to-noise ratio is greater than 4dB.…”
Get full text

Turbo iterative acquisition algorithm for satellite high-mobility DSSS signal by Chunxiao JIANG, Jiawei WANG

“…To solve the problems of the low acquisition probability and high computational complexity in satellite high-mobility communications, a new factor graph was designed for acquisition of the high-mobility direct sequence spread spectrum (DSSS) signal, where time-varying Doppler rates were modeled by the random walk model.Based on the proposed factor graph, the turbo iterative DSSS signal acquisition algorithm was proposed.In the Doppler-estimation loop, the negative influence of Doppler frequency offsets and Doppler rates could be eliminated effectively.Then in the code-detection loop, constraints of each chip was used to recover the received signal, to achieve DSSS signal acquisition.Simulation results show that the proposed algorithm is capable of improving the acquisition performance at less 1.3 dB with low computational complexity.…”
Get full text

On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h) by Long-fei LIU, Kai YANG, Xiao-yuan YANG

Get full text

Research on Grid Scroll Chaotic Extended Sequence Algorithm and Its Circuit Implementation for F-OFDM System by Yingjie Ma, Ya Li, Geng Zhao, Ping Zeng, Yatao Yang

“…The proposed grid multiscroll chaotic maps are used as random phase sequence vectors instead of the traditional pseudo random sequence, which provide a large number of random sequences with good correlation characteristics, random characteristics, and high security. …”
Get full text

Low-hit frequency-hopping communication systems for power Internet of things random access by Shu DU, Mei MA, Bo ZHAO, Qi ZENG, Xing LIU

“…The communication network is an essential component of the data acquisition and information transmission in power Internet of things (IoT).To meet the development requirements of multiple power service in the future, the wireless communication technique with flexible-access and high scalability is one of the development directions for power IoT.Due to the features of large-scale access, random access time, high security and reliability for information transmission of power IoT, a frequency-hopping (FH) technique with low-hit rate for random access was proposed.The construction algorithm of such FH pattern was based upon the combination and shift operation of conventional FH sequences.By the theoretical arithmetic and numerical simulation, the properties of the proposed FH pattern and the error-rate of the FH-based power IoT were evaluated.The analysis reveals that the new class of FH sequences and the system can meet the requirements of large-scale access and highly reliable communication for the power IoT, which has good application prospects.…”
Get full text

A hybrid particle swarm optimization algorithm for single machine scheduling with sequence-dependent setup times and learning effects by Payam Chiniforooshan, Dragan Marinkovic

“…In order to test the applicability of the proposed algorithm to solve large-sized problems, 120 instances are generated, and the results are compared with a Random Key Genetic Algorithm (RKGA). …”
Get full text

Coupled variable‐input LCG and clock divider‐based large period pseudo‐random bit generator on FPGA by Mangal D. Gupta, Rajeev K. Chauhan

“…To prevent the system from falling into short‐period orbits as well as increasing the randomness of the generated bit sequences, the proposed algorithm periodically changes the seed parameters of the LCG blocks. …”
Get full text

3D crack identification using the Nelder-Mead Simplex algorithm combined with a random generation of crack positions by Nasreddine Amoura, Hocine Kebir, Abdelouahab Benzerdjeb

“…The scheme uses a boundary element method for solving the forward problem and the Nelder-Mead simplex numerical optimization algorithm coupled with a low discrepancy sequence in order to identify an embedded crack. …”
Get full text

Improving doublet cell removal efficiency through multiple algorithm runs by Yong She, Chaoye Wang, Qi Zhao

Get full text

Quasi-random numbers in some statistical systems by Vitalija Rudzkienė

“…Pseudo-random numbers come from mathematical functions and algorithms that provides such numbers called pseudo-random gene­rators. …”
Get full text

Iterative estimation method for random interleaver of Turbo codes by Jun LIU, Jing LI, Pei-dong YU

“…Channel coding parameter analysis meant reversely analyzing and estimating the coding parameters,and was one of the key techniques for intelligent communication,information interception and so on.Since Turbo codes were widely used in communication systems,parameter estimation for their interleavers was of great importance.Focusing on the random interleaver of Turbo codes,an iterative estimation algorithm based on correlation decision between the soft outputs of the Turbo decoder was presented.The algorithm used soft-decisions of the demodulator output sequence.It overcame the shortcomings of existing methods which often aimed at certain interleaving structures only,and suffered from weak robustness since they used hard-decisions.Simulation results show that the proposed algorithm has better performance and relatively lower complexity,especially in low signal-to-noise ratio cases.…”
Get full text

Optimizing Transmit Sequence and Instrumental Variables Receiver for Dual-Function Complexity System by Yu Yao, Junhui Zhao, Lenan Wu

“…We focus on phase only sequences, sharing both a continuous and a discrete phase code and develop optimization algorithms to achieve reasonable pairs of transmit coded sequences and IV receiver that fine approximate the behavior of the optimum SCNR. …”
Get full text

Analysis of stability condition for LDPC codes and optimizing degree sequences over mixed channel by Kang-ning SUN, Lin-hua MA, Le RU, Wen-tong FAN, Xing HU, Shao-cheng HUANG

“…Under the circumstance that white Gaussian noise and random erasures exist all at once,the stability condition for LDPC codes over mixed channel was proposed.And it was proved that a good degree sequence of LDPC codes was not optimized over mixed channel.It can also be proved by simulation.The random particle swarm optimization (RPSO) and simulated annealing (SA) algorithm were combined to find some capacity-approaching degree sequences over mixed channel with different erasure probabilities.The threshold of signal-to-noise ratio improves 1.615 9 dB than that of the classical degree sequences calculated by Gaussian approximation over mixed channel.These degree sequences are optimal for optical recording and frequency-hopping communication with narrow-band interference.…”
Get full text