• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.637-647
• /
• 2010

This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division of 2w bit integer N and w bit integer D. An algorithm suggested of the research, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of $\frac{1}{D}$, '$1.g{\times}2^{-L}$', which satisfies '$0.d{\times}1.g=1+e$, e < $2^{-w}$', is defined as over reciprocal number and the dividend N is segmented in small word more than 'w-3' bit, and partial quotient is calculated by multiplying over reciprocal number in each segmented word, and quotient of double precision integer division is evaluated with sum of partial quotient. The algorithm suggested in this paper doesn't require additional correction, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• International Journal of Aeronautical and Space Sciences
• /
• v.12 no.1
• /
• pp.78-83
• /
• 2011

Traditional autopilot design requires an accurate aerodynamic model and relies on a gain schedule to account for system nonlinearities. This paper presents the control architecture applied to a dynamic model inversion at a single flight condition with an on-line neural network (NN) in order to regulate errors caused by approximate inversion. This eliminates the need for an extensive design process and accurate aerodynamic data. The simulation results using a developed full nonlinear 6 degree of freedom model are presented. This paper also presents the stability evaluation for control systems to which NNs were applied. Although feedback can accommodate uncertainty to meet system performance specifications, uncertainty can also affect the stability of the control system. The importance of robustness has long been recognized and stability margins were developed to quantify it. However, the traditional stability margin techniques based on linear control theory can not be applied to control systems upon which a representative non-linear control method, such as NNs, has been applied. This paper presents an alternative stability margin technique for NNs applied to control systems based on the system responses to an inserted gain multiplier or time delay element.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.651-659
• /
• 2002

Component Mode Synthesis (CMS) is a dynamic substructuring technique to get an approximate eigensolutions of large degree-of-freedom structures divisible into several components. But, In practice. most of large structures are modeled by different teams of engineers. and their respective finite element models often require different mesh resolutions. As a result, the finite element substructure models can be non-conforming and/or incompatible. In this work, A hybrid version of component mode synthesis using a localized lagrange multiplier to treat the non-conforming mesh problem was derived. Evolution Strategies (ESs) is a stochastic numerical optimization technique and has shown a robust performance for solving deterministic problems. An ESs conducts its search by processing a population of solutions for an optimization problem based on principles from natural evolution. An optimization example for raising the first natural frequency of a plate structure using beam stiffeners was presented using hybrid component mode synthesis and robust evolution strategies (RES) optimization technique. In the example. the design variables are the positions and lengths of beam stiffeners.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.4
• /
• pp.375-382
• /
• 2008

The particular integral formulation for two(2D) and three(3D) dimensional inelastic transient dynamic stress analysis is presented. The elastostatic equation is used for the complementary solution. Using the concept of global shape function, the particular integrals for displacement and traction rates are obtained to approximate acceleration of the inhomogeneous equation. The Houbolt time integration scheme is used for the time-marching process. The Newton-Raphson algorithm for plastic multiplier is used to solve the system equation. Numerical results of four example problems are given to demonstrate the validity and accuracy of the present formulation.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1333-1354
• /
• 2019

In authors' paper in 2007, it was shown that the BSE-extension of $C^1_0(R)$, the algebra of continuously differentiable functions f on the real number space R such that f and df /dx vanish at infinity, is the Lipschitz algebra $Lip_1(R)$. This paper extends this result to the case of $C^n_0(R^d)$ and $C^{n-1,1}_b(R^d)$, where n and d represent arbitrary natural numbers. Here $C^n_0(R^d)$ is the space of all n-times continuously differentiable functions f on $R^d$ whose k-times derivatives are vanishing at infinity for k = 0, ${\cdots}$, n, and $C^{n-1,1}_b(R^d)$ is the space of all (n - 1)-times continuously differentiable functions on $R^d$ whose k-times derivatives are bounded for k = 0, ${\cdots}$, n - 1, and (n - 1)-times derivatives are Lipschitz. As a byproduct of our investigation we obtain an important result that $C^{n-1,1}_b(R^d)$ has a predual.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1593-1600
• /
• 2009

There are two major algorithms to find a square root of floating point number, one is the Newton_Raphson algorithm and GoldSchmidt algorithm which calculate it approximately by iterating multiplications and the other is SRT algorithm which calculates it exactly by iterating subtractions. This paper proposes an exact floating point square root algorithm using only multiplication. At first an approximate inverse square root is calculated by Newton_Raphson algorithm, and then an exact square root algorithm by reducing an error in it and a compensation algorithm of it are proposed. The proposed algorithm is verified to calculate all of numbers in a single precision floating point number and 1 billion random numbers in a double precision floating point number. The proposed algorithm requires only the multipliers without another hardware, so it can be widely used in an embedded system and mobile production which requires an efact square root of floating point number.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.