• 정보처리학회논문지C
• /
• 제19C권2호
• /
• pp.149-152
• /
• 2012

이동통신 로밍(roaming)을 하는 경우 외부망(visited network)의 사용 요금이 홈망(home network)에 비해 높게 책정된다. 따라서, 단말이 외부망에 위치하다가 본인의 홈망으로 복귀했는데도 불구하고 여전히 외부망에 등록되어 있는 경우, 사용자의 의도와 무관하게 높은 통신요금이 책정되는 경우가 있다. 이와 같은 문제점은 같은 지역에 여러 사업자의 망이 중복되어 설치된 경우에 자주 발생하는데, 실례로 폴란드 이동통신망 사례를 들 수 있다. 이에 본 논문에서는 이동통신 로밍 사용자의 빠른 홈망 복귀를 위한 망탐색 알고리즘을 제안한다. 제안 기법은 3GPP 규격의 망탐색 동작을 따르면서 단말에 저장된 망정보 DB를 활용하여 홈망을 탐색하는 방식이다. 제안 기법의 성능평가를 위해 실제 단말기와 실험장비를 이용하여 폴란드 사업자 환경을 가상적으로 구축하였다. 실험 결과, 제안 방식이 기존 3GPP 규격 방식에 비해 홈망 복귀시간을 3~60분까지 단축시킬 수 있음을 확인하였다.

• ETRI Journal
• /
• 제28권6호
• /
• pp.721-731
• /
• 2006

A fast intra skip detection algorithm based on the ratedistortion (RD) cost for an inter frame (P-slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate-distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are $16{\times}16$ and $4{\times}4$ intra predictions for luminance and an $8{\times}8$ intra prediction for chroma. For the high profile, an $8{\times}8$ intra prediction has been added for luminance. The $4{\times}4$ prediction mode has 9 prediction directions with 4 directions for $16{\times}16$ and $8{\times}8$ luma, and $8{\times}8$ chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.

• 유체기계공업학회:학술대회논문집
• /
• 유체기계공업학회 2006년 제4회 한국유체공학학술대회 논문집
• /
• 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.

• ETRI Journal
• /
• 제28권4호
• /
• pp.425-434
• /
• 2006

We propose a fast macroblock mode prediction and decision algorithm based on contextual information for Pslices in the H.264/AVC video standard, in which the mode prediction part is composed of intra and inter modes. There are nine $4{\times}4$ and four $16{\times}16$ modes in the intra mode prediction, and seven block types exist for the best coding gain based on rate-distortion optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To overcome this problem, a fast inter mode prediction scheme is applied that uses contextual mode information for P-slices. We verify the performance of the proposed scheme through a comparative analysis of experimental results. The suggested mode search procedure increased more than 57% in speed compared to a full mode search and more than 20% compared to the other methods.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.419-420
• /
• 2006

In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

• ETRI Journal
• /
• 제29권6호
• /
• pp.736-744
• /
• 2007

We propose a fast macroblock (MB) mode prediction and decision algorithm based on temporal correlation for P-slices in the H.264/AVC video standard. There are eight block types for temporal decorrelation, including SKIP mode based on rate-distortion (RD) optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To overcome this problem, a thresholding method for fast inter mode decision using a MB tracking scheme to find the most correlated block and RD cost of the correlated block is suggested for early stop of the inter mode determination. We propose a two-step inter mode candidate selection method using statistical analysis. In the first step, a mode is selected based on the mode information of the co-located MB from the previous frame. Then, an adaptive thresholding scheme is applied using the RD cost of the most correlated MB. Secondly, additional candidate modes are considered to determine the best mode of the initial candidate modes that does not satisfy the designed thresholding rule. Comparative analysis shows that a speed-up factor of up to 70.59% is obtained when compared with the full mode search method with a negligible bit increment and a minimal loss of image quality.

• 전자공학회논문지C
• /
• 제34C권2호
• /
• pp.50-60
• /
• 1997

Reconfiguration of a memory array using spare rows and columns has been known to be a useful technique to improve the yield. When the numbers of spare rows and scolumns are limited, respectively, the repair problem is known to be NP-complete. In this paper, we propose the reconfiguration algorithm for an array of memory cells using faulty cel clustering, which removes rows and columns algrithm is the simplest reconfiguration method with the time complexity of $O(n^2)$, where n is the number of faulty cells, however the repair rate is very low. Whereas the exhaustive search algorithm has a high repair rate, but the time complexity is $O(2^n)$. The proposed algorithm provides the same repair rate as the exhaustive search algorithm for almost all cases and runs as fast as the greedy method. It has the time complexity of $O(n^3)$ in the worst case. We show that the propsed algorithm provides more efficient solutions than other algorithms using simulations.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.41-44
• /
• 1996

A new three step hierarchical search algorithm for motion estimation is proposed. The proposed algorithm exploits the motion correlation of spatially neighboring blocks and the motion continuity of temporally neighboring blocks to alleviate the local minimum problem in the first step of the three step hierarchical search algorithm (3SHS). Simulation results show that the proposed scheme achieves significant improvements in both estimation accuracy and performance reliability compared with the existing fast block matching algorithm including 3SHS, while maintaining almost the same computational complexity as 3SHS. The proposed scheme also possesses the regularity and simplicity of hardware-oriented features.

• 한국인터넷방송통신학회논문지
• /
• 제8권4호
• /
• pp.67-73
• /
• 2008

마코브 랜덤 필드로 모델링한 마코브 네트워크에서 신뢰확산 알고리즘은 각각의 화소에 대응하는 노드들 사이의 메시지 이동에 의해 동작한다. 신뢰확산 알고리즘은 정확한 결과를 얻기 위해 많은 수의 반복 연산을 요구하게 된다. 본 논문에서는 다해상도 영역에서 신뢰확산 알고리즘을 적용한 스테레오 정합 알고리즘을 제안한다. 웨이브렛 또는 리프팅에 기반한 다해상도 변환은 스테레오 정합 알고리즘에서 탐색 영역을 줄일 수 있는 장점 갖기 때문에 고속의 연산을 통해 변이 영상을 생성할 수 있다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.