• Title/Summary/Keyword: pseudorandom sequence

Search Result 38, Processing Time 0.019 seconds

Efficient Implementation of a Pseudorandom Sequence Generator for High-Speed Data Communications

  • Hwang, Soo-Yun;Park, Gi-Yoon;Kim, Dae-Ho;Jhang, Kyoung-Son
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.222-229
    • /
    • 2010
  • A conventional pseudorandom sequence generator creates only 1 bit of data per clock cycle. Therefore, it may cause a delay in data communications. In this paper, we propose an efficient implementation method for a pseudorandom sequence generator with parallel outputs. By virtue of the simple matrix multiplications, we derive a well-organized recursive formula and realize a pseudorandom sequence generator with multiple outputs. Experimental results show that, although the total area of the proposed scheme is 3% to 13% larger than that of the existing scheme, our parallel architecture improves the throughput by 2, 4, and 6 times compared with the existing scheme based on a single output. In addition, we apply our approach to a $2{\times}2$ multiple input/multiple output (MIMO) detector targeting the 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) system. Therefore, the throughput of the MIMO detector is significantly enhanced by parallel processing of data communications.

An Improved Pseudorandom Sequence Generator and its Application to Image Encryption

  • Sinha, Keshav;Paul, Partha;Amritanjali, Amritanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1307-1329
    • /
    • 2022
  • This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

Impact of the Spectral Linewidth of a Pseudorandom Binary Sequence (PRBS)-Modulated Laser on Stimulated Brillouin Scattering and Beam Quality

  • Aeri Jung;Sanggwon Song;Kwang Hyun Lee;Jung Hwan Lee;Kyunghwan Oh
    • Current Optics and Photonics
    • /
    • v.7 no.6
    • /
    • pp.665-672
    • /
    • 2023
  • This study focuses on investigating the impact of the spectral linewidth of a seed laser in a master-oscillator power amplifier (MOPA) configuration on stimulated Brillouin scattering and the beam quality of the output diffracted by a grating. To conduct the study, a distributed feedback (DFB) laser is modulated in a pseudorandom binary sequence (PRBS) and amplified by a two-stage Yb-doped fiber amplifier to achieve an output power of over 1 kW. The spectral linewidth of the seed laser is systematically varied from 1 to 12 GHz in the frequency domain by varying the PRBS modulation parameters. The experimental results reveal a tradeoff between suppressing stimulated Brillouin scattering and enhancing beam quality with increased spectral linewidth. Therefore, the study provides valuable insights into optimizing spectral beam combining to achieve high beam quality and scalable power upgrade in fiber lasers.

PRaCto: Pseudo Random bit generator for Cryptographic application

  • Raza, Saiyma Fatima;Satpute, Vishal R
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.6161-6176
    • /
    • 2018
  • Pseudorandom numbers are useful in cryptographic operations for using as nonce, initial vector, secret key, etc. Security of the cryptosystem relies on the secret key parameters, so a good pseudorandom number is needed. In this paper, we have proposed a new approach for generation of pseudorandom number. This method uses the three dimensional combinational puzzle Rubik Cube for generation of random numbers. The number of possible combinations of the cube approximates to 43 quintillion. The large possible combination of the cube increases the complexity of brute force attack on the generator. The generator uses cryptographic hash function. Chaotic map is being employed for increasing random behavior. The pseudorandom sequence generated can be used for cryptographic applications. The generated sequences are tested for randomness using NIST Statistical Test Suite and other testing methods. The result of the tests and analysis proves that the generated sequences are random.

M-sequence and its applications to nonlinear system identification

  • Kashiwagi, Hiroshi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.7-12
    • /
    • 1994
  • This paper describes an outline of pseudorandom M-sequence and its applications to measurement and control engineering. At first, generation and properties of M-sequence is briefly described and then its applications to delay time measurement, information transmission by use of M-array, two dimensional positioning, fault detection of logical circuit, fault detection of RAM, linear and nonlinear system identification.

  • PDF

PN Sequence Generation from 2-D Array of Shift Registers

  • Kim, Hyun-Jung;Lee, In-Kyu;Kim, Woon-Kyung M.
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.273-279
    • /
    • 2005
  • Toward code division multiple access (CDMA) communications and data protection, we propose and analyze pseudorandom noise (PN) sequences generated from a 2-dimensional array structure of shift-registers. For any positive integers m and n, we construct PN sequences of period $2^{mm}-1$ using an $m{\times}n$ array of registers and show that we can generate all shifted PN sequences as required by IS-95x with the proper linear combination of available sequences.

  • PDF

Analysis of Pseudorandom Sequences Generated by Maximum Length Complemented Cellular Automata (최대길이 여원 CA 기반의 의사랜덤수열 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.1001-1008
    • /
    • 2019
  • A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

Performance Analysis of PN Code Acquisition with Antenna Diversity (안테나 다이버시티를 이용한 PN 코드 획득 성능 분석)

  • Seo, Sung Il
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.1
    • /
    • pp.120-124
    • /
    • 2017
  • In this paper, effect of antenna diversity on pseudorandom noise (PN) code acquisition performance is analyzed and simulated for a direct sequence/code division multiple access (DS/CDMA) overlay system where a CDMA user and a narrowband user coexist in the same frequency band. From the simulation results, it is shown that the antenna diversity is very effective in improving the PN acquisition performance. The results of this paper can be applied to design of synchronization scheme for a DS/CDMA overlay environment.

Binary pseudorandom sequences of period $2^{m}-1$ with ideal autocorrelation generated by the polynomial $z^{d}+(z+1)^{d}$ (다항식 $z^{d}+(z+1)^{d}$에 의해 발생된 이상적인 자기상관을 갖는 주기 $2^{m}-1$의 이진 의사불규칙 시퀀스)

  • 노종선;정하봉;윤민선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1165-1172
    • /
    • 1998
  • In this paper, we present a construction for binary pseudorandom sequences of period $2^{m}-1$ with ideal autocorraltion property using the polynomial $z^{d}+(z+1)^{d}$. We show that the sequence obtained from the polynomial becomes an m-sequence for certain values of d. We also find a few values of d which yield new binary sequences with ideal autocorrelation property when m is $3k{\pm}1$, where k is a positive integer. These new sequences are represented using trace function and the results are tabulated.

  • PDF

Identification of Volterra Kernels of Nonlinear System Having Backlash Type Nonlinearity

  • Rong, Li;Kashiwagi, H.;Harada, H.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1999.10a
    • /
    • pp.141-144
    • /
    • 1999
  • The authors have recently developed a new method for identification of Volterra kernels of nonlinear systems by use of pseudorandom M-sequence and correlation technique. And it is shown that nonlinear systems which can be expressed by Volterra series expansion are well identified by use of this method. However, there exist many nonlinear systems which can not be expressed by Volterra series mathematically. A nonlinear system having backlash type nonliear element is one of those systems, since backlash type nonlinear element has multi-valued function between its input and output. Since Volterra kernel expression of nonlinear system is one of the most useful representations of non-linear dynamical systems, it is of interest how the method of Volterra kernel identification can be ar plied to such backlash type nonlinear system. The authors have investigated the effect of application of Volterra kernel identification to those non-linear systems which, accurately speaking, is difficult to express by use of Volterra kernel expression. A pseudorandom M-sequence is applied to a nonlinear backlash-type system, and the crosscorrelation function is measured and Volterra kernels are obtained. The comparison of actual output and the estimated output by use of measured Volterra kernels show that we can still use Volterra kernel representation for those backlash-type nonlinear systems.

  • PDF