• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.231.1-231.1
• /
• 2005

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.9-21
• /
• 2013

Tracking is a process which explores user equipment (UE) in the area of tracking in terms of cells. In this paper, two tracking schemes based on macrocell-microcell tiers in hierarchical LTE networks, PMMT and IMMT, are evaluated. In this network, UE can receive a signal from macrocells and overlapping microcells, and can be called from each macrocell or microcell-tier in the PMMT. Also, the UE can be called from the combined macrocell-tier and microcell-tier in the IMMT. Finally, we analyze the optimization of load balance between marcocell-tier and microcell-tier, and an analytical model is developed to evaluate those two arrangements.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.547-549
• /
• 2001

본 논문에서는 MC의 알고리즘을 이용하여 등가면 추출시간을 단축할 수 있는 방법을 제안한다. 각 복셀 꼭지점의 밀도값을 비교하여 등가면이 형성될 수 있는 셀을 선택한다. 등가면이 형성되지 않는 빈 셀은 알고리즘을 진행하지 않고, 선택된 셀에 대해서만 등가면을 형성하기 위한 연산을 수행한다. 이때, 등가면 형성을 위한 꼭지점은 해당 모서리상에서 중앙점 보간으로 찾는다. 이러한 방법으로 형성된 등가면의 정보를 저장하는 객인 테이블을 효과적인 탐색이 가능하도록 개선함으로써 기존의 연구되다 빠르게 등가면을 추출하고 형성할 수 있다.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.204-216
• /
• 2001

최근 이미지 특징 벡터와 같은 고차원 벡터 데이터에 관한 색인 기법들이 많이 연구되고 있다. 하지만, 기존의 색인 기법들은 저차원의 데이터에 대해서는 검색 성능이 우수하지만, 차원이 증가함에 따라 검색 성능이 급격히 저하되는 'dimensional curse' 문제를 안고 있다. 따라서, 본 논문에서는 이러한 문제점을 최소화하기 위해 필터링을 이용한 새로운 색인 기법을 제안한다. 제안하는 셀 기반 필터링 기법은 셀 중심에서 객체까지의 거리값을 저장하여 필터링 효과를 증대시킨다. 또한 고차원 공간을 셀 단위로 분할하며, 각각의 셀을 시그니쳐로 표현한다. 검색을 수행하기 위해, 셀 기반 필터링 기법은 데이터 파일을 직접 접근하기 전에 전체 시그니쳐들을 탐색하여 필터링을 수행함으로써 후보 셀들을 얻는다. 성능 실험을 통해 제안하는 기법이 VA-파일보다 검색 시간에 있어서 약 20%의 성능 향상을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.46-49
• /
• 2007

데이터 스트림이란, 빠른 속도로 지속적으로 생성되는 무한한 크기의 방대한 양의 데이터 집합으로 정의된다. 본 연구에서는 데이터 스트림 분석을 위한 데이터 스트림 격자 기반 클러스터링 기법을 제시한다. 주어진 초기 격자셀에 대해, 데이터 객체의 빈도가 높은 범위를 반복적으로 보다 작은 크기의 격자셀로 분할하여 최소 크기의 격자셀, 단위 격자셀을 생성한다. 격자셀에서는 데이터 객체들의 분포에 대한 통계값만을 저장하여, 기존의 클러스터링 기법에 비해 데이터 객체에 대한 탐색없이 효율적으로 클러스터를 찾을 수 있다.

• Information and Communications Magazine
• /
• v.16 no.4
• /
• pp.45-59
• /
• 1999

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.2
• /
• pp.521-527
• /
• 2020

Quantum-dot cellular automata (QCA) is a technology that attracts attention as a next-generation digital circuit design technology, and several digital circuits have been proposed in the QCA environment. Content-addressable memory (CAM) is a storage device that conducts a search based on information stored therein and provides fast speed in a special process such as network switching. Existing CAM cell circuits proposed in the QCA environment have a disadvantage in that a required area and energy dissipation are large. The CAM cell is composed of a memory unit that stores information and a match unit that determines whether or not the search is successful, and this study proposes an improved QCA CAM cell by designing the memory unit in a multi-layer structure. The proposed circuit uses simulation to verify the operation and compares and analyzes with the existing circuit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.58-67
• /
• 2013

In this paper, a mobile relay station(MRS) for vehicles with a beamforming antenna is considered to increase the reliability of a transmission link, especially for the MRS at cell boundary. Cell searching and direction-of-arrival(DoA) estimation methods for an MRS with a uniform linear array(ULA) are proposed for a multipath environment in OFDM-based cellular systems. Performances of the proposed methods(Method1 and Method2) are evaluated by computer simulation with the standard profile of IEEE 802.16e.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.647-659
• /
• 2003

LPM(Longest Prefix Matching)searching in If address lookup is a major bottleneck of IP packet processing in the high speed router. In the conventional lookup table for the LPM searching in CAM(Content Addressable Memory) the complexity of fast update take 0(1). In this paper, we designed pipeline architecture for fast update of 0(1) cycle of lookup table and high throughput and low area complexity on LPM searching. Lookup-table architecture was designed by CAM(Content Addressable Memory)away that uses 1bit RAM(Random Access Memory)cell. It has three pipeline stages. Its LPM searching rate is affected by both the number of key field blocks in stage 1 and stage 2, and distribution of matching Point. The RTL(Register Transistor Level) design is carried out using Verilog-HDL. The functional verification is thoroughly done at the gate level using 0.35${\mu}{\textrm}{m}$ CMOS SEC standard cell library.