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

• Journal of Satellite, Information and Communications
• /
• v.11 no.1
• /
• pp.26-31
• /
• 2016

In this paper, we proposed a scheme to mitigate noises based on the EMD scheme for heterogeneous communication systems. Noise-corrupted data can be decomposed into a finite number of IMF components. Using the EMD method, we can mitigate noise with eliminate noise-corrupted IMF components. We proposed iteration stop rule for reduce EMD computation time. Simulation results show that proposed EMD scheme based on proposed algorithm for iteration stop rule efficiently mitigates 3 types of noise and reduces its computational time.

• Journal of Navigation and Port Research
• /
• v.29 no.6 s.102
• /
• pp.523-528
• /
• 2005

The flow analysis is made to simulate the turbulent flow in the pipe with an obstacle. The models used are k-$\epsilon$, k-$\omega$, Spalart-Allmaras and Reynolds. The structured grid is used for the simulation The velocity vector, the pressure contour, the change of residual along the iteration number and the dynamic head are simulated for the comparison of four example cases. For the analysis, the commercial code is used.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2088-2091
• /
• 2003

We presents a new algorithm for tracking person in video sequence that integrates the meanshift iteration procedure into the particle filtering. Utilizing the nice property of convergence to the modes in the meanshift iteration we show that only a few sample points are sufficient, while in general the particle filtering requires a large number of sample points. Multi-parts of a person is tracked independently of each other based on the color Then, the similarity against the reference model color and the geometric constraints between multi-parts are reflected as the sample weights. Also presented is the computer simulation results, which show successful tracking even for complex background clutter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.816-819
• /
• 2005

In Java virtual machine which is the running environment of Java programs, almost every bytecode execution requires data transfers in memory. Data transfer incurs energy consumption and hence minimizing the transfer operation is very important for improving the energy efficiency of JVM. As the number of data transfers for a Java iterative statement is directly proportional to the iteration count, improving the energy efficiency of iterative statement is crucial to keep the energy efficiency of JVM high. This paper analyzes Java iterative statement at bytecode level and proposes some points how to improve the energy efficiency.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.76-78
• /
• 1993

This paper describes an efficient method of computing any desired number of the most unstable eigenvalues and eigenvectors of a large scale multi-machine power system. Approximate eigenvalues obtained by Hessenberg process are refined using Rayleigh quotient iteration with cubic convergence property. If further eigenvalues and eigenvectors are needed, the procedure described above are repeated with deflation. The proposed algorithm can cover all the model types of synchronous machines, exciters, speed governing system and PSS defined in AESOPS. The proposed algorithm applied to New England test system with 10 machines and 39 buses produced the results same with AESOPS in faster computation time. Also eigenvectors computed in Rayleigh quotient iteration makes it possible to make eigen-analysis for improving unstable modes.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.616-629
• /
• 2015

A mobile terminal will expect a number of handoffs within its call duration. In the event of a mobile call, when a mobile node moves from one cell to another, it should connect to another access point within its range. In case there is a lack of support of its own network, it must changeover to another base station. In the event of moving on to another network, quality of service parameters need to be considered. In our study we have used the Markov decision process approach for a seamless handoff as it gives the optimum results for selecting a network when compared to other multiple attribute decision making processes. We have used the network cost function for selecting the network for handoff and the connection reward function, which is based on the values of the quality of service parameters. We have also examined the constant bit rate and transmission control protocol packet delivery ratio. We used the policy iteration algorithm for determining the optimal policy. Our enhanced handoff algorithm outperforms other previous multiple attribute decision making methods.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.200-206
• /
• 2021

Fraud in e-commerce transaction increased in the last decade especially with the increasing number of online stores and the lockdown that forced more people to pay for services and groceries online using their credit card. Several machine learning methods were proposed to detect fraudulent transaction. Neural networks showed promising results, but it has some few drawbacks that can be overcome using optimization methods. There are two categories of learning optimization methods, first-order methods which utilizes gradient information to construct the next training iteration whereas, and second-order methods which derivatives use Hessian to calculate the iteration based on the optimization trajectory. There also some training refinements procedures that aims to potentially enhance the original accuracy while possibly reduce the model size. This paper investigate the performance of several NN models in detecting fraud in e-commerce transaction. The backpropagation model which is classified as first learning algorithm achieved the best accuracy 96% among all the models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2341-2349
• /
• 2015

The commonly used Goldschmidt's floating-point divider algorithm performs two multiplications in one iteration. In this paper, a tentative error corrected K'th Goldschmidt's floating-point number divider algorithm which performs K times multiplications in one iteration is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation in single precision and double precision divider is derived from many reciprocal tables with varying sizes. In addition, an error correction algorithm, which consists of one multiplication and a decision, to get exact result in divider is proposed. 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 divider unit. Also, it can be used to construct optimized approximate reciprocal tables.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.37-43
• /
• 2008

The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.