• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.1036-1041
• /
• 1993

The tip of the flexible robot arm has to be controlled by the active control reducing vibration because it has residual vibration after getting to desired position. This paper presents an end-point position control of a 1-link flexible robot arm having tip mass by the PID control algorithm. The system is composed of a flexible arm with tip mass, dc servomotor and ballscrew mechanism under translational motion. The feedback signal composed of the tip displacement measured by laser sensor, estimated velocity and acceleration is used to control the base motion. Theoretical results are obtained by applying the Laplace transform and the numerical inversion method to the governing equations. After the flexible robot arm reaches to. the desired position, the residual vibration is controlled by the PID algorithm. This paper gives the simulation and experimental results of end-point responses according to changing tip-mass and arm length. And this algorithm shows good effects of reducing the residual vibration. Approximately, theoretical response is in good agreement with experimental one.

• 전자공학회논문지A
• /
• 제31A권6호
• /
• pp.34-44
• /
• 1994

In this paper, an iterative inversion method in angular spectral domain is presented for microwave imaging of a perfectly conducting cylinder. Angular spectra are calculated from measured far-field scattered fields. And then both the propagating modes and the evanescent modes are defined. The center and initial shape of an unknown conductor may be obtained by the characteristics of angular spectra and the total scattering cross section (TSCS). Finally, the orignal shape is reconstructed by the modified Newton algorithm. By using well estimated initial shape the local minima can be avoided, which might appear when the nonlinear equation is solved with Newton algorithm. It is shown to be robust to noise in scattered fields via numerical examples by keeping only the propagating modes and filtering out the evanescent modes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.130-132
• /
• 1996

The power flow calculations(PFc) are the most important and powerful tools in power systems engineering. The conventional power now problem is solved generally with numerical methods such as Newton-Raphson. The conventional numerical method generally have some convergency problem, which is sensitive to initial value, and numerical stability problem concerned with matrix inversion. This paper presents a new power flow calculation algorithm based on the genetic algorithm(GA) which can overcome the disadvantages mentioned above. Some case studies with IEEE 6 bus system also presented to show the performance of proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• ETRI Journal
• /
• 제41권3호
• /
• pp.298-307
• /
• 2019

This paper investigates the use of the inverse-free sparse Bayesian learning (SBL) approach for peak-to-average power ratio (PAPR) reduction in orthogonal frequency-division multiplexing (OFDM)-based multiuser massive multiple-input multiple-output (MIMO) systems. The Bayesian inference method employs a truncated Gaussian mixture prior for the sought-after low-PAPR signal. To learn the prior signal, associated hyperparameters and underlying statistical parameters, we use the variational expectation-maximization (EM) iterative algorithm. The matrix inversion involved in the expectation step (E-step) is averted by invoking a relaxed evidence lower bound (relaxed-ELBO). The resulting inverse-free SBL algorithm has a much lower complexity than the standard SBL algorithm. Numerical experiments confirm the substantial improvement over existing methods in terms of PAPR reduction for different MIMO configurations.

• 한국음향학회지
• /
• 제38권3호
• /
• pp.283-289
• /
• 2019

RLS(Recursive-least-squares) 알고리즘은 수렴성이 좋고, 수렴 후 오차 수준도 우수한 것으로 알려져 있다. 그러나 알고리즘 내에 역행렬 계산이 포함되어 수치적 불안정성을 나타내는 단점도 있다. 본 논문에서는 언급한 불안정성을 회피하기 위해서 역행렬이 없지만 수렴성이 유사한 알고리즘을 제안한다. 이를 위해서 기울기 평균 벡터를 사용한 가변 스텝 최소 자승 알고리즘을 사용한다. 또 시변 채널 추정에 우수한 성능을 내기 위해서 계산량이 적은 가변 망각인자를 도입한다. 시뮬레이션을 통해서 기존 RLS와의 성능을 비교하고 그 유사성을 보인다. 또 시변 채널에서 가변 망각인자의 우수성도 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권12호
• /
• pp.4567-4583
• /
• 2021

This study proposes an analytical approximation algorithm based on extreme value theory (EVT) for the inverse of the power of the incomplete Gamma function. First, the Gumbel function is used to approximate the power of the incomplete Gamma function, and the corresponding inverse problem is transformed into the inversion of an exponential function. Then, using the tail equivalence theorem, the normalized coefficient of the general Weibull distribution function is employed to replace the normalized coefficient of the random variable following a Gamma distribution, and the approximate closed form solution is obtained. The effects of equation parameters on the algorithm performance are evaluated through simulation analysis under various conditions, and the performance of this algorithm is compared to those of the Newton iterative algorithm and other existing approximate analytical algorithms. The proposed algorithm exhibits good approximation performance under appropriate parameter settings. Finally, the performance of this method is evaluated by calculating the thresholds of space-time block coding and space-frequency block coding pattern recognition in multiple-input and multiple-output orthogonal frequency division multiplexing. The analytical approximation method can be applied to other related situations involving the maximum statistics of independent and identically distributed random variables following Gamma distributions.

• 대한수학회보
• /
• 제50권5호
• /
• pp.1659-1671
• /
• 2013

In this paper, we are concerned with the analysis of the waiting time distribution in the M/M/m retrial queue. We give expressions for the Laplace-Stieltjes transform (LST) of the waiting time distribution and then provide a numerical algorithm for calculating the LST of the waiting time distribution. Numerical inversion of the LSTs is used to calculate the waiting time distribution. Numerical results are presented to illustrate our results.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 하계종합학술대회 논문집
• /
• pp.216-220
• /
• 1989

Direct calculation algorithm for the elements of A matrix is suggested for a single machine connected to the infinite bus. Excitation system and power system stabilizer are included. When A matrix is partitioned into seven submatrices, we can identify the location of non-zero elements and formula for each element. No matrix inversion and multiplication are necessary.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(2)
• /
• pp.345-348
• /
• 2002

This paper presents new fast scalar multiplier of elliptic curve cryptosystem that is regarded as next generation public-key crypto processor. For fast operation of scalar multiplication a finite field multiplier is designed with LFSR type of bit serial structure and a finite field inversion operator uses extended binary euclidean algorithm for reducing one multiplying operation on point operation. Also the use of the window non-adjacent form (WNAF) method can reduce addition operation of each other different points.