• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.2 s.48
• /
• pp.21-29
• /
• 2006

It is impractical to install sensors on every floor of a tall building to measure the full state vector because of the large number of degrees of freedom. This makes it necessary to introduce reduced order control. A kind of system reduction scheme (dynamic condensation method) is proposed in this paper. This method is iterative and Guyan condensation is looked upon as an initial approximation of the iteration. Since the reduced order system is updated repeatedly until a desired one is obtained, the accuracy of the reduced order system resulting from the proposed method is much higher than that obtained from the Guyan condensation method. An eigenvalue shilling technique is applied to accelerate the convergence of Iteration. Two schemes to establish the reduced order system by using the proposed method are also presented and discussed in this paper. The results for a tail building with active tuned mass damper show that the proposed method is efficient for the reduced order modelling and the accuracy is very close to exact only after two iterations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.31-39
• /
• 2004

The ARM7 TDMI microprocessor employ a software routine iteration method in order to handle integer division operation, but this method has long execution time and many execution instruction. In this paper, we proposed ARM7 TDMI microprocessor with integer division instruction. To make this, we additionally defined UDIV instruction for unsigned integer division operation and SDIV instruction for signed integer division operation, and proposed ARM7 TDMI microprocessor data Path to apply division algorithm. Applied division algorithm is nonrestoring division algorithm and additive hardware is reduced using existent ARM data path. To verify the proposed method, we designed proposed method on RTL level using HDL, and conducted logic simulation. we estimated the number of execution cycles and the number of execution instructions as compared proposed method with a software routine iteration method, and compared with other published integer divider from the number of execution cycles and hardware size.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Structural Engineering and Mechanics
• /
• v.34 no.6
• /
• pp.719-738
• /
• 2010

The aim of this paper concerns with the nonlinear analysis of cable-stayed bridges including the vibration effect of cable stays. Two models for the cable stay system are built up in the study. One is the OECS (one element cable system) model in which one single element per cable stay is used and the other is MECS (multi-elements cable system) model, where multi-elements per cable stay are used. A finite element computation procedure has been set up for the nonlinear analysis of such kind of structures. For shape finding of the cable-stayed bridge with MECS model, an efficient computation procedure is presented by using the two-loop iteration method (equilibrium iteration and shape iteration) with help of the catenary function method to discretize each single cable stay. After the convergent initial shape of the bridge is found, further analysis can then be performed. The structural behaviors of cable-stayed bridges influenced by the cable lateral motion will be examined here detailedly, such as the static deflection, the natural frequencies and modes, and the dynamic responses induced by seismic loading. The results show that the MECS model offers the real shape of cable stays in the initial shape, and all the natural frequencies and modes of the bridge including global modes and local modes. The global mode of the bridge consists of coupled girder, tower and cable stays motion and is a coupled mode, while the local mode exhibits only the motion of cable stays and is uncoupled with girder and tower. The OECS model can only offers global mode of tower and girder without any motion of cable stays, because each cable stay is represented by a single straight cable (or truss) element. In the nonlinear seismic analysis, only the MECS model can offer the lateral displacement response of cable stays and the axial force variation in cable stays. The responses of towers and girders of the bridge determined by both OECS- and MECS-models have no great difference.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.103-110
• /
• 2006

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1172-1184
• /
• 1998

ILP(Instruction Level Parallelism) processors use code reordering algorithms to expose parallelism in a given sequential program. When applied to a loop, this algorithm produces a software-pipelined loop. In a software-pipelined loop, each iteration contains a sequence of parallel instructions that are composed of data-independent instructions collected across from several iterations. For vector loops, however the software pipelining technique can not expose the maximum parallelism because it schedules the program based only on data-dependencies. This paper proposes to schedule differently for vector loops. We develop an algorithm to detect vector loops at object code level and suggest a new vector scheduling algorithm for them. Our vector scheduling improves the performance because it can schedule not only based on data-dependencies but on loop structure or iteration conditions at the object code level. We compare the resulting schedules with those by software-pipelining techniques in the aspect of performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.28-35
• /
• 2013

The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.4
• /
• pp.542-551
• /
• 1998

In this study, a method of error compensation for channel gain imbalance, phase imbalance and local oscillator leakage in the modulator of frequency direct conversion is suggested. The compensation of channel imbalance can be carried out by using the received power after transmitting test signal. By applying this method, the phase imbalance conversion with frequency can be easily compensated since this method is rarely affected by the transmission channel. It is confirmed that the algorithm proposed in this study(iteration coefficient=11) converges faster than conventional algorithm(iteration coefficient=43). From the numerical results, the DC-offset, channel gain, phase imbalance compensation coefficient and iteration number converges into($f_1$=0.0199999, $f_2$=-0.050001, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=13) when the local oscillator leakage is not considered. However, it converges into($f_1$=-0.02, $f_2$=-2.2476, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=16) when the local oscillator leakage is considered.

• Journal of Digital Convergence
• /
• v.17 no.10
• /
• pp.251-258
• /
• 2019

In the future, various products are created in various fields using artificial intelligence. In this age, it is a very important problem to know the operation principle of artificial intelligence learning method and to use it correctly. This paper introduces artificial intelligence learning methods that have been known so far. Learning of artificial intelligence is based on the fixed point iteration method of mathematics. The GD(Gradient Descent) method, which adjusts the convergence speed based on the fixed point iteration method, the Momentum method to summate the amount of gradient, and finally, the Adam method that mixed these methods. This paper describes the advantages and disadvantages of each method. In particularly, the Adam method having adaptivity controls learning ability of machine learning. And we analyze how these methods affect digital signals. The changes in the learning process of digital signals are the basis of accurate application and accurate judgment in the future work and research using artificial intelligence.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.27 no.1
• /
• pp.193-200
• /
• 2021

In this study, an analysis technique using static condensation is proposed for an efficient local nonlinear static analysis. The static condensation method is a model reduction method based on the degrees of freedom, and the analysis model is divided into a target part and a condensed part to be omitted. In this study, the nonlinear and linear parts were designated to the target and the omitted parts, respectively, and both the stiffness matrix and load vector corresponding to the linear part were condensed into the nonlinear part. After model condensation, the reduced model comprising the stiffness matrix and the load vector for the nonlinear part is constructed, and only this reduced model was updated through the Newton-Raphson iteration for an efficient nonlinear analysis. Finally, the efficiency and reliability of the proposed analysis technique were presented by applying it to various numerical examples.