• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1280-1283
• /
• 2002

This paper discusses issues in VLSI design and implementation of high performance datapath circuits. Of particular concern will he various types of multiplier and adder, which are fundamental to DSP operations. Performance comparison will be provided in terms of sampling speed, layout area, and in particular, power consumption, with techniques that may be applied to reduce power dissipation also suggested. As an example, a low power, high performance recursive filter achieved through bit-level pipelining technique is illustrated

• ETRI Journal
• /
• 제10권4호
• /
• pp.89-98
• /
• 1988

We consider an N duplicate-server system, where each server consists of two reconfigurable duplicated units which are subject to breakdowns. This system is studied analytically using generating functions, and also numerically using the matrix-geometric procedure. Using the generating function approach we obtain a recursive expression of the queuelength distribution for N=1. This expression in difficult to generalize to N>1. The numerical method is applicable for any value of N. For any N, we also obtain the condition for stability and the availability of the system.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.147-158
• /
• 2004

Sufficient conditions are given under which a generalized class of kernel-type estimators allows asymptotic approximation on the modulus of continuity. This generalized class includes sample distribution function, kernel-type estimator of density function, and an estimator that may apply to the censored case. In addition, an application is given to asymptotic normality of recursive density estimators of density function at an unknown point.

• 한국전산유체공학회지
• /
• 제11권2호
• /
• pp.62-66
• /
• 2006

In this paper an automated hole-finding method for overset grids is introduced which uses recursive octree-cell division. A graphic program which enables the user to do the hole-cutting with ease is also introduced. Using this program it is found that there is an optimum combination of the level of octree division and vector calculation for the efficient and fast hole finding.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2004년도 추계 학술대회논문집
• /
• pp.83-86
• /
• 2004

In this paper an automated hole-finding method for overset grids is introduced which uses recursive octree-cell division. A graphic program which enables the user to do the hole-cutting with ease is also introduced. Using this program it was found that a proper combination of the level of octree division and vector calculation should be used for efficient and fast hole finding.

• 한국가시화정보학회:학술대회논문집
• /
• 한국가시화정보학회 2003년도 추계학술대회 논문집
• /
• pp.63-66
• /
• 2003

A new algorithm, CBIR (Correlation Based Image Registration) was proposed to improve the resolution of image registration for PSP (Pressure Sensitive Paint). The local displacement vectors were obtained by finding the displacement which maximizes the cross-correlation between two interrogation windows of 'wind-off' and 'wind-on' images. A recursive multigrid processing was employed to increase the non-linear spatial resolutions. The variations of image were precisely measured without identifying the control points.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1992년도 추계학술대회 논문집
• /
• pp.161-165
• /
• 1992

The important properties of industrial scale or weighing machine operated in production lines are quickness and precision. This paper presents an algorithm which meets the importance. The algorithm of Recursive Least Squares Regression is described for the weighing system simulated as a dynamic model of the second order. Using the model and the algorithm, model parameters and then the mass being weighed can be determined from the step input. The performance of the algorithm is illustrated in digital simulation. Discussions have been extended to the development of fast converging algorithm. It turns out that the algorithm shows several desirable features suitable for microcomputer assisted realtime signal processing.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.203-207
• /
• 1992

In this paper, a new GPC(Generalized Predictive Control) algorithm which is robust to disturbances isproposed. This controller minimizes the LQ cost function when the disturbance maximizes this cost function. The solution is obtained from the min-max problem which can be solved by differential game theory and has the non-recursive form which does not use the Riccati equation. Its another solution for state space models is investigated.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.896-900
• /
• 1992

This paper presents a comprehensive methodology of automatic feature recognition for rotational parts. The parts of interest are rotational without deviation. In stage one, IGES formatted daa of 2D engineering drawings are transformed into three independent graphs through upperhalf profile. In stage two, recursive evaluations are made to recognize features and relevant information is acquired. Finally,an example is evaluated to demonstrate the recognition power of the developed algorithm for rotational features.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.507-512
• /
• 1992

This paper presents a method for the automatic generation of assembly sequences based on the recursive extraction of a preferred part along with the verification of its disassemblability. To verify the disassemblability of the part we inference the geometric precedence constraints using a method of extracting separable directions for the part and determine the disassemblability cost by the separability and stability cost. The proosed method provides a local optimal solution of finding a cost effective assembly plan, and the feasibility of calculating robot motion programs by evaluating separable directions in flexible manufacturing application. A case study is given to illustrate the concepts and procedure of the proposed scheme.