• Title/Summary/Keyword: Sampling algorithm

Search Result 1,005, Processing Time 0.026 seconds

Parameter estimation of weak space-based ADS-B signals using genetic algorithm

  • Tao, Feng;Jun, Liang
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.324-331
    • /
    • 2021
  • Space-based automatic dependent surveillance-broadcast (ADS-B) is an important emerging augmentation of existing ground-based ADS-B systems. In this paper, the problem of space-based ultra-long-range reception processing of ADS-B signals is described. We first introduce a header detection method for accurately determining the pulse position of a weak ADS-B signal. We designed a signal encoding method, shaping method, and fitness function. We then employed a genetic algorithm to perform high-precision frequency and phase estimations of the detected weak signal. The advantage of this algorithm is that it can simultaneously estimate the frequency and phase, meaning a direct coherent demodulation can be implemented. To address the computational complexity of the genetic algorithm, we improved the ratio algorithm for frequency estimation and raised the accuracy beyond that of the original ratio algorithm with only a slight increase in the computational complexity using relatively few sampling points.

Comparison between REML and Bayesian via Gibbs Sampling Algorithm with a Mixed Animal Model to Estimate Genetic Parameters for Carcass Traits in Hanwoo(Korean Native Cattle) (한우의 도체형질 유전모수 추정을 위한 REML과 Bayesian via Gibbs Sampling 방법의 비교 연구)

  • Roh, S.H.;Kim, B.W.;Kim, H.S.;Min, H.S.;Yoon, H.B.;Lee, D.H.;Jeon, J.T.;Lee, J.G.
    • Journal of Animal Science and Technology
    • /
    • v.46 no.5
    • /
    • pp.719-728
    • /
    • 2004
  • The aims of this study were to estimate genetic parameters for carcass traits on Hanwoo(Korean Native Cattle) and to compare two different statistical algorithms for estimating genetic parameters. Data obtained from 1526 steers at Hanwoo Improvement Center and Hanwoo Improvement Complex Area from 1996 to 2001 were used for the analyses. The carcass traits considered in these studies were carcass weight, dressing percent, eye muscle area, backfat thickness, and marbling score. Estimated genetic parameters using EM-REML algorithm were compared to those by Bayesian inference via Gibbs Sampling to find out statistical properties. The estimated heritabilities of carcass traits by REML method were 0.28, 0.25, 0.35, 0.39 and 0.51, respectively and those by Gibbs Sampling method were 0.29, 0.25, 0.40, 0.42 and 0.54, respectively. This estimates were not significantly different, even though the estimated heritabilities by Gibbs Sampling method were higher than ones by REML method. Since the estimated statistics by REML method and Gibbs Sampling method were not significantly different in this study, it is inferred that both mothods could be efficiently applied for the analysis of carcass traits of cattle. However, further studies are demanded to define an optimal statistical method for handling large scale performance data.

A Proposed Algorithm and Sampling Conditions for Nonlinear Analysis of EEG (뇌파의 비선형 분석을 위한 신호추출조건 및 계산 알고리즘)

  • Shin, Chul-Jin;Lee, Kwang-Ho;Choi, Sung-Ku;Yoon, In-Young
    • Sleep Medicine and Psychophysiology
    • /
    • v.6 no.1
    • /
    • pp.52-60
    • /
    • 1999
  • Objectives: With the object of finding the appropriate conditions and algorithms for dimensional analysis of human EEG, we calculated correlation dimensions in the various condition of sampling rate and data aquisition time and improved the computation algorithm by taking advantage of bit operation instead of log operation. Methods: EEG signals from 13 scalp lead of a man were digitized with A-D converter under the condition of 12 bit resolution and 1000 Hertz of sampling rate during 32 seconds. From the original data, we made 15 time series data which have different sampling rate of 62.5, 125, 250, 500, 1000 hertz and data acqusition time of 10, 20, 30 second, respectively. New algorithm to shorten the calculation time using bit operation and the Least Trimmed Squares(LTS) estimator to get the optimal slope was applied to these data. Results: The values of the correlation dimension showed the increasing pattern as the data acquisition time becomes longer. The data with sampling rate of 62.5 Hz showed the highest value of correlation dimension regardless of sampling time but the correlation dimension at other sampling rates revealed similar values. The computation with bit operation instead of log operation had a statistically significant effect of shortening of calculation time and LTS method estimated more stably the slope of correlation dimension than the Least Squares estimator. Conclusion: The bit operation and LTS methods were successfully utilized to time-saving and efficient calculation of correlation dimension. In addition, time series of 20-sec length with sampling rate of 125 Hz was adequate to estimate the dimensional complexity of human EEG.

  • PDF

Inverse Scattering of Two-Dimensional Objects Using Linear Sampling Method and Adjoint Sensitivity Analysis

  • Eskandari, Ahmadreza;Eskandari, Mohammad Reza
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.1
    • /
    • pp.308-313
    • /
    • 2015
  • This paper describes a technique for complete identification of a two-dimensional scattering object and multiple objects immersed in air using microwaves where the scatterers are assumed to be a homogenous dielectric medium. The employed technique consists of initially retrieving the shape and position of the scattering object using a linear sampling method and then determining the electric permittivity and conductivity of the scatterer using adjoint sensitivity analysis. Incident waves are assumed to be TM (Transverse Magnetic) plane waves. This inversion algorithm results in high computational speed and efficiency, and it can be generalized for any scatterer structure. Also, this method is robust with respect to noise. The numerical results clearly show that this hybrid approach provides accurate reconstructions of various objects.

Canonical Sampling Method for Initial Conditions for Reactive Flux Calculations Using Nose-Hoover Chains

  • Lee, Song-Hi;Pak, Young-Shang
    • Bulletin of the Korean Chemical Society
    • /
    • v.25 no.4
    • /
    • pp.533-538
    • /
    • 2004
  • Canonical sampling method has been presented to generate the initial conditions for reactive flux studies of organic reactions in water. Velocity Verlet version of Nose-Hoover chain dynamics algorithm has been employed to sample the initial conditions according to canonical distribution. The unstable normal mode of a transition state has been introduced to define a dividing plane separating reactant and product regions in reaction processes. This method has been implemented and tested for the case iels-Alder reaction of methyl vinyl ketone (MVK) and cyclopentadiene (CPD) in water, providing a reliable tool for further reactive flux molecular dynamics studies in condensed media.

The Ultimate Bound of Discrete Sliding Mode Control System with Short Sampling Period for DC Motor System (DC 모터 시스템을 위한 짧은 샘플링 시간을 갖는 이산슬라이딩 모드의 최종 수렴범위)

  • Park, Heum-Yong;Jo, Young-Hun;Park, Kang-Bak
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.3
    • /
    • pp.245-248
    • /
    • 2010
  • Almost all of control schemes proposed so far have been designed in the continuous-time domain theoretically. Actual systems, however, have been implemented in the discrete-time domain since Micro Control Unit(MCU) and/or microprocessors have been used for the controllers. Thus, the overall system turned to be a sampled-data system, and generally speaking, the ultimate error cannot converge to zero in the actual system even though the proposed control algorithm showed the asymptotic stability in the continuous-time domain. In this paper, therefore, the ultimate error bound of a sampled data system with a short sampling period has been investigated. The ultimate error is shown to be related in the sampling period.

Analysis of DDS Sampling Method and Harmonic Composition

  • Zhi-lai Zhang;Shao-jun Jiang;Li-li Liang
    • Journal of Information Processing Systems
    • /
    • v.19 no.2
    • /
    • pp.164-172
    • /
    • 2023
  • Through theoretical proof and algorithm design, this paper numerically demonstrates that the three sampling methods of DDS are equivalent in amplitude-frequency characteristics. Depending on theoretical analysis, the article obtains the conclusion that 2 points are optimal when sampling at 2, 3, and 4 points. Built on the data results, this paper obtains the fractional form of the amplitude and phase of the DDS sampled signal; in addition, this paper also obtains the design parameters of the DDS post-stage filter. It also gives a control method for the calculation error when addressing this issue.

Fast Algorithm for Design of Spiral Inductor using Genetic Algorithm with Distributed Computing (유전 알고리듬과 분산처리기법을 이용한 스파이럴 인덕터의 고속설계 기법)

  • Sa, Ki-Dong;Ahn, Chang-Hoi
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.446-452
    • /
    • 2008
  • To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

A Design of Multiple Jammers Localization Algorithm Based on TDOA Method (TDOA기법 기반의 다중 재머 위치 추정 알고리즘 설계)

  • Kang, Hee Won;Lim, Deok Won;Heo, Moon-Beom
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.6
    • /
    • pp.729-737
    • /
    • 2012
  • In case that multiple jammers are transmitting the signals which are the same type a general algorithm based on TDOA method cannot estimate the positions of multiple jammers because there are many TDOA measurements including true and false values. This paper, therefore, designs a new algorithm based on TDOA method to localize multiple jammers. In this algorithm, TDOA measurements are obtained by rotating the reference sensor, and then the positions of multiple jammers can be estimated by detecting congregated point among the multiple estimated positions from TDOA measurements. Through computer simulations, it is verified that this algorithm localizes the multiple jammers well. The performance of the algorithm are also analysed by changing the distance between sensors and jammer, and sampling frequency.

Adaptive Digital Predictive Peak Current Control Algorithm for Buck Converters

  • Zhang, Yu;Zhang, Yiming;Wang, Xuhong;Zhu, Wenhao
    • Journal of Power Electronics
    • /
    • v.19 no.3
    • /
    • pp.613-624
    • /
    • 2019
  • Digital current control techniques are an attractive option for DC-DC converters. In this paper, a digital predictive peak current control algorithm is presented for buck converters that allows the inductor current to track the reference current in two switching cycles. This control algorithm predicts the inductor current in a future period by sampling the input voltage, output voltage and inductor current of the current period, which overcomes the problem of hardware periodic delay. Under the premise of ensuring the stability of the system, the response speed is greatly improved. A real-time parameter identification method is also proposed to obtain the precision coefficient of the control algorithm when the inductance is changed. The combination of the two algorithms achieves adaptive tracking of the peak inductor current. The performance of the proposed algorithms is verified using simulations and experimental results. In addition, its performance is compared with that of a conventional proportional-integral (PI) algorithm.