• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.714-721
• /
• 2005

In this parer, we analyze the preamble model in the OFDMA/TDD(OFDM-FDMA/Time Division Duplexing). Besides, under AWGN, ITU-R M.1225 Ped-B and Veh-A channel environments, we analyze capabilities of symbol timing & carrier frequency offset and performance of cell searching capabilities applied to OFDM/TDD system through computer simulation. The performance using Detection Probability, False Alarm Probability, Missing Probability, Mean Acquisition Time and MSE(Mean Square Error) is analyzed. Especially, in the case of symbol timing offset estimation, the preamble structure and its algorithm with enhanced performance are proposed and then compared with existing ones.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.729-731
• /
• 2016

The efficiency of genetic algorithm may be improved, as genetic generation increases. However, a number of algorithms are needed until desired results are obtained. In addition, if Hoc unit increases when linked to a network, there may be a need to compare with all the cases, which would result in many algorithms at a time, and if a single process deals with such algorithms, the efficiency will decrease. Therefore, efficiency of overall network will be decreased in the end. Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.116-129
• /
• 2001

To improve the performance of the inverse halftoning, smoothing masks should be designed optimally by using the accurate information of halftone cells. In this thesis, the method of energy minimization is so defined as to determine the exact information of halftone cell. A heuristic search method is proposed to obtain efficiently the parameters of halftone cells which determine the minimum energy. A halftone-peak modeling method with several functions is proposed and used to get initial values of the parameters. The dimension decomposition technique is also adopted to speed up the search process of energy minimization. Several experiments show that the proposed method extracts correct location of the seed pixel of the halftone cell and the extracted information of the halftone cell can be used to get more exactly smoothed color images. The proposed method can be applied to extract the texture patterns, to separate channel images of a scanned color halftone image, and to extract the moire area in an image.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.305-312
• /
• 2001

Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.9-17
• /
• 2000

In this paper, the improved initial cell searching algorithm is proposed for 3GPP(The third Generation Partnership Project) W-CDMA system. The key objective of the proposed algorithm is to reduce searching slot and to increase the reliability in the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. The first stage of conventional algorithm is also analyzed in a Rayleigh fading channel in order to prove simulation to be reasonable. In this paper, the proposed algorithm presents the better performance than conventional one. We also propose some parameters for optimal performance.

• Annual Conference of KIPS
• /
• 2014.11a
• /
• pp.798-801
• /
• 2014

여행 정보 시스템(ATIS), 교통 관리 시스템 (ITS) 등 궤적 기반 서비스에서, 서비스 품질을 향상시키기 위해서는 주어진 궤적 질의에 대한 정확한 주행시간을 예측하는 것이 필수적이다. 이를 위한 대표적인 공간 데이터 분석 기법으로는 데이터 분류에서 높은 정확도를 보장하는 규칙 기반 분류화 기법이 존재한다. 그러나 기존 규칙 기반 분류화 기법은 단일 컴퓨터 환경만을 고려하기 때문에, 대용량 공간 데이터 처리에 적합하지 않은 문제점이 존재한다. 이를 해결하기 위해, 본 연구에서는 맵리듀스 환경에서 규칙 기반 분류화를 이용한 궤적 데이터 주행 시간 예측 알고리즘을 개발하고자 한다. 제안하는 알고리즘은 첫째, 맵리듀스를 이용하여 대용량 공간 데이터를 병렬적으로 분석함으로써, 활용도 높은 궤적 데이터 규칙을 생성한다. 이를 통해 대용량 공간 데이터 기반의 규칙 생성 시간을 감소시킨다. 둘째, 그리드 구조 기반의 지도 데이터 분할을 통해, 사용자 질의처리 시 탐색 성능을 향상시킨다. 즉, 주행 시간 예측을 위한 규칙 그룹을 탐색 시 질의를 포함하는 그리드 셀만을 탐색하기 때문에, 질의처리 성능이 향상된다. 마지막으로 맵리듀스 구조에 적합한 질의처리 알고리즘을 설계하여, 효율적인 병렬 질의처리를 지원한다. 이를 위해 맵 함수에서는 선정된 그리드 셀에 대해, 질의에 포함된 도로 구간에서의 주행 시간을 병렬적으로 측정한다. 아울러 리듀스 함수에서는 출발 시간 및 구간별 주행 시간을 바탕으로 맵 함수의 결과를 병합함으로써, 최종 결과를 생성한다. 이를 통해 공간 빅데이터 분석을 통한 주행 시간 예측 기법의 처리 시간 및 결과 정확도를 향상시킨다.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.59-68
• /
• 2016

Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.5
• /
• pp.83-88
• /
• 2024

In a grid board with 9 cells of 3×3, the sum clue Sujiko puzzle with 4 fixed sum clues(FSCs) and variable sum clues(VSCs) is an NP-complete problem with no known way to solve the puzzle in polynomial time. To solve this puzzle 9! in all possible cases, a brute-force method should be applied to substitute the number. This paper determined the unique combination number cell by reducing the number of candidates that can enter empty cells. If the only number combination cell no longer exists, this paper proposes a method for determining a common number network with numbers common to the intersection cell of FSC+VSC. Applying the proposed algorithm to 9 benchmarking experimental data showed that puzzles can be solved in polynomial time for all problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.136-143
• /
• 2002

이동 통신망에서 호의 연결 기능를 수행하기 위해서는 이동체(Mobile Terminal)의 위치를 추적할 수 있어야 한다. 이러한 위치추적은 이동체에 의해 수행되는 위치등록과 기지국에 의해 수행되는 페이징에 의해 이루어진다. 하나의 기지국이 담당하는 영역은 셀이라 불리며. 이러한 여러 개의 셀들이 하나의 영역(Zone 흑은 Location Area로 표현됨)을 형성하여 특정의 이동체가 주어진 영역을 벗어나면 위치등록을 하게 되고, 따라서 이 이동체에게 새로운 호가 발생할 때 그 이동체가 최종적으로 등록한 영역에 있는 모든 셀에 페이징 메시지를 보냄으로써 호의 연결이 이루어지는 것이다. 양자는 서로 상쇄관계에 있으며. 양자간의 적절한 부하를 도출하는 것을 이동성 관리(Mobility Management)라고 한다. 기존의 논문에서는 이동성 관리를 위해 이동체의 이동성 모형을 단순히 호 발생률과 이동체의 이동률의 비를 기준으로 분석하였으나, 이것은 연속적인 이동상태나 장기 정지/이동의 패턴은 보여주지 못하고 있다. 본 논문에서는 셀 체류시간의 분포를 다르게 하여 장기정지 상태와 이동 상태가 반복되는 새로운 이동성 모형을 제시하며, 이를 바탕으로 거리기준 위치등록의 최적 기준치를 새로이 도출하며 분석의 결과를 기존 논문과 비교하여, 그 의미를 탐색하고자 한다.