• Journal of the Earthquake Engineering Society of Korea
• /
• v.15 no.5
• /
• pp.11-24
• /
• 2011

A real-time hybrid test of a 3 story-3 bay reinforced concrete frame which is divided into numerical and physical substructure models under uniaxial earthquake excitation was run using a fixed iteration implicit HHT time integration method. The first story inner non-ductile column was selected as the physical substructure model, and uniaxial earthquake excitation was applied to the numerical model until the specimen failed due to severe damage. A finite-element analysis program, Mercury, was newly developed and optimized for a real-time hybrid test. The drift ratio based on the top horizontal displacement of the physical substructure model was compared with the result of a numerical simulation by OpenSees and the result of a shaking table test. The experiment in this paper is one of the most complex real-time hybrid tests, and the description of the hardware, algorithm and models is presented in detail. If there is an improvement in the numerical model, the evaluation of the tangent stiffness matrix of the physical substructure model in the finite element analysis program and better software to reduce the computational time of the element state determination for the force-based beam-column element, then the comparison with the results of the real-time hybrid test and the shaking table test deserves to make a recommendation. In addition, for the goal of a "Numerical simulation of the complex structures under dynamic loading", the real time hybrid test has enough merit as an alternative to dynamic experiments of large and complex structures.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.19-25
• /
• 2009

In this thesis, design effective elimination interference algorithm of ICS repeat system for repeater that improve frequency efficiency. Error convergence speed and accuracy of LMS Algorithm are influenced by reference signal. For improve LMS Algorithm, suggest Adaptive channel estimate algorithm. For using channel characteristic, adaptive channel estimate algorithm make reference signal similar interference signal by convolution operation and complement LMS algorithm demerit. For make channel similar piratical channel, apply Jake's Rayleigh multi-path model that random five path with 130Hz Doppler frequency. LMS algorithm and suggested adaptive channel estimate algorithm that have 16 taps apply to ICS repeat system under Rayleigh multi-path channel, so simulate with MATLAB. According to simulate, ICS repeat system with LMS algorithm show -40dB square error convergent after 150 datas iteration and ICS repeat system with adaptive channel estimate algorithm show -80dB square error convergent after 200 datas iteration. Analyze simulation result, suggested adaptive channel estimate algorithm show more three times iteration performance than LMS algorithm, and 40dB accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.149-157
• /
• 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 increased 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 LLR in turbo decoder, the proposed algerian can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations in the upper SNR region is reduced by about $34.66%{\sim}41.33%$ compared to method using variance values of extrinsic information. the average number of iterations in the lower SNR region is reduced by about $13.93%{\sim}14.45%$ compared to CE algorithm and about $13.23%{\sim}14.26%$ compared to SDR algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2783-2790
• /
• 2010

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 802.11n for wireless local access network(WLAN) standard, require a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithms for LDPC codes. First, sequential decoding with partial group is proposed. It has the same H/W complexity, and fewer number of iterations are required with the same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method reduces number of unnecessary iterations. Third, 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 early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme. The LDPC decoder have been implemented in Xilinx System Generator and targeted to a Xilinx Virtx5-xc5vlx155t FPGA. When three algorithms are used, amount of device is about 45% off and the decoding speed is about two times faster than convectional scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.143-149
• /
• 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 increased 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 sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.493-506
• /
• 2007

In this paper weak and strong convergence theorems of modified Noor iterations to fixed points for asymptotically nonexpansive mappings in the intermediate sense in Banach spaces are established. In one theorem where we establish strong convergence we assume an additional property of the operator whereas in another theorem where we establish weak convergence assume an additional property of the space.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.329-341
• /
• 2005

In this paper, we introduce new random iterative sequences with errors approximating a unique random common fixed point for three random set-valued strongly pseudo-contractive mappings and show the convergence of the random iterative sequences with errors by using an approximation method in real uniformly smooth separable Banach spaces. As applications, we study the existence of random solutions for some kind of random nonlinear operator equations group in separable Hilbert spaces.

• Journal of the Optical Society of Korea
• /
• v.2 no.2
• /
• pp.58-63
• /
• 1998

Cross-talk effects in high-density volume holographic interconnections are investigated using perturbative iteration method of the integral form of Maxwell's wave equation. In this method, the paraxial approximation and negligence of backward scattering introduced in conventional coupled mode theory is not assumed. Interaction geometries consisting of non-coplanar light waves and multiple index gratings are studied. Arbitrary light polarization is considered. Systematic analysis of cross-talk effects due to multiple index gratings is performed in increasing level of diffraction orders corresponding to successive iterations. Some numerical examples are given for first and third order diffraction.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.485-490
• /
• 1998

We consider a class of discrete parameter processes on a locally compact Polish space $S$ arising from successive compositions of strictly stationary Markov random maps on $S$ into itself. Sufficient conditions for the existence of the stationary solution and the weak convergence of the distributions of $\{\Gamma_n \Gamma_{n-1} \cdots \Gamma_0x \}$ are given.

• Journal of the Optical Society of Korea
• /
• v.1 no.2
• /
• pp.67-73
• /
• 1997

Light wave diffraction from multiple superposed volume gratings is inestigated using a perturbative iteration method of the integral equation of Maxwell's wave equation. The host material and index gratings are anisotropic and non-coplanar multiple volume gratings are considered. In this method, the paraxial approximation and lack of backward scattering in conventional coupled mode theory are not assumed. Systematic analysis of anisotropic wave diffraction due to multiple noncoplanar volume index gratings is performed in increasing level of diffraction orders corresponding to successive iterations.