• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.383-386
• /
• 2006

In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.120-132
• /
• 2021

A frequency diverse array (FDA) multiple-input multiple-output (MIMO) radar employs a small frequency increment across transmit elements to produce an angle-range-dependent beampattern for target angle and range detection. The joint angle and range estimation problem is a trilinear model. The traditional trilinear alternating least square (TALS) algorithm involves high computational load due to excessive iterations. We propose a fast-convergence trilinear decomposition (FC-TD) algorithm to jointly estimate FDA-MIMO radar target angle and range. We first use a propagator method to obtain coarse angle and range estimates in the data domain. Next, the coarse estimates are used as initialized parameters instead of the traditional TALS algorithm random initialization to reduce iterations and accelerate convergence. Finally, fine angle and range estimates are derived and automatically paired. Compared to the traditional TALS algorithm, the proposed FC-TD algorithm has lower computational complexity with no estimation performance degradation. Moreover, Cramer-Rao bounds are presented and simulation results are provided to validate the proposed FC-TD algorithm effectiveness.

• Journal of Broadcast Engineering
• /
• v.12 no.5
• /
• pp.503-515
• /
• 2007

A new fast motion estimation algorithm is presented in this paper. The algorithm, named Enhanced Cross-Diamond Search (ECDS), is based on the Diamond Search (DS) algorithm. The DS algorithm, even though faster than the most well-known algorithms, was found not to be very robust in terms of objective and subjective qualities for several sequences and the algorithm searches unnecessary candidate blocks. We propose a novel ECDS algorithm using a small cross search as the initial step, and large/small DS patterns as subsequent steps for fast block motion estimation. Experimental results show that the ECDS is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.57-65
• /
• 2007

In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.77-85
• /
• 2006

There is the spatial correlation of the video sequence between the motion vector of current blocks. In this paper, we propose the enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased properly of motion vectors. The proposed algorithm determines an exact motion vector using the predicted motion vector from the adjacent macro blocks of the current frame and the Cross-Hexagonal search pattern. From the of experimental results, we can see that our proposed algorithm outperforms both the prediction search algorithm (NNS) and the fast block matching algorithm (CHS) in terms of the search speed and the coded video's quality. Using our algorithm, we can improve the search speed by up to $0.1{\sim}38%$ and also diminish the PSNR (Peak Signal Noise Ratio) by at nst $0.05{\sim}2.5dB$, thereby improving the video qualify.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.865-868
• /
• 2007

Web service in operating environment independent XML about under using, It dose so, Integration of the platform for it is different each other possibly it is doing. But XML in order to have the text data which is unnecessary plentifully with wireless Internet or the mobile communication modem in together relatively will connect frequently slow communication medium and there is a problem point which decreases the case prerequisite efficiency which the resources will use from the limited small-sized machinery and tools. Hereupon XML about under make binary the standard which reduces the size of the document from ITU-T and ISO/IEC it was under proposing with commonness, currently binary XML encoding where it is in the process of advancing standard there are Fast Infoset and Fast Schema. In this paper, implementation of Fast XML encoding system through introduction Fast Infoset algorithm and Fast Schema algorithm for web services increase performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.118-125
• /
• 2006

Mobile nodes in FHMIPv6 has both advantages of HMIPv6 protocol which reduces signaling delay time and resource consumption during a handover and fast handover algorithm which reduces packet loss. Fast handover algorithm can reduce packet loss by 'tunneling' method ; that transmits a packet from old access router to new access router in case of handover. However, the fast handover algorithm can cause a reordering problem in a receiver between packets tunneled from the previous access router and packets transmitted directly to the new access router, which could degrade the TCP performance due to congestion control. In this paper, we propose two algorithms to solve the reordering problem in fast handover. The first one uses a holding timer for tunneling, the other adds a new algorithm to routers that adopt snoop protocol. We compare the performance of the proposed reseuquencing algorithms with that of the existing FHMIPv6 protocol by simulation. The simulation results show that the proposed algorithms solve the reordering problems and enhance TCP performance by preventing TCP sender entering congestion control.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.275-280
• /
• 2004

In this paper, a very fast block matching scheme was proposed to reduce the computations of Block Sum Pyramid Algorithm for motion estimation in video coding. The proposed algorithm is based on Block Sum Pyramid Algorithm and Efficient Multi-level Successive Elimination Algorithm. The proposed algorithm can reduce the computations of motion estimation greatly with 100% motion estimation accuracy. The efficiency of the proposed algorithm was verified by experimental results.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.9-12
• /
• 2015

In this paper, we propose a new feature matching algorithm by modifying and combining the FAST(Features from Accelerated Segment Test) feature detector and SURF feature descriptor which is robust to the distortion of the given image. Scale space is generated to consider the variation of the scale and determine the candidate of features in the image robust to the noise. The original FAST algorithm results in many feature points along edges. To solve this problem, we apply the principal curvatures for refining it. We also use SURF descriptor to make it robust against the variations in the image by rotation. Through the experiments, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load. Especially, it shows a strength for noisy images.