• Title/Summary/Keyword: Pseudo Random Function

Search Result 49, Processing Time 0.043 seconds

A Combined Pseudo-random Noise Signal Based Advanced Region Correlation Scheme for BOC(pn,n) Modulated GNSS Signals in Repeat-back Jamming Environment (재방송 재밍 환경에서 BOC(pn,n) GNSS 변조된 신호를 위한 CP-ARC 기법)

  • Yoo, Seungsoo;Yeom, Dong-Jin;Jee, Gyu-In;Kim, Sun Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.11
    • /
    • pp.977-983
    • /
    • 2016
  • This paper proposes a novel code-tracking scheme to track the fine code synchronization for BOC (pn,n)-modulated global navigation satellite system signals in a repeat-back jamming environment. The correlation function of BOC (pn,n)-modulated signals has several peaks. The correlation function in the advanced offset region remains almost unchanged due to the repeat-back signals being received later than a line-of-sight signal in the same multipath signal receiving case. Additionally, the combined pseudo-random noise signal can be treated as repeat-back jamming signals, like multipath signals. In this paper, we propose a novel code-tracking scheme utilizing the advantages of using a combined pseudo-random noise signal in the advanced offset region and verify its performance through simulation.

A Study on the Conditional Survival Function with Random Censored Data

  • Lee, Won-Kee;Song, Myung-Unn
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.2
    • /
    • pp.405-411
    • /
    • 2004
  • In the analysis of cancer data, it is important to make inferences of survival function and to assess the effects of covariates. Cox's proportional hazard model(PHM) and Beran's nonparametric method are generally used to estimate the survival function with covariates. We adjusted the incomplete survival time using the Buckley and James's(1979) pseudo random variables, and then proposed the estimator for the conditional survival function. Also, we carried out the simulation studies to compare the performances of the proposed method.

  • PDF

Relation between the Irreducible Polynomials that Generates the Same Binary Sequence Over Odd Characteristic Field

  • Ali, Md. Arshad;Kodera, Yuta;Park, Taehwan;Kusaka, Takuya;Nogmi, Yasuyuki;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.166-172
    • /
    • 2018
  • A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

Efficient Parallel CUDA Random Number Generator on NVIDIA GPUs (NVIDIA GPU 상에서의 난수 생성을 위한 CUDA 병렬프로그램)

  • Kim, Youngtae;Hwang, Gyuhyeon
    • Journal of KIISE
    • /
    • v.42 no.12
    • /
    • pp.1467-1473
    • /
    • 2015
  • In this paper, we implemented a parallel random number generation program on GPU's, which are known for high performance computing, using LCG (Linear Congruential Generator). Random numbers are important in all fields requiring the use of randomness, and LCG is one of the most widely used methods for the generation of pseudo-random numbers. We explained the parallel program using the NVIDIA CUDA model and MPI(Message Passing Interface) and showed uniform distribution and performance results. We also used a Monte Carlo algorithm to calculate pi(${\pi}$) comparing the parallel random number generator with cuRAND, which is a CUDA library function, and showed that our program is much more efficient. Finally we compared performance results using multi-GPU's with those of ideal speedups.

Pseudo-Correlation-Function Based Unambiguous Tracking Technique for CBOC (6,1,1/11) Signals

  • Jeong, Gil-Seop;Kong, Seung-Hyun
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.4 no.3
    • /
    • pp.107-114
    • /
    • 2015
  • Binary Offset Carrier (BOC) signal planned for future Global Navigation Satellite System (GNSS) provided better positioning accuracy and smaller multipath error than GPS C/A signal. However, due to the multiple side peaks in the auto-correlation function (ACF) of the BOC modulated signals, a receiver may false lock onto one of the side peaks in the tracking mode. This false lock would then result in a fatal tracking error. In this paper, we propose an unambiguous tracking method for composite BOC (CBOC) signals to mitigate this problem. It aims to reduce the side peaks of the ACF of CBOC modulated signals. It is based on the combination of traditional CBOC correlation function (CF) and reference CF of unmodulated pseudo- random noise code (PRN code). First, we present that cross-correlation function (CCF) with unmodulated PRN code is close to the secondary peaks of the traditional CBOC. Then, we obtain an unambiguous correlation function by subtracting traditional CBOC ACF from these CFs. Finally, the tracking performance for the CBOC signals is examined, and it is shown that the proposed method has better performance than the traditional unambiguous tracking method in additive white Gaussian noise (AWGN) channel.

Gaussian Processes for Source Separation: Pseudo-likelihood Maximization (유사-가능도 최대화를 통한 가우시안 프로세스 기반 음원분리)

  • Park, Sun-Ho;Choi, Seung-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.417-423
    • /
    • 2008
  • In this paper we present a probabilistic method for source separation in the case here each source has a certain temporal structure. We tackle the problem of source separation by maximum pseudo-likelihood estimation, representing the latent function which characterizes the temporal structure of each source by a random process with a Gaussian prior. The resulting pseudo-likelihood of the data is Gaussian, determined by a mixing matrix as well as by the predictive mean and covariance matrix that can easily be computed by Gaussian process (GP) regression. Gradient-based optimization is applied to estimate the demixing matrix through maximizing the log-pseudo-likelihood of the data. umerical experiments confirm the useful behavior of our method, compared to existing source separation methods.

Performance Enhancement of the Joint CDMA/PRMA Protocol Using Pseudo Bayesian Approach (의사 베이지안 접근법을 이용한 Joint CDMA/PRMA의 성능 향상에 관한 연구)

  • Kim, Kyungsoo;Kwangho Kook;Lee, Kangwon;Jiwhan Ahn;Park, Jeongrak
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.1
    • /
    • pp.49-58
    • /
    • 1999
  • A new channel access function is proposed to enhance the performance of the Joint CDMA/PRMA. It is obtained in consideration of the number of terminals in reservation mode and the number of terminals in contention mode whose probability distribution is estimated by applying pseudo Bayesian approach. Simulation results show that the performance of the Joint CDMA/PRMA can be improved by applying new channel access function under voice-only traffic and mixed voice/random-data traffic.

  • PDF

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.

Earthquake response analysis of series reactor

  • Bai, Changqing;Xu, Qingyu;Zhang, Hongyan
    • Structural Engineering and Mechanics
    • /
    • v.21 no.6
    • /
    • pp.621-634
    • /
    • 2005
  • A direct transfer substructure method is presented in this paper for analyzing the dynamic characteristics and the seismic random responses of a series reactor. This method combines the concept of FRF (frequency response function) and the transfer matrix algorithm with the substructure approach. The inner degrees of freedom of each substructure are eliminated in the process of reconstruction and the computation cost is reduced greatly. With the convenient solution procedure, the dynamic characteristics analysis of the structure is valid and efficient. Associated with the pseudo excitation algorithm, the direct transfer substructure method is applied to investigating the seismic random responses of the series reactor. The numerical results demonstrate that the presented method is efficient and practicable in engineering. Finally, a precise time integration method is employed in performing a time-history analysis on the series reactor under El Centro and Taft earthquake waves.