• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2
• /
• pp.38-49
• /
• 1994

This paper proposes Echo canceller used in simultaneous two-way ('full-duplex') transmission of data signals over two-wire circuits which can be achieved by using a hybrid coupler. This Echo canceller uses sequential processing instead of parallel processing with conventional adaptive digital filter. This structure reduces the number of multipliers. Thus, this structure is much more suitable for IC implementation. This Echo canceller operates according to the 'Stochastic Iteration Algorithm(SIA).' SIA algorithm has merit of good performance and small hardware requirement.

• Smart Structures and Systems
• /
• v.15 no.1
• /
• pp.169-189
• /
• 2015

Convergence difficulty and available complete measurement information have been considered as two primary challenges for the identification of large-scale engineering structures. In this paper, a time domain substructural identification approach by combining a weighted adaptive iteration (WAI) algorithm and an extended Kalman filter method with a weighted global iteration (EFK-WGI) algorithm was proposed for simultaneous identification of physical parameters of concerned substructures and unknown external excitations applied on it with limited response measurements. In the proposed approach, according to the location of the unknown dynamic loadings and the partially available structural response measurements, part of structural parameters of the concerned substructure and the unknown loadings were first identified with the WAI approach. The remaining physical parameters of the concerned substructure were then determined by EFK-WGI basing on the previously identified loadings and substructural parameters. The efficiency and accuracy of the proposed approach was demonstrated via a 20-story shear building structure and 23 degrees of freedom (DOFs) planar truss model with unknown external excitation and limited observations. Results show that the proposed approach is capable of satisfactorily identifying both the substructural parameters and unknown loading within limited iterations when both the excitation and dynamic response are partially unknown.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.136-150
• /
• 2021

The modern market is highly competitive. It has progressed from traditional competition between enterprises to competition between supply chains. To ensure that enterprise can form the best strategy consistently, it is necessary to evaluate the trust of other enterprises in the supply chain. First, this paper analyzes the background and significance of supply chain trust research, analyzes and expounds on the qualitative and quantitative methods of supply chain trust evaluation, and summarizes the research in this field. Analytic hierarchy process (AHP) is the most frequently used method in the literature to evaluate and rank criteria through data analysis. However, the input data for AHP analysis is based on human judgment, and hence there is every possibility that the data may be vague to some extent. Therefore, in view of the above problems, this study improves the global trust method based on chain iteration. The improved global trust evaluation method based on chain iteration is more flexible and practical, hence, it can more accurately evaluate supply chain trust. Finally, combined with an actual case of Zhaoxian Chengji Food Co. Ltd., the paper qualitatively analyzes the current situation of supply chain trust management and effectively strengthens the supervision of enterprises to cooperative enterprises. Thus, the company can identify problems on time and strategic adjustments can be implemented accordingly. The effectiveness of the evaluation method proposed in this paper is demonstrated through a quantitative evaluation of its trust in downstream enterprise A. Results suggest that the subjective preferences of and historical transactions together affect the final evaluation of trust.

• Nuclear Engineering and Technology
• /
• v.54 no.2
• /
• pp.532-545
• /
• 2022

In-depth convergence analyses for neutronics/thermal-hydraulics (T/H) coupled calculations are performed to investigate the performance of nonlinear methods based on the Fixed-Point Iteration (FPI). A simplified neutronics-T/H coupled system consisting of a single fuel pin is derived to provide a testbed. The xenon equilibrium model is considered to investigate its impact during the nonlinear iteration. A problem set is organized to have a thousand different fuel temperature coefficients (FTC) and moderator temperature coefficients (MTC). The problem set is solved by the Jacobi and Gauss-Seidel (G-S) type FPI. The relaxation scheme and the Anderson acceleration are applied to improve the convergence rate of FPI. The performances of solution schemes are evaluated by comparing the number of iterations and the error reduction behavior. From those numerical investigations, it is demonstrated that the number of FPIs is increased as the feedback is stronger regardless of its sign. In addition, the Jacobi type FPIs generally shows a slower convergence rate than the G-S type FPI. It also turns out that the xenon equilibrium model can cause numerical instability for certain conditions. Lastly, it is figured out that the Anderson acceleration can effectively improve the convergence behaviors of FPI, compared to the conventional relaxation scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1254-1264
• /
• 2000

In this paper, we propose a new turbo interleaver and an efficient iteration control method with low complexity for turbo decoding. Turbo codes has better performance as the number of iteration and the interleaver size increases. However, as the interleaver size is increased, it require much delay and computation for decoding. Thus we propose a new efficient turbo magic interleaver using the Magic square matrix. Simulation results show that the proposed interleaver realizes a good performance like GF, Mother interleaver proposed to IMT-2000. And as the decoding approaches the performance limit, any further iteration results in very little improvement. Therefore, we propose an efficient algorithm of decoding that can reduce the delay and computation. Just like the conventional stop criterion, it effectively stop the iteration process with very little performance degradation.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.3 s.36
• /
• pp.473-486
• /
• 1998

A numerically stable technique to remove the limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study solves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shift is an eigenvalue itself. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

• Geomechanics and Engineering
• /
• v.15 no.5
• /
• pp.1029-1038
• /
• 2018

A superposition-iteration (S-I) model is proposed to simulate the jet grouting pre-reinforcing impact for a shallow-buried tunnel. The common model is deduced by theoretical (force equilibrium) analysis and then transformed into the numerical formulation. After applying it to an actual engineering problem, the most obvious deficiency was found to be continuous error accumulation, even when the parameters change slightly. In order to address this problem, a superposition-iteration model is developed based on the basic assumption and superposition theory. First, the additional deflection between two successive excavation steps is determined. This is caused by the disappearance of the supporting force in the excavated zone and the soil pressure in the disturbed zone. Consequently, the final deflection can be obtained by repeatedly superposing the additional deflection to the initial deflection in the previous steps. The analytical solution is then determined with the boundary conditions. The superposition-iteration model is thus established. This model was then applied and found to be suitable for real-life engineering applications. During the calculation, the error induced by the ill-conditioned problem of the matrix is easily addressed. The precision of this model is greater compared to previous models. The sensitivity factors and their impact are determined through this superposition-iteration model.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.27 no.2
• /
• pp.221-233
• /
• 2017

The array equations are commonly used for analysis and conceptual design of active sonar projector arrays. Calculation of the radiation impedance matrix poses a major computational bottleneck for the solution of the array equations, which leads to a dramatic increase in computational load as the number of constituent transducers increases. Here, we propose an iteration-based solution method that does not require the calculation of the radiation impedance matrix, as a computationally efficient alternative to the status quo. The validity of the iteration-based analysis is judged against the full finite-element analysis that includes the entire array as well as the medium. The array equations for the 1/3-sector of a cylindrical array comprised of 48 Tonpilz transducers are augmented by the lumped element models, and are solved iteratively for the acoustic and electro-mechanical characteristics. The iteration-based analysis exhibits rapid convergence and accuracy comparable with the FE analysis. Simulations also reveal that the acoustic coupling between transducers has more pronounced effects on the electro-mechanical characteristics of individual transducers than the acoustic performance of the array.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.11
• /
• pp.1039-1048
• /
• 2008

new computational procedure for the Non-Linear Vortex Lattice Method (NLVLM) is suggested in this work. Conventional procedures suggested so far usually involves inner iteration loop to update free vortex shape and an under-relaxation based iteration loop to determine the free vortex shape. In this present work, we suggest a new formula based on quasi-steady concept to fix free vortex shape which eliminates the need for inner iteration loop. Further, the ensemble averaging of the induced velocities for a given free vortex segment evaluated at each iteration significantly improves the convergence property of the algorithm without resorting to the under-relaxation technique. Numerical experiments over several low aspect ratio wings are carried out to obtain optimal empirical parameters such as the length of the free vortex segment, the vortex core radius, and the rolled-up wake length.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 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 are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three 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 algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. 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.