• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.9-17
• /
• 1999

In this paper, we present a mathematical modeling and perform a performance analysis of double-dwell serial search algorithm, which has a search window concept, for pilot channel in DS-CDMA(Direct Sequence Code Division Multiple Access). We derive a code detection function, a false alarm function, a code miss function, and a mean code acquisition time for the performance analysis. We calculate the mean code acquisition time of the mathematical model in IS-95 forward link and compare it with that of the conventional search methods. The performance of the code acquisition system is also evaluated to investigate the effect of dwell times and search window size. The JTC channel model, which is a PCS channel model in North America, is used for the analysis. The numerical result shows that the mean code acquisition time of the double-dwell serial search algorithm with a search window is reduced by about 17%~25% than those of the conventional ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.775-779
• /
• 2003

A spatio-temporal searcher structure for 3rd generation W-CDMA systems is proposed to enhance the detection capability of the multi-path searcher for the desired signal. This searcher employs the spatio-temporal signal structure to search for newly emerging multipath signals. The proposed multi-path searcher provides better detection capability andthus reduces the mean acquisition time. The detection and false alarm probabilities of new and conventional schemes are calculated and numerical examples of mean acquisition time are given thereafter.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.987-992
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the improved diamond search pattern using an motion vector prediction candidate search point by the predicted motion information from the same block of the previous frame. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improves as high as high as 14~24% in terms of average number of search point per motion vector estimation and improved about 0.02~0.37dB on an average except the full search(FS) algorithm.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.310-316
• /
• 2002

In this paper, we propose an adaptive search range decision algorithm for fast motion estimation of video coding. Block matching algorithm for motion vector estimation that improves coding efficiency by reduction of temporal redundancy has trade-off problem between the motion vector accuracy and the complexity. The proposed algorithm playing as a pre-processing of fast motion estimation adaptively determines the motion search range by the local statistics of neighboring motion vectors. resulting in dramatic reduction of the computational cost without the loss of coding efficiency. Experimental results show the capability of the proposed algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.1207-1213
• /
• 2006

오늘날 모바일 기기가 갖는 역할이 다양해짐과 동시에 모바일 플랫폼에서의 사용자 인터페이스(User Interface, UI)에 대한 연구 또한 활발히 이루어지고 있다. 이는 전통적인 데스크탑 플랫폼에서의 정보에 대한 일반적인 접근 방법이 모바일 기기에 적용하기에는 적절하지 않기 때문이며, 이는 모바일 기기의 제한된 스크린 크기, 부자연스러운 상호작용 방식, 그리고 기기와 관련된 기술적인 다른 요인들과 관련된다고 할 수 있다. 본 연구에서는 휴대폰, PDA, 스마트폰과 같이 작은 화면을 가진 모바일 기기에서 제시되는 메뉴를 탐색할 때 효과적인 메뉴 형식과 페이징 형식이 무엇인지 알아보고자 하였다. 메뉴 형식은 모바일 기기에서 일반적으로 많이 사용되는 열거형(list) 메뉴와 격자형(grid) 메뉴의 두 가지로 제시하였고, 페이징 형식은 한 번에 한 줄씩 화면 하단에서 위로 이동하는 스크롤(scrolling) 방식과 한 번에 한 화면 전체가 위로 이동하는 페이지 간(page-to-page) 이동 방식의 두 가지로 제시하였다. 실험 1 에서는 한 수준의 깊이를 가진 메뉴에서 메뉴 형식과 페이징 형식에 따른 탐색 과제 수행을 측정한 결과, 열거형 메뉴보다 격자형 메뉴에서 사용자들의 메뉴 탐색 수행이 유의미하게 빠르며, 사용자의 만족도 또한 높은 것으로 나타났다. 그러나 페이징 형식에 따른 메뉴 탐색 수행 시간과 선호도에는 유의미한 차이점이 없었고, 메뉴 형식과 페이징 형식간의 상호작용 또한 나타나지 않았다. 실험 2 의 결과, 두 수준의 깊이를 가진 메뉴에서는 페이징 방식이 메뉴 탐색 정확도에 미치는 유의미한 주효과가 있었다. 메뉴 탐색 수행 시간과 주관적 만족도는 실험 1 과 같게 나타났다. 이는 메뉴 형식과 페이징 방법에 따라 사용자의 수행과 선호도가 차이가 있음을 시사한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.73-75
• /
• 2001

데이터베이스에서 질의의 결과로 되돌려지는 레코드의 수가 많을 때, 이를 일정 개수의 레코드 단위로 구분하여 일부만 돌려주는 응용이 많다. 추가의 결과를 요청할 경우, 이를 수행하기 위해 기존에는 다시 동일한 질의를 수행한 후 필요한 레코드 위치까지 순차적으로 접근을 하는 방식을 썼다. 본 논문에서는 인덱스가 정의된 필드를 기준으로 정렬된 결과 집합에서 효율적으로 순위 탐색을 지원하기 위한 Ranking-tree 인덱스 구조를 제안한다. 순위 탐색은 어떤 기준에 의해 정렬된 결과 레코드에서 N번째 순서에 해당하는 레코드부터 탐색하는 것을 말한다. Ranking-tree를 통해 불필요한 질의 결과 탐색 시간을 줄여 성능 향상을 가져올 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.99-103
• /
• 2007

본 논문은 최적 탐색 알고리즘중의 하나인 실수 표현 진화 알고리즘에 자가 적용 세대차 조절을 이용하여 보다 빠른 연산으로 우수해에 접근하기 위한 새로운 방식을 소개한다. 알고리즘의 성능에 영향을 끼치는 진화 속도를 기존 진화 방식과 유전연산자의 수정을 통해 조절하여 탐색 성능을 개선 한다. 조기 수렴의 방지 및 탐색성능의 향상을 위하여 선택과 대치를 포함한 진화방식을 개선하고, 유전 연산자에 의하여 생성된 자손의 대치확률에 따라서 자손의 생성범위를 자가 적응적으로 조절하여, 보다 적은 계산량으로 전역 최적화를 찾고자 한다. 제안된 방법을 벤치마크 테스트 문제에 적용하여 G3 알고리즘, CMA-ES 그리고 DE 등과 성능을 비교하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.44-53
• /
• 2006

In this paper, we propose a new Active Channel Scanning scheme by scanning active channels employed by neighbor APs' with the handover counts and non overlap channel information for fast handover. Under the proposed scheme, the mobile which has finished handover to connect a new APsends the neighbor AP's channel information learned by itself during handover to the new AP. And then, the new AP relays the neighbor channel information to the old AP. It decides a priority by handover counts and non overlap channel information for building a Neighbor Channel Table(NCT), and also sends the table information to its associated mobile nodes, periodically. As a result each mobile can scan only active neighbor APs' channels when performs handover based on the referring to NCT information. Using NS-2 Simulator, we applied to supposed ACS that the result of simulation decides to sort by handover counts and non overlap channel information. we evaluate our proposed ACS scheme based on NCT along with the full scanning scheme and the selective scanning scheme. From simulation results, we show that the proposed scheme is advantageous over the other two schemes in terms of the number of scanning channels and the scanning latency.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).