• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.903-912
• /
• 2001

본 논문에서는 계층적 구조를 가진 CDMA 셀룰러 시스템에서 여러 가지 자원 공유 방식들 중 주파수 공유 방식과 주파수 분할 방식의 용량을 순방향 링크에 대해 분석 비교하였다. 용량 분석은 마이크로셀 반경 및 마이크로셀 클러스터의 위치 및 매크로셀에 대한 마이크로셀의 전력 비를 고려하여 몬테카를로 시뮬레이션을 통해 수행하였다. 시뮬레이션 결과로부터 각각의 자원 공유 방식들에 대해 이러한 영향들을 분석하였고, 일반적인 설계 접근방식을 제시하였다. 또한 자원공유방식들의 성능을 용량평면도를 통해 비교하였다. 결과를 요약하면, 계층적 구조를 가진 CDMA 셀룰러 시스템에서 스펙트럼 공유 방식을 적용할 경우 순방향 링크의 용량을 최대로 하기 위해서는 마이크로셀 클러스터가 매크로셀의 중심으로부터 멀리 배치하고, 마이크로셀의 반경을 작게 하는 것이 바람직함을 알 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.687-694
• /
• 2012

In OFDMA-based cellular system, inter-cell interference (ICI) reduces system capacity by aggravating receiving performance of the users located in edge of the cell. Therefore, to mitigate ICI is very important issue in cellular system. To deal with ICI problem, fractional frequency reuse (FFR) is introduced. FFR is an interference management technique. It separates each cell into inner cell and outer cell. Then, it allocates whole system bandwidth to inner cell and different frequency partition to each sector of outer cell. By doing this, outer cell users can ignore interferences from adjacent cells. So, the receiving performance of the cell edge users can be fairly increased. However, using FFR technique has a fatal side effect. In order to use different frequency partition among three sectors of outer cell, they can use only a third of the whole system bandwidth. Then, the reduction of available bandwidth reduces the system throughput directly. To solve this problem, we propose a new FFR method that allocates partially overlapped frequency partition to each sector of outer cell. And then, we suggest a proper overlapping ratio for practical cellular system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.743-746
• /
• 2002

바이오 인포매틱스(bioinformatics) 분야 중 한 분야인 셀 기반 분석(cell-based assay) 시스템 구축의 필요성이 최근 대두되고 있다. 특정 시약 또는 시험 물질을 셀 세포에 투여했을 때 시간 축 변화에 따라 변화하는 세포의 변화를 감지하기 위해서 세포 영상의 영역 분할이 선행되어야 한다. 본 논문에서는 전체 영상에 대하여 셀 공통 영역을 추출하고, 추출된 공통영역을 스네이크(snake) 기법을 이용하여 세포 영역을 분할하는 방법을 제안하고자 한다.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.23-37
• /
• 2004

Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

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

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.440-445
• /
• 2013

This paper proposes a local estimation system which combines Cell Divide Algorithm with low-cost GPS/INS fused by Extended Kalman Filter(EKF) for localization of Quad-rotor when it returns to the departure point. In the research, the low-cost GPS and INS are fused by EKF to reduce the local error of low-cost GPS and the accumulative error of INS due to continuous integration of sensor error values. When the Quad-rotor returns to the departure point in the fastest path, a moving path can be known because it moves straight, where Cell Divide Algorithm is used to divide moving route into the cells. Then it determines the closest position of data of GPS/INS system fused by EKF to obtain the improved local data. The proposed system was verified through comparing experimental localization results obtained by using GPS, GPS/INS and GPS/INS with Cell Divide Algorithm respectively.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.134-142
• /
• 2003

We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.117-126
• /
• 1989

In this paper, a new placement algorithm for gate array lay out design is proposed. The proposed algorithm can treat the variable-sized macrocells and by considering the I/Q pad locations, the routing between I/Q pads and the internal region of a chip can be automated effectively. The algorithm is composed of 3 parts. which are initial partitioning, initial placement and placement improvement. In the initial placement phase, a given circuit is partitioned into 5 sub-circuits, by clustering method with considers connectivities of cells not only with I/Q pads but also with related partitioned groups is used repeatedly to assign a unique position to each cell. In the placement improvement phase, the concept of probabilistic wiring density is introduced, and cell moving algorithm is proposed to make the density in a chip even.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.174-176
• /
• 1999

지리 정보 시스템에서 공간 객체들은 크기가 가변적이고 객체의 형태가 일정하지 않을 뿐만 아니라 공간 객체의 분포 또한 일정하지 않다. 공간 조인은 이러한 공간 객체들의 특성으로 인해 비용이 많이 들고, 공간 객체의 분포에 따라 특정 영역에서의 공간 조인 비용이 많이 들 수 있다. 이 논문에서는 공간 객체들의 분포에 따라 한 번의 Disk 접근으로 공간 객체들을 적재할 수 있는 크기로 셀을 동적 분할하는 알고리즘을 제안한다. 제안된 알고리즘을 수행한 후에 생성된 다양한 크기의 셀을 기반으로 공간 조인을 수행한다. 또한 정제 단계에서 공간 객체를 메모리로 적재하는 Disk I/O를 줄이기 위한 방법도 알아본다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1755-1764
• /
• 1997

In this paper, we proposed the mechanism for the buffer allocation and a cell scheduling method with logical separation a single buffer in the ATm switch, and analyzed the cell loss probability and the delay of each trafic (CBR/VBR/ABR) based on the weighted value and the dynamic cell service scheduling algorithm. The proposed switch buffering system classifies composite trafics incoming to the switch, according to the characteristic of traffic, then stores them in the logically separated buffers, and adopts the round-robin service with weighted value in order to transmit cells in buffers though one output port. We analyzed 4 cell service scheduling algorithms with dynamic round-robinfor each logically separated service line of a single buffer, in which buffers have the respective weighted values and 3 classes on mixed traffic which characteristized by traffic descriptor. In simulation, using SIMCRIPT II.5., we model the VBR and the ABR traffics as ON/OFF processes, and the CBR traffic as a Poisson processes. As the results of analysis according to the proposed buffer management mechanism and cell service algorithm, we have found that the required QoS of each VC can be quaranteed depends on a scale of weighted values allocated to buffers that changed the weighted values, and cell scheduling algorithm.