• 제어로봇시스템학회논문지
• /
• 제15권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.

• 전자공학회논문지A
• /
• 제29A권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.

• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.20-26
• /
• 2011

본 논문에서는 NM(node monitoring) 알고리듬과 NP(Piecewise Linear Function Approximation)를 사용해서 LDPC 코드 복호의 복잡도를 감소시키기 위한 효율적인 알고리듬을 제안한다. 이 NM 알고리듬은 새로운 node-threshold 방법과 message passing 알고리듬에 근거해서 제안되었는데, 이에 NP 방법을 사용해서 알고리듬의 복잡도를 더 줄일 수 있었다. 이 알고리듬의 효율성을 입증하기 위해서 모의 실험을 하였다. 모의실험결과, 기존에 잘 알려진 방법에 비해서 20% 정도 더 효율적이었다.

• 대한기계학회논문집A
• /
• 제26권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.

• 대한기계학회논문집
• /
• 제19권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.

• Interaction and multiscale mechanics
• /
• 제2권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.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• 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.

• 한국전자통신학회논문지
• /
• 제10권11호
• /
• pp.1231-1238
• /
• 2015

본 논문에서는 노드 모니터링(NM)과 Piecewise Linear Function Approximation(: NP)을 사용하여 LDPC 디코딩 알고리듬의 계산복잡도를 감소시키는 알고리듬을 제안한다. 이 알고리듬은 기존의 알고리듬보다도 더 효율적이다. 제안된 알고리즘이 기존의 방법보다도 개선되었다는 것을 확인하기 위해서 모의실험을 하였다. 실험결과, 제안된 알고리즘의 계산은 기존의 방법에 비해 약 20 % 향상되었음을 확인하였다.

• Journal of applied mathematics & informatics
• /
• 제27권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.

• 대한기계학회논문집A
• /
• 제30권2호
• /
• 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.