• Title/Summary/Keyword: Approximation Algorithm

Search Result 983, Processing Time 0.024 seconds

High Resolution Wideband Local Polynomial Approximation Beamforming for Moving Sources (이동하는 음원에 적합한 고분해능 광대역 LPA 빔형성기법)

  • Park Do-Hyun;Park Gyu-Tae;Lee Jung-Hoon;Lee Su-Hvoung;Lee Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.1
    • /
    • pp.1-10
    • /
    • 2005
  • This paper presents a wideband LPA (local polynomial approximation) beamforming algorithm that is appropriate for wideband moving sources. The Proposed wideband LPA algorithm adopts STMV (steered minimum variance) method that utilizes a steered covariance matrix obtained from multiple frequency components in one data snapshot, instead of multiple data snapshots in one frequency bin. The wideband LPA cost function is formed using STMV weight vector. The Proposed algorithm searches for the instantaneous DOA and angular velocity that maximize the wideband LPA cost function. resulting in a higher resolution performance than that of a DS LPA beamforming algorithm. Several simulations using artificial data and sea trial data are used to demonstrate the performance of the Proposed algorithm.

Design Optimization Using the Two-Point Convex Approximation (이점 볼록 근사화 기법을 적용한 최적설계)

  • Kim, Jong-Rip;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.6
    • /
    • pp.1041-1049
    • /
    • 2003
  • In this paper, a new local two-point approximation method which is based on the exponential intervening variable is proposed. This new algorithm, called the Two-Point Convex Approximation(TPCA), use the function and design sensitivity information from the current and previous design points of the sequential approximate optimization to generate a sequence of convex, separable subproblems. This paper describes the derivation of the parameters associated with the approximation and the numerical solution procedure. In order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve several typical design problems. These optimization results are compared with those of other optimizers. Numerical results obtained from the test examples demonstrate the effectiveness of the proposed method.

CIRCLE APPROXIMATION BY QUARTIC G2 SPLINE USING ALTERNATION OF ERROR FUNCTION

  • Kim, Soo Won;Ahn, Young Joon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.17 no.3
    • /
    • pp.171-179
    • /
    • 2013
  • In this paper we present a method of circular arc approximation by quartic B$\acute{e}$zier curve. Our quartic approximation method has a smaller error than previous quartic approximation methods due to the alternation of the error function of our quartic approximation. Our method yields a closed form of error so that subdivision algorithm is available, and curvature-continuous quartic spline under the subdivision of circular arc with equal-length until error is less than tolerance. We illustrate our method by some numerical examples.

3D Beamforming Techniques in Multi-Cell MISO Downlink Active Antenna Systems for Large Data Transmission (대용량 데이터 전송을 위한 다중 셀 MISO 하향 능동 안테나 시스템에서 3D 빔포밍 기법)

  • Kim, Taehoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.11
    • /
    • pp.2298-2304
    • /
    • 2015
  • In this paper, we provide a new approach which optimizes the vertical tilting angle of the base station for multi-cell multiple-input single-output (MISO) downlink active antenna systems (AAS). Instead of the conventional optimal algorithm which requires an exhaustive search, we propose simple and near optimal algorithms. First, we represent a large system approximation based vertical beamforming algorithm which is applied to the average sum rate by using the random matrix theory. Next, we suggest a signal-to-leakage-and-noise ratio (SLNR) based vertical beamforming algorithm which simplifies the optimization problem considerably. In the simulation results, we demonstrate that the performance of the proposed algorithms is near close to the exhaustive search algorithm with substantially reduced complexity.

AN ALGORITHMIC APPROACH TO THE MARKOV CHAIN WITH TRANSITION PROBABILITY MATRIX OF UPPER BLOCK-HESSENBERG FORM

  • Shin, Yang-Woo;Pearce, C.E.M.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.2
    • /
    • pp.403-426
    • /
    • 1998
  • We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

SMOOTHING APPROXIMATION TO l1 EXACT PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION PROBLEMS

  • BINH, NGUYEN THANH
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.3_4
    • /
    • pp.387-399
    • /
    • 2015
  • In this paper, a new smoothing approximation to the l1 exact penalty function for constrained optimization problems (COP) is presented. It is shown that an optimal solution to the smoothing penalty optimization problem is an approximate optimal solution to the original optimization problem. Based on the smoothing penalty function, an algorithm is presented to solve COP, with its convergence under some conditions proved. Numerical examples illustrate that this algorithm is efficient in solving COP.

Detection of Left Ventricular Contours Based on Elliptic Approximation and ML Estimate in Angiographic Images

  • Om, Kyong-Sik;Chung, Jae-Ho
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.2
    • /
    • pp.9-14
    • /
    • 1996
  • The goal of this research is to provide a practical algorithm for outlining the left ventricular cavity in digital subtraction angiography. The proposed algorithm is based on the elliptic approximation and ML (Maximum Likelihood) estimate, and it produces a good results regarding execution time, robustness against noise, accuracy, and range of position of ROI (Regions Of Interest).

  • PDF

Comparison of the characteristics of Distance Relaying Algorithms (거리계전 알고리즘별 특성 비교)

  • Kang, Sang-Hee;Lee, Seung-Jae;No, Jae-Keun;Yang, Eon-Pil;Jeong, Jong-Jin
    • Proceedings of the KIEE Conference
    • /
    • 2001.05a
    • /
    • pp.34-37
    • /
    • 2001
  • This paper presents some results after comparing the characteristics of 3 algorithms, which are discrete Fourier transform based algorithm, least square method, and modified differential approximation algorithm, used at most distance relays all over the world. In case of the DFT based distance relaying algorithm, the length of the algorithm data window and the cut-off frequency of an anti-aliasing low-pass filter adopted are fixed. On the other hand, the data window lengths are changed according to the corresponding low-pass filters in the rest two algorithms. In series of tests, the apparent impedance estimated by the modified differential approximation algorithm shows faster and more stable characteristics of convergence than the two others.

  • PDF

3-Dimensional Finite Element Analysis of Thermoforming Processes (열성형공정의 3차원 유한요소해석)

  • G.J. Nam;D.S. Son;Lee, J.W.
    • The Korean Journal of Rheology
    • /
    • v.11 no.1
    • /
    • pp.18-27
    • /
    • 1999
  • Predicting the deformation behaviors of sheets in thermoforming processes has been a daunting challenge due to the strong nonlinearities arising from very large deformations, mold-polymer contact condition and hyperelasticity constitutive equations. Nonlinear numerical analysis is always required to face this challenge especially for realistic processing conditions. In this study a 3-D algorithm and the membrane approximation are developed for thermoforming processes. The constitutive equation is expressed in terms of the 2nd Piola-Kirchhoff stress tensor and the Cauchy-Green deformation tensor. The 2-term Mooney-Rivlin model is used for the material model equation. The algorithm is established by the finite element formulation employing the total Lagrangian coordinate. The deformation behavior and the stress distribution results of 3-D algorithm with various point boundary conditions are compared to those of the membrane approximation algorithm. Also, the slip boundary condition and the no-slip boundary condition are applied for the systems that have molds. Finally, the effect of sheet temperatures on the final thickness distribution is investigated for the ABS material.

  • PDF

An analysis of the effects of LLR approximation on LDPC decoder performance (LLR 근사화에 따른 LDPC 디코더의 성능 분석)

  • Na, Yeong-Heon;Jeong, Sang-Hyeok;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.405-409
    • /
    • 2009
  • In this paper, the effects of LLR (Log-Likelihood Ratio) approximation on LDPC (Low-Density Parity-Check) decoder performance are analyzed, and optimal design conditions of LDPC decoder are derived. The min-sum LDPC decoding algorithm which is based on an approximation of LLR sum-product algorithm is modeled and simulated by MATLAB, and it is analyzed that the effects of LLR approximation bit-width and maximum iteration cycles on the bit error rate (BER) performance of LDCP decoder. The parity check matrix for IEEE 802.11n standard which has block length of 1,944 bits and code rate of 1/2 is used, and AWGN channel with QPSK modulation is assumed. The simulation results show that optimal BER performance is achieved for 7 iteration cycles and LLR bit-width of (7,5).

  • PDF