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

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

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

• Nuclear Engineering and Technology
• /
• v.33 no.1
• /
• pp.25-33
• /
• 2001

To determine the pin power distribution without disassembling, HANARO fuel assemblies are gamma-scanned and then the distribution is reconstructed tv using the tomography method. The iterative least squares method (ILSM and the wavelet singular value decomposition method (WSVD) are chosen to solve the problem. An optimal convergence criterion is used to stop the iteration algorithm to overcome the potential divergence in ILSM. WSVD gives better results than ILSM , and the average values from the two methods give the best results. The RMSE (root mean square errors) to the reference data are 5.1, 6.6, 5.0, 6.5, and 6.4% and the maximum relative errors are 10.2, 13.7, 12.2, 13.6, and 14.3%, respectively. It is found that the effect of random positions of the pins is important. Although the effect can be accommodated by the iterative calculations simulating the random positions, the use of experimental equipment with a slit covering the whole range of the assembly horizontally is recommended to obtain more accurate results. We made a new apparatus using the results of this study and are conducting an experiment in order to obtain more accurate results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5459-5473
• /
• 2017

Recently, a tracking algorithm called the spatial-temporal context model has been proposed to locate a target by using the contextual information around the target. This model has achieved excellent results when the target undergoes slight occlusion and appearance changes. However, the target location in the current frame is based on the location in the previous frame, which will lead to failure in the presence of fast motion because of the lack of a prediction mechanism. In addition, the spatial context model is updated frame by frame, which will undoubtedly result in drift once the target is occluded continuously. This paper proposes two improvements to solve the above two problems: First, four possible positions of the target in the current frame are predicted based on the displacement between the previous two frames, and then, we calculate four confidence maps at these four positions; the target position is located at the position that corresponds to the maximum value. Second, we propose a target reliability criterion and design an adaptive threshold to regulate the updating speed of the model. Specifically, we stop updating the model when the reliability is lower than the threshold. Experimental results show that the proposed algorithm achieves better tracking results than traditional STC and other algorithms.