• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.271-274
• /
• 2001

바이패싱 회로는 명령어의 파이프라인의 실행 단계가 종료되자마자 연산 결과를 다음 번 파이프라인 단계의 실행 단계의 실행 유니트에서 사용할 수 있어 명령어 실행 시간이 단축된다. 그러나 바이패싱 회로의 복잡도는 연산처리기가 늘어남에 따라 크게 증가하는 단점이 있으므로 명령어 중복 할당 기법을 적용하면 여러 개의 연산처리기에서 동일한 연산을 수행하여 VLIW 구조에서 가상의 바이패싱 회로가 존재하는 것과 같은 효과를 얻을 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.742-758
• /
• 2000

Some local governments in Korea are currently developing various Urban Information Systems (UIS) to computerize their work. But they have spent too much money on their own UIS development because they have not reused the existing UIS of others. It has caused the central government to invest money repeatedly. The work of some local governments is generally very similar to those of others. The purpose of this paper is to suggest a solution to the reinvestment problem. To solve the problem, this paper suggests that they could model a city's business using Unified Modeling Language and Component-Based Development Process (CBD). They could also develop a UIS from the existing models, and then other municipalities can reuse the developed UIS. This paper illustrates the water supply business of P City in Korea and Rational Unified Process as a CBD. This paper also describes methods to apply CBD, to establish a reusable business model, analysis model, and design model, and to develop the software components of ActiveX Controls form for the water supply business.

• Journal of KIISE:Software and Applications
• /
• v.28 no.3
• /
• pp.262-271
• /
• 2001

디지털 컨텐츠의 저작권 보호와 위변조 탐지를 위해 사용되는 비가시적인 워터마킹 기법은 워터마킹된 영상의 화질저하를 최소로 하면서 화질이 현격히 저하되기 전에는 워터마크가 제거되지 않는 견고성을 갖도록 해야한다. 본 논문에서는 워커마킹된 영상에서 원영상을 사용하지 않고 저작권자를 탐지할 수 있는 디지털 워터마킹 기법을 제안한다. 제안된 기법은 크게 내장단계와 탐지단계로 나뉜다. 내장단계에서는 워터마킹된 영상의 화질이 크게 저하되지 않도록 시각적 마스킹 효과를 고려한다. 워터마크 탐지과정은 원 영상을 사용하지 않고 저작권 분쟁이 발생한 영상과 저작권 주장하는 사람이 제시한 해당 워터마크만을 사용하여 이루어진다. 본 논문에서 제안된 디지털 워터마킹 방법은 일반적인 영상의 변형에 상당히 견고한 특성을 가지며, 변형이 가해지지 않은 워터마킹된 영상을 저작자가 보관함으로써 다중 소유권 주장 문제에 대해서도 저작권 주장이 가능하다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.129-130
• /
• 2016

본 논문에서는 다중 입력의 크기를 비교하기 위한 알고리즘 및 VLSI 구조를 제안한다. 제안하는 알고리즘은 여러 입력을 동시에 비교한 후에 간단한 디지털 논리 함수를 이용하여 그 입력들 중에서 가장 큰 값(혹은 가장 작은 값)을 검출하는 방법을 제공할 수 있다. 이 방식의 단점은 하드웨어 자원이 증가하는 것인데, 이를 위해 중복된 논리 연산을 재사용하는 방법도 제안한다. 제안하고자 하는 방식은 회로 속도의 증가, 즉 지연시간의 감소에 초점을 맞추었다. 제안한 비교 알고리즘은 HDL로 설계한 후에 Magna Chip의 $0.18{\mu}m$ CMOS 라이브러리를 이용하여 구현하였다. 제안한 비교방법은 전통적인 방식에 비해서 4 및 8 입력인 경우에 약 0.5 및 1.1배 만큼 하드웨어 자원을 더 소비하면서, 약 1.5 및 1.8배 만큼 동작 주파수를 향상시킬 수 있었다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.143-151
• /
• 2013

NAND flash-based SSDs (Solid State Drive) have advantages of fast input/output performance and low power consumption so that they could be widely used as storages on tablet, desktop PC, smart-phone, and server. But, SSD has the disadvantage of wear-leveling due to increase of the number of writes. In order to improve the lifespan of the SSD, a variety of data deduplication techniques have been introduced. General fixed-size splitting method allocates fixed size of chunk without considering locality of data so that it may execute unnecessary chunking and hash key generation, and variable-size splitting method occurs excessive operation since it compares data byte-by-byte for deduplication. This paper proposes adaptive chunking method based on application locality and file name locality of written data in SSD-based server storage. The proposed method split data into 4KB or 64KB chunks adaptively according to application locality and file name locality of duplicated data so that it can reduce the overhead of chunking and hash key generation and prevent duplicated data writing. The experimental results show that the proposed method can enhance write performance, reduce power consumption and operation time compared to existing variable-size splitting method and fixed size splitting method using 4KB.

• Proceedings of the KIEE Conference
• /
• 2004.04a
• /
• pp.223-225
• /
• 2004

궤도회로방식을 대체할 무선통신을 이용한 열차제어방식의 경량전철시스템을 시험하기 위한 시험선로를 현재 건설하고 있다 열차제어시스템에서 사용하는 무선통신방식은 2.4[GHz]대역으로 국내 전파법에서 정의하고 있는 무선테이터통신시스템 및 아마추어 무선국의 주파수대역과 중복되고 있다 따라서 열차제어시스템용 무선통신장치에 의해서 시험선로 부근에서 사용가능성이 있는 무선데이터통신시스템 및 아마추어 무선국이 전파 간섭을 받고 있는지 확인하는 것이 필요하다. 본 논문에서는 경량전철시험선에 설치되는 무선통신장치의 배치위치 결정, 시험선지역의 전파환경측정결과 및 무선통신장치의 전파예측 등을 통하여 열차제어시스템용 무선통신장치의 사용가능성을 논하였다.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.256-268
• /
• 2000

Multi-way spatial join is a nested expression of two or more spatial joins. It costs much to process multi-way spatial join, but there have not still reported the scheme of parallel processing of multi-way spatial join. In this paper, parallel processing of multi-way spatial join consists of parallel multi-way spatial filter and parallel spatial refinement. Parallel spatial refinement is executed by the following two steps. The first is the generation of a graph used for reducing duplication of both spatial objects and spatial operations from pairs candidate object table that are the results of multi-way spatial filter. The second is the parallel spatial refinement using that graph. Refinement using the graph is proved to be more efficient than the others. In task creation for parallel refinement, minimum duplication partitioning of the Spatial_Obicct_On_Node graph shows best performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.11-18
• /
• 2005

In ad hoc networks, many applications use the broadcast service that is elementary operation to support various important functions such as route discovery procedure. This paper presents several adaptive probabilistic broadcast schemes base on local information to alleviate the broadcast storm problem for wireless ad hoc network. Our schemes dynamically determine the rebroadcast probability at each node based on the neighbor information within two-hop span. Simulation results are presented, which show our schemes have a better performance over the deterministic flooding approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.9
• /
• pp.475-482
• /
• 2005

String data containing wildcard characters may represent certain patterns in texts. A subsumption relation between two patterns can be defined by a subset relation between sets of strings that match those patterns. Thus, the subsumption relation check is important to determine whether each pattern represents a set of strings without any overlap with another pattern. In this paper, we propose an effective algorithm that can determine subsumption relation between strings with wildcard characters. First, we consider a simple extension of the suffix tree algorithm so that it nay include wildcard characters and then we propose another method that checks the subsumption relation by dividing a suffix tree structure at each location of string data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.76-87
• /
• 2000

Multicarrier DS-CDAM is an effective approach to realize wideband CDMA system in a multipath fading channeal. In this paper, we propose a cinvolutionally-coded overlapped multicarrier DS-CDMA system, and show the performance improvement by comparing with conventional multicarrier DS-CDMA system. We consider the case of 50% overlapping with the adjacent subband to utilize the transmission bandwidth more efficiently. In the proposed multicarrier system, each of the rate 1/M convolutionally-encoded symbols is also 1/R repetition coded and transmitted using overlapped multicarriers and we may obtain the coding gain and frequency diversity effect, simultaneously. We also analyze the possibility of reduction in total MUI by considering a raised-cosine wave-shaping filter having a roll-off factor (0< ${\beta}{\le}1$). It will be shown that the proposed system outperforms the multicarrier DS-CDMA system in $^{[3]}$.