• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.138-143
• /
• 2006

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1025-1028
• /
• 2009

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.123_124
• /
• 2009

현재, 제주계통의 풍력설비 한계용량은 120MW로 2007년 12월 이후 풍력발전 사업허가가 중지된 상황이다. 2011년 12월 제2연계선 준공과 함께 풍력설비 한계용량이 대폭 상향될 전망이지만, 정부의 강력한 녹색성장 추진의지로 국산풍력발전기가 개발되면서, 풍력발전기 성능 실증시험지로서의 최적지인 제주지역에 이를 수용하기 위한 당장의 방안마련이 시급한 실정이다. 본 논문에서는 현재 운영 중인 풍력발전설비와 건설 중인 풍력발전설비의 용량을 알아보고, 제2연계선 준공이전인 2010년, 2011년의 추가 풍력발전기의 건설허가 수용가능성을 수요 전망과 운영발전계획을 통하여 검토해보고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.37-40
• /
• 2011

계층적 색인 구조는 대용량의 다차원 데이터에 대한 범위질의를 가장 효율적으로 처리하는 색인 구조이다. 계층적 색인 구조에서 범위질의의 속도를 향상시키기 위해서 색인 구조의 구성 시 발생하는 인접노드간의 겹치는 영역을 줄이는 기법들과 다량의 데이터를 한 번에 읽어 상향식 방식으로 색인 구조의 공간 활용도를 증가시키는 벌크 로딩 기법들이 제안되었다. 하지만 CPU기반에서 개별의 노드들을 순차적으로 질의처리 하는 계층적 색인 구조는 공간 활용도의 증가와 노드 간의 중첩 영역을 줄이는 것만으로는 질의 처리 성능 향상에 한계가 있다. 따라서 본 논문에서는 기존의 CPU기반 계층적 색인 구조 중의 대표적인 예인 R-tree의 저장 구조를 GPU 메모리에 적합하도록 변경을 하였다. 또한 기존 CPU기반 계층적 색인 구조의 순차적인 노드 검색을 GPU를 이용해 병렬적으로 노드를 검사하여 성능을 향상시켰다. 이와 같은 방식으로 질의 영역의 크기에 따라서 성능 향상정도가 다르지만 최대 100배 이상의 성능을 향상시켰다.

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

It is well-known that mobile communication systems are usually limited in their performance and capacity by three major impairments, which are multipath fading, delay spread and co-channel interference (CCI). OFDMA (OFDM-FDMA) system can cope with the multipath fading and delay spread easily due to the beneficial properties of OmM technology. Though OFDMA scheme avoids intra-cell interference using the orthogonality among subcarriers, the scheme contains difficulty of reducing co-channel interference. Therefore, in this paper, adaptive antenna techniques are deployed into OFDMA/TDD system to minimize the co-channel interference induced by adjacent cells and to enhance the uplink performance. For the improvement of downlink performance, we apply TxAA (Transmit Adaptive Array), a kind of transmit diversity technique, utilizing preamble symbols for training antenna may into OFDMA/TDD transmitter side. Simulation results show that the uplink and downlink performance under multipath Rayleigh fading channel improved 9dB and 7dB each compared with the case of single antenna system at target BER $10^{-3}$ .

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.207-213
• /
• 2006

In this paper, we reduce the computational complexity to find the minimum distance of RA codes by searching only valid codewords using repetition part. Since LDPC codes have repetition part like RA codes, we also apply this algorithm for computing the minimum distance of LDPC codes. The minimum distance dominates the code performance at high signal-to-noise ratios(SNRs) and in turn allows an estimate of the error floor. The proposed algorithm computes the minimum distance without any constraint on code structures. The minimum distances of LDPC codes and RA codes with large interleavers of practical importance are computed and used to obtain the error floor, which is compared with the performance of the iterative decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.998-1005
• /
• 2009

In the uplink of OFDMA (Orthogonal Frequency Division Multiple Access) based M-WiMAX(Mobile-Worldwide Interoperability for Microwave Access) system, linear phase shift is caused by signals transmitted from multiuser with different delay time and thus, MAI (Multiple Access Interference) occurs. MAI degrades the performance of ranging code detection and delay time estimation in the uplink. Therefore, in this paper, we propose ranging algorithm, applying SIC (Successive Interference Cancellation) to the conventional ranging algorithm, to minimize MAI and to improve ranging performance. The proposed ranging algorithm is verified through the Monte Carlo simulation, which shows the improved performance of ranging code detection and delay time estimation compared to the conventional algorithms. Through compared with random access of the 3GPP LTE, we can know limit of ranging performance.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.1
• /
• pp.77-86
• /
• 1992

This paper discusses the thermodynamic study on the suction cooling-steam injected gas turbine cycle. The aim of this study is to improve the thermal efficiency and the specific output by steam injection produced by the waste heat from the waste heat recovery boiler and by cooling compressor inlet air by an ammonia absorption-type suction cooling system. The operating region of this newly devised cycle depends upon the pinch point limit and the outlet temperature of refrigerator. The higher steam injection ratio and the lower the evaporating temperature of refrigerant allow the higher thermal efficiency and the specific output. The optimum pressure ratios and the steam injection ratios for the maximum thermal efficiency and the specific output can be found. It is evident that this cycle considered as one of the most effective methods which can obtain the higher thermal efficiency and the specific output comparing with the conventional simple cycle and steam injected gas turbine cycle.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.280-291
• /
• 2009

Skyline Query processing is important to wireless sensor applications in order to process multi-dimensional data efficiently. Most skyline researches about sensor network focus on minimizing the energy consumption due to the battery powered constraints. In order to reduce energy consumption, Filtering Method is proposed. Most existing researches have assumed a snapshot skyline query processing and do not consider continuous queries and use data generated in ancestor node. In this paper, we propose an energy efficient method called Bottom up filtering tuple selection for continuous skyline query processing. Past skyline data generated in child nodes are stored in each sensor node and is used when choosing filtering tuple. We also extend the algorithms, called Support filtering tuple(SFT) that is used when we choose the additional filtering tuple. There is a temporal correlation between previous sensing data and recent sensing data. Thus, Based on past data, we estimate current data. By considering this point, we reduce the unnecessary communication cost. The experimental results show that our method outperforms the existing methods in terms of both data reduction rate(DRR) and total communication cost.