• Title/Summary/Keyword: Sampling-Based Algorithm

Search Result 480, Processing Time 0.028 seconds

Formulation of the Green's Functions for Coplanar Waveguide Microwave Devices as Genetic Algorithm-Based Complex Images

  • Han, DaJung;Lee, ChangHyeong;Kahng, Sungtek
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1600-1604
    • /
    • 2017
  • A new Complex Image Method based on Genetic Algorithm (GA) is proposed to calculate the Green's functions of CPW (coplanar waveguide)-type microwave components and antennas. The closed-forms of the spectral-domain integrals are obtained by the GA, avoiding the conventional procedures of the tedious linear algebra and the sampling conditions sensitive to the complex-variable sampling paths adopted in the Prony's and GPOF methods. The proposed method is compared with the numerical Sommerfeld Integral, which results in good agreement.

SHM-based probabilistic representation of wind properties: Bayesian inference and model optimization

  • Ye, X.W.;Yuan, L.;Xi, P.S.;Liu, H.
    • Smart Structures and Systems
    • /
    • v.21 no.5
    • /
    • pp.601-609
    • /
    • 2018
  • The estimated probabilistic model of wind data based on the conventional approach may have high discrepancy compared with the true distribution because of the uncertainty caused by the instrument error and limited monitoring data. A sequential quadratic programming (SQP) algorithm-based finite mixture modeling method has been developed in the companion paper and is conducted to formulate the joint probability density function (PDF) of wind speed and direction using the wind monitoring data of the investigated bridge. The established bivariate model of wind speed and direction only represents the features of available wind monitoring data. To characterize the stochastic properties of the wind parameters with the subsequent wind monitoring data, in this study, Bayesian inference approach considering the uncertainty is proposed to update the wind parameters in the bivariate probabilistic model. The slice sampling algorithm of Markov chain Monte Carlo (MCMC) method is applied to establish the multi-dimensional and complex posterior distribution which is analytically intractable. The numerical simulation examples for univariate and bivariate models are carried out to verify the effectiveness of the proposed method. In addition, the proposed Bayesian inference approach is used to update and optimize the parameters in the bivariate model using the wind monitoring data from the investigated bridge. The results indicate that the proposed Bayesian inference approach is feasible and can be employed to predict the bivariate distribution of wind speed and direction with limited monitoring data.

A Minimization Technique for BDD based on Microcanonical Optimization (Microcanonical Optimization을 이용한 BDD의 최소화 기법)

  • Lee, Min-Na;Jo, Sang-Yeong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.1
    • /
    • pp.48-55
    • /
    • 2001
  • Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the $\mu$O(microcanonical optimization). $\mu$O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.

  • PDF

Study on a Robust Optimization Algorithm Using Latin Hypercube Sampling Experiment and Multiquadric Radial Basis Function (Latin Hypercube Sampling Experiment와 Multiquadric Radial Basis Function을 이용한 최적화 알고리즘에 대한 연구)

  • Zhang, Yanli;Yoon, Hee-Sung;Koh, Chang-Seop
    • Proceedings of the KIEE Conference
    • /
    • 2007.04c
    • /
    • pp.162-164
    • /
    • 2007
  • This paper presents a "window-zoom-out" optimization strategy with relatively fewer sampling data. In this method, an optimal Latin hypercube sampling experiment based on multi-objective Pareto optimization is developed to obtain the sampling data. The response surface method with multiquadric radial basis function combined with (1+$\lambda$) evolution strategy is used to find the global optimal point. The proposed method is verified with numerical experiments.

  • PDF

Computationally-Efficient Algorithms for Multiuser Detection in Short Code Wideband CDMA TDD Systems

  • De, Parthapratim
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.27-39
    • /
    • 2016
  • This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

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.

Compressed Sensing Techniques for Video Transmission of Multi-Copter (멀티콥터 영상 전송을 위한 압축 센싱 기법)

  • Jung, Kuk Hyun;Lee, Sun Yui;Lee, Sang Hwa;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.63-68
    • /
    • 2014
  • This paper proposed a novel compressed sensing (CS) technique for an efficient video transmission of multi-copter. The proposed scheme is focused on reduction of the amount of data based on CS technology. First, we describe basic principle of Spectrum sensing. And then we compare AMP(Approximate Message Passing) with CoSaMP(Compressive Sampling Matched Pursuit) through mathematical analysis and simulation results. They are evaluated in terms of calculation time and complexity, then the promising algorithm is suggestd for multicopter operation. The result of experiment in this paper shows that AMP algorithm is more efficient than CoSaMP algorithm when it comes to calculation time and image error probability.

Vision-Based Lane Change Maneuver using Sliding Mode Control for a Vehicle (슬라이딩 모드 제어를 이용한 시각센서 기반의 차선변경제어 시스템 설계)

  • 장승호;김상우
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.8 no.6
    • /
    • pp.194-207
    • /
    • 2000
  • In this paper, we suggest a vision-based lane change control system, which can be applied on the straight road, without additional sensors such as a yaw rate sensor and a lateral accelerometer. In order to reduce the image processing time, we predict a reference line position during lane change using the lateral dynamics and the inverse perspective mapping. The sliding mode control algorithm with a boundary layer is adopted to overcome variations of parameters that significantly affects a vehicle`s lateral dynamics and to reduce chattering phenomenon. However, applying the sliding mode control to the system with a long sampling interval, the stability of a control system may seriously be affected by the sampling interval. Therefore, in this paper, a look ahead offset has been used instead of a lateral offset to reduce the effect of the long sampling interval due to the image processing time. The control algorithm is developed to follow the desired trajectory designed in advance. In the design of the desired trajectory, we take account of the constraints of lateral acceleration and lateral jerk for ride comfort. The performance of the suggested control system is evaluated in simulations as well as field tests.

  • PDF

Enhancement of the Box-Counting Algorithm for Fractal Dimension Estimation (프랙탈 차원 추정을 위한 박스 계수법의 개선)

  • So, Hye-Rim;So, Gun-Baek;Jin, Gang-Gyoo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.9
    • /
    • pp.710-715
    • /
    • 2016
  • Due to its simplicity and high reliability, the box-counting(BC) method is one of the most frequently used techniques to estimate the fractal dimensions of a binary image with a self-similarity property. The fractal calculation requires data sampling that determines the size of boxes to be sampled from the given image and directly affects the accuracy of the fractal dimension estimation. There are three non-overlapping regular grid methods: geometric-step method, arithmetic-step method and divisor-step method. These methods have some drawbacks when the image size M becomes large. This paper presents a BC algorithm for enhancing the accuracy of the fractal dimension estimation based on a new sampling method. Instead of using the geometric-step method, the new sampling method, called the coverage ratio-step method, selects the number of steps according to the coverage ratio. A set of experiments using well-known fractal images showed that the proposed method outperforms the existing BC method and the triangular BC method.

Triangular Prism Method Based on an Enhanced Sampling Method (개선된 샘플링 방법에 기초한 삼각프리즘법)

  • Jin, Gang-Gyoo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.2
    • /
    • pp.93-99
    • /
    • 2013
  • Fractal theory has been adopted as an effective tool for modelling complex and irregular natural phenomena facing in the fields of Computer Science, Engineering, Medical, Climatology and so on. In this paper, we presents an algorithm which enhances the performance of the triangular prism method(TPM) which has been widely used for fractal dimension extraction of natural terrains and images. For this, existing sampling methods are analyzed and a new sampling method which takes their merits is proposed. The effectiveness of the proposed algorithm is tested on fractal terrain maps and its performance is compared with that of other methods.