• Title/Summary/Keyword: random sequence

Search Result 736, Processing Time 0.031 seconds

Binary random sequence generation by use of random sampling of M-sequence

  • Hiroshi Harada;Hiroshi Kashiwagi;Satoshi Honda;Kazuo Oguri
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • pp.832-835
    • /
    • 1987
  • This paper proposes a new method of generating binary random sequences using a randomly sampled M-sequence. In this paper two methods of sampling are proposed. Expected values of the autocorrelation function of the sequence generated by these methods are calculated theoretically. From the results of computer simulation, it is shown that using these methods, we can get binary random sequences which have good random properties.

  • PDF

A Comparison of Three Fixed-Length Sequence Generators of Synthetic Self-Similar Network Traffic (Synthetic Self-Similar 네트워크 Traffic의 세 가지 고정길이 Sequence 생성기에 대한 비교)

  • Jeong, Hae-Duck J.;Lee, Jong-Suk R.
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.899-914
    • /
    • 2003
  • It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

A Study on Digital Information Hiding Technique using Random Sequence and Hadamard Matrix (랜덤시퀀스와 Hadamard 행렬을 이용한 디지털 정보은폐 기술에 관한 연구)

  • 김장환;김규태;김은수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1339-1345
    • /
    • 1999
  • In this paper we propose the digital information hiding technique by which we use the combination of random sequence and Hadamard matrix to hide multiple information. The prior work used only one random sequence multiplied by information signal to lower the energy level of information signal and thus it is difficult for a third party to detect the information signal or jam it. But because we have to use the orthogonal code for hiding key in order to hide multiple information in the same digital image, only the use of random sequence that are not uncorrelated has some problems in the information hiding scheme. Thus we present a new information hiding scheme that can be used in hiding multiple information by the use of random sequence that spreads the energy level of the data to be hidden and Hadamard matrix that makes the random sequence uncorrelated.

  • PDF

Study on the Generation of Inaudible Binary Random Number Using Canonical Signed Digit Coding (표준 부호 디지트 코딩을 이용한 비가청 이진 랜덤 신호 발생에 관한 연구)

  • Nam, MyungWoo;Lee, Young-Seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.263-269
    • /
    • 2015
  • Digital watermarking is imperceptible and statistically undetectable information embeds into digital data. Most information in digital audio watermarking schemes have used binary random sequences. The embedded binary random sequence distorts and modifies the original data while it plays a vital role in security. In this paper, a binary random sequence to improve imperceptibility in perceptual region of the human auditory system is proposed. The basic idea of this work is a modification of a binary random sequence according to the frequency analysis of adjacent binary digits that have different signs in the sequence. The canonical signed digit code (CSDC) is also applied to modify a general binary random sequence and the pair-matching function between original and its modified version. In our experiment, frequency characteristics of the proposed binary random sequence was evaluated and analyzed by Bark scale representation of frequency and frequency gains.

Random number generation by use of de Bruijin sequence

  • Harada, Hiroshi;Kashiwagi, Hiroshi;Oguri, Kazuo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10b
    • /
    • pp.1033-1036
    • /
    • 1988
  • This paper proposes a new method for generation of uniform random numbers using binary random sequences. These binary sequences are obtained from a de Bruijn sequence by random sampling method. Several statistical tests are carried out for the random numbers generated by the proposed method, and it is shown that the random numbers have good random properties.

  • PDF

A CLT FOR A SEQUENCE OF RANDOM FIELDS ON A RESTRICTED INDEXED SET

  • JEON T. I.
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.441-453
    • /
    • 2005
  • In this article we will introduce a real valued random field on a restricted indexed set and construct a classical asymptotic limit theorems on them. We will survey the basic properties of weakly dependent random processes and investigate two major mixing conditions for sequences of random variables. The concepts of weakly dependent sequence of random variables will be generalized to the case of random fields. Finally we will construct a central limit theorem and prove it.

Power Spectra of the Hybrid Random PWM(HRPWM) Technique Adopting a Random Triangular Carrier (랜덤 삼각파 캐리어를 적용한 하이브리드 랜덤 PWM(HRPWM)방식의 파워 스펙트럼)

  • Kim Ki-Seon;Lim Young-Cheol;Park Sung-Jun;Kim Kwang-Heon;Jung Young-Gook
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.10 no.5
    • /
    • pp.501-507
    • /
    • 2005
  • This paper proposes a Hybrid Random PWM(HRPWM) technique using a LF2407 DSP board in order to spread the power spectra of an induction motor. The proposed method is composed to the PRBS (Pseudo-Random Binary Sequence) with the Lead-Lag random bit and the random triangular carrier for the logical comparison. Also, a DSP generates the random number, the PRBS and the three-phase reference signal, a MAX038 chip operating as frequency modulator generates the random triangular carrier. For verification of the proposed method, the experiments were conducted with a three-phase adjustable speed a.c drives, and the results of simulations and experiments are presented.

A Study on a Binary Random Sequence Generator with Two Characteristic Polynomials (두개의 특성 다항식으로 구성된 이진 난수열 발생기에 관한 연구)

  • 김대엽;주학수;임종인
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.77-85
    • /
    • 2002
  • A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

Algorithmic Generation of Self-Similar Network Traffic Based on SRA (SRA 알고리즘을 이용한 Self-Similar 네트워크 Traffic의 생성)

  • Jeong HaeDuck J.;Lee JongSuk R.
    • The KIPS Transactions:PartC
    • /
    • v.12C no.2 s.98
    • /
    • pp.281-288
    • /
    • 2005
  • It is generally accepted that self-similar (or fractal) Processes may provide better models for teletraffic in modem computer networks than Poisson processes. f this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).