• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.1
• /
• pp.45-51
• /
• 2018

In this paper, a tentative Kth order Newton-Raphson's floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Newton-Raphson root algorithm. Using the proposed algorithm, $F^{-1/N}$ and $F^{-(N-1)/N}$ can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration and iterates only until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.

• Journal of Korea Multimedia Society
• /
• v.22 no.9
• /
• pp.1029-1035
• /
• 2019

In this paper, a tentative Kth order Goldschmidt floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Goldschmidt square root algorithm. Using the proposed algorithm, Nth root and Nth inverse root can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration. It iterates until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.8
• /
• pp.816-822
• /
• 2003

In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.551-558
• /
• 2003

An efficient and reliable subspace iteration algorithm using the block algorithm is proposed. The block algorithm is the method dividing eigenpairs into several blocks when a lot of eigenpairs are required. One of the key for the faster convergence is carefully selected initial vectors. As the initial vectors, the proposed method uses the modified Ritz vectors for guaranteering all the required eigenpairs and the quasi-static Ritz vectors for accelerating convergency of high frequency eigenvectors. Applying the quasi-static Ritz vectors, a shift is always required, and the proper shift based on the geometric average is proposed. To maximize efficiency, this paper estimates the proper number of blocks based on the theoretical amount of calculation in the subspace iteration. And it also considers the problems generated in the process of combining various algorithms and the solutions to the problems. Several numerical experiments show that the proposed subspace iteration algorithm is very efficient, reliable ,and accurate.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.39-42
• /
• 2004

Turbo codes, proposed by Berrou, that increase the interleaver size and the number of iteration have better than conventional convolutional codes, in case of BER performance. However, because turbo codes has been required much decoding delay to increase iteration number, it demands unnecessary iterative decoding. Therefore, in this paper, we propose iterative decoding stop criterion that uses the variance of absolute value of LLR. This algorithm can be reduced average iterative decoding number and had lossless performance of BER, because of decreasing unnecessary iterative decoding.

• 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.

• Journal of The Korean Astronomical Society
• /
• v.42 no.3
• /
• pp.47-54
• /
• 2009

In this paper we present an independent FORTRAN code for calculating LTE-plane-parallel model atmospheres. The transfer equation has been solved using Avrett and Loeser method. It is shown that, using an approximate non-gray temperature distribution together with the iteration factors method (Simonneau and Crivellari) for correcting the temperature distribution reduce the number of iteration required to achieve the condition of radiative equilibrium. Preliminary results for pure helium model atmospheres are presented.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2016

It is well known that the behavior of PV curves is similar to a quadratic function. This is used in some papers to approximate PV curves and calculate the maximum-loading point by minimum number of power flow runs. This paper also based on quadratic approximation of the PV curves is aimed at completing previous works so that the computational efforts are reduced and the accuracy is maintained. To do this, an iterative method based on a quadratic function with two constant coefficients, instead of the three ones, is used. This simplifies the calculation of the quadratic function. In each iteration, to prevent the calculations from diverging, the equations are solved on the assumption that voltage magnitude at a selected load bus is known and the loading factor is unknown instead. The voltage magnitude except in the first iteration is selected equal to the one at the nose point of the latest approximated PV curve. A method is presented to put the mentioned voltage in the first iteration as close as possible to the collapse point voltage. This reduces the number of iterations needed to determine the maximum-loading point. This method is tested on four IEEE test systems.

• Korean Journal of Computational Design and Engineering
• /
• v.20 no.1
• /
• pp.36-43
• /
• 2015

Recently, a number of evaluation studies on availability of plant were carried out. This study was conducted to verify of the reliability of a simulation with some variable such as configuration of process, failure probability density function and the number of iteration times for the natural gas liquefaction plant. The error rate of the KICT-RAM solution was evaluated as 0.03~1.79% compared with the result of the MAROS(commercial solution). And the error-rate change was observed in the range of 0.03~1.75 on the condition of the iteration times as 30, 100, 250. As a result the plant availability evaluation approach of KICT-RAM solution was verified as reasonable. However, the careful approach was required to use the solution because the error-rate increased according to iteration times change.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.14 no.1
• /
• pp.13-17
• /
• 2010

Purpose: Partial volume effect (PVE) is the phenomenon to lower the accuracy of image due to low estimate, which is to occur from PET/CT 3D image acquisition. The more resolution is declined and the lesion is small, the more it causes a big error. So that it can influence the test result. Studied the optimum image reconstruction method by using variation of parameter, which can influence the PVE. Materials and Methods: It acquires the image in each size spheres which is injected $^{18}F$-FDG to hot site and background in the ratio 4:1 for 10 minutes by using NEMA 2001 IEC phantom in GE Discovey STE 16. The iterative reconstruction is used and gives variety to iteration 2-50 times, subset number 1-56. The analysis's fixed region of interest in detail part of image and compute % difference and signal to noise ratio (SNR) using $SUV_{max}$. Results: It's measured that $SUV_{max}$ of 10 mm spheres, which is changed subset number to 2, 5, 8, 20, 56 in fixed iteration to times, SNR is indicated 0.19, 0.30, 0.40, 0.48, 0.45. As well as each sphere's of total SNR is measured 2.73, 3.38, 3.64, 3.63, 3.38. Conclusion: In iteration 6th to 20th, it indicates similar value in % difference and SNR ($3.47{\pm}0.09$). Over 20th, it increases the phenomenon, which is placed low value on $SUV_{max}$ through the influence of noise. In addition, the identical iteration, it indicates that SNR is high value in 8th to 20th in variation of subset number. Therefore, to reduce partial volume effect of small lesion, it can be declined the partial volume effect in iteration 6 times, subset number 8~20 times, considering reconstruction time.