• Title/Summary/Keyword: Approximation Order

Search Result 1,077, Processing Time 0.026 seconds

Implementation of Efficient Exponential Function Approximation Algorithm Using Format Converter Based on Floating Point Operation in FPGA (부동소수점 기반의 포맷 컨버터를 이용한 효율적인 지수 함수 근사화 알고리즘의 FPGA 구현)

  • Kim, Jeong-Seob;Jung, Seul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.11
    • /
    • pp.1137-1143
    • /
    • 2009
  • This paper presents the FPGA implementation of efficient algorithms for approximating exponential function based on floating point format data. The Taylor-Maclaurin expansion as a conventional approximation method becomes inefficient since high order expansion is required for the large number to satisfy the approximation error. A format converter is designed to convert fixed data format to floating data format, and then the real number is separated into two fields, an integer field and an exponent field to separately perform mathematic operations. A new assembly command is designed and added to previously developed command set to refer the math table. To test the proposed algorithm, assembly program has been developed. The program is downloaded into the Altera DSP KIT W/STRATIX II EP2S180N Board. Performances of the proposed method are compared with those of the Taylor-Maclaurin expansion.

An Image Improvement for Microwave Diffraction Tomography under the Born Approximation Based on the Projection Function (Born 근사하에 투영함수를 이용한 초고주파 회절단층촬영의 영상개선)

  • 서경환;김상기;라정웅;김세윤
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.2
    • /
    • pp.1-7
    • /
    • 1992
  • A consideration for image improvement under the Born approximation in the microwave diffraction tomography is suggested by using a projection function. The limiting factors in the degrading reconstructed image due to Born approximation are identified in terms of projection function and its modification is suggested to improve the degraded image based upon the Born approximation. In order to verify the proposed method, the reconstructed images are shown by computer simulation from the back-scattered data of angular and frequency diversity for squared dielectric cylinder with a various relative dielectric constant. From simulation results, it was shown that the proposed method can lead to a fairly good improved image for a severe degraded one irrespective of homogeneous and inhomogeneous dielectric object. In the future, the analysis on the limitation of this method should be considered and performed by means of more quantitative method.

  • PDF

Node Monitoring Algorithm with Piecewise Linear Function Approximation for Efficient LDPC Decoding (Node Monitoring 알고리듬과 NP 방법을 사용한 효율적인 LDPC 복호방법)

  • Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.1
    • /
    • pp.20-26
    • /
    • 2011
  • In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

The Semi-Analytic Structural Sensitivity Using Pade Approximation (Pade근사를 이용한 준해석 구조 민감도의 해석)

  • Dan, Ho-Jin;Lee, Byung-Chai
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.12
    • /
    • pp.2631-2635
    • /
    • 2002
  • The semi-analytic sensitivity analysis using Pade approximation is presented for linear elastic structures. Although the semi-analytic method has several advantages, accuracy of the method prevents it from practical application. One of promising remedies is the use of geometric series for the matrix inversion. Though series expansion of order three has been successfully applied to the calculation of the structural sensitivity in the most range of the design perturbation, it is prone to have a slow convergence for large perturbation. To overcome this shortage, Pade approximation is introduced so that it can broaden the trust region of the perturbation without adding expansion terms. Numerical results show that the confident sensitivity can be obtained with tiny expenses of computation effort.

Development of an Efficient Line Search Method by Using the Sequential Polynomial Approximation (순차적 다항식 근사화를 적용한 효율적 선탐색기법의 개발)

  • 김민수;최동훈
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.2
    • /
    • pp.433-442
    • /
    • 1995
  • For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

A study on convergence and complexity of reproducing kernel collocation method

  • Hu, Hsin-Yun;Lai, Chiu-Kai;Chen, Jiun-Shyan
    • Interaction and multiscale mechanics
    • /
    • v.2 no.3
    • /
    • pp.295-319
    • /
    • 2009
  • In this work, we discuss a reproducing kernel collocation method (RKCM) for solving $2^{nd}$ order PDE based on strong formulation, where the reproducing kernel shape functions with compact support are used as approximation functions. The method based on strong form collocation avoids the domain integration, and leads to well-conditioned discrete system of equations. We investigate the convergence and the computational complexity for this proposed method. An important result obtained from the analysis is that the degree of basis in the reproducing kernel approximation has to be greater than one for the method to converge. Some numerical experiments are provided to validate the error analysis. The complexity of RKCM is also analyzed, and the complexity comparison with the weak formulation using reproducing kernel approximation is presented.

Target Strength Prediction of Scaled Model by the Kirchhoff Approximation Method (Kirchhoff 근사 방법을 이용한 축소모델의 표적강도 예측)

  • 김영현;주원호;김재수
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.442-445
    • /
    • 2004
  • The acoustic target strength (TS) of submarine is associated with its active detection, positioning and classification. That is, the survivability of submarine depends on its target strength. So it should be managed with all possible means. An anechoic coating to existing submarine or changing of curvature can be considered as major measures to reduce the TS of submarine. It is mainly based on the prediction of its TS. Under this circumstances, a study on the more accurate numerical methods becomes big topic for submarine design. In this paper, Kirchhoff approximation method was adopted as a numerical tool for the physical optics region. Secondly, the scaled models of submarine were built and tested in order to verify its performance. Through the comparison, it was found out that the Kirchhoff approximation method could be good design tool for the prediction of TS of submarine.

  • PDF

Efficient LDPC Decoding Algorithm Using Node Monitoring (노드 모니터링에 의한 효율적인 LDPC 디코딩 알고리듬)

  • Suh, Hee-Jong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1231-1238
    • /
    • 2015
  • In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.

APPROXIMATION METHOD FOR SCATTERED DATA FROM SHIFTS OF A RADIAL BASIS FUNCTION

  • Yoon, Jung-Ho
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1087-1095
    • /
    • 2009
  • In this paper, we study approximation method from scattered data to the derivatives of a function f by a radial basis function $\phi$. For a given function f, we define a nearly interpolating function and discuss its accuracy. In particular, we are interested in using smooth functions $\phi$ which are (conditionally) positive definite. We estimate accuracy of approximation for the Sobolev space while the classical radial basis function interpolation applies to the so-called native space. We observe that our approximant provides spectral convergence order, as the density of the given data is getting smaller.

  • PDF

Comparative Studies of Topology Optimization Using Continuous Approximation of Material Distribution (재료분포의 연속적인 근사를 이용한 위상최적설계 방법의 비교 연구)

  • Lim, Young-Seok;Yoo, Jeong-Hoon;Terada, Kenjiro;Nishiwaki, Shin-Ji;Min, Seung-Jae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.2 s.245
    • /
    • pp.164-170
    • /
    • 2006
  • To prevent the numerical instabilities in topology optimization, continuous approximation of material distribution (CAMD) is proposed to the homogenization design method (HDM) and the simple isotropic material with penalization (SIMP) method. The continuous FE approximation of design variables including high order elements is applied to the formulation of SIMP method. Numerical examples are presented to compare the efficiency of CAMD both in HDM and SIMP.