• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.29-34
• /
• 2008

In this paper, we proposed a system protocol for detecting injurious insect to support energy saving transmission in wireless bio sensor networks. The main ideas and features of the system are as follows. First, the route establishment method which is based on the energy efficiency and stability by using time-division tree structure. Second, multi-hop direction-based data gatering structure. In this structure, the selected fading method is used to transmit packet via the established tree structure for supporting power saving and route lifetime efficiently. Finally, we can get the node power saving and reduce transmission delay, thus network lifetime and efficiency are improved. The performance evaluation of the proposed protocol is via OPNET(Optimized Network Engineering Tool).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2818-2825
• /
• 2013

In this paper, a channel estimation method by orthogonalizing of the time domain training signal in MIMO-OFDM systems is proposed. It has shown that Jeon's method[8] cannot be directly used in 4 Tx antenna MIMO-OFDM systems since the delayed Rx signals interfere the orthogonal property of the time domain training signals. As a possible solution to the problem, in this paper, a guard interval is inserted into the center of the training signals so that the orthogonal property between the Rx training signals can be maintained. It is shown by using computer simulations that the proposed method can estimate the channel response in time domain in 4 Tx antenna MIMO-OFDM systems.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.254-263
• /
• 1995

In this paper we discuss Moore and Mealy-model Time-stationary control schemes of pipelined data paths of Application Specific, Integrated Circuits (ASICs). We developed a method to synthesize both a Moore and a Mealy-style Finite State Machine(FSM) controller specifications given a pipelined data path with conditional branches. The control synthesis task consists of the generation of control specification and the FSM synthesis. The control specification procedure generates a FSM specification in the form of a state table. The different partitioning schemes are applied to each FSM controller so as to minimize the total area. Experimental results show the characteristics of the two different control styles and the effects of these two models on cost and performance.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.271-279
• /
• 2006

This study proposes a new diversity algorithm to improve the signal-to-noise ratio. In the wireless channel, if fading occurs due to the multipaths, the performance of the system is apparently reduced. One of the methods to reduce fadings like this is the diversity method, and this study aims to improve the performance of the system by proposing a new diversity algorithm. This study applied rake receiver It applied QPSK and OQPSK modulation methods and applied the convolutional codes, where the code rate is 1/3 and the constraint length is 9, and the turbo code where the constraint length is 4. Under these conditions, this study compared and analyzed the average error probability of Multicarrier CDMA system.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.150-162
• /
• 2004

Moving objects have characteristics that they change continuously their positions over time. The movement of moving objects should be stored on trajectories for processing past queries. Moving objects databases need to provide spatio-temporal index for handling moving objects queries like combined queries. Combined queries consist of a range query selecting trajectories within a specific range and a trajectory query extracting to parts of the whole trajectory. Access methods showing good performance in range queries have a shortcoming that the cost of processing trajectory Queries is high. On the other hand, trajectory-based index schemes like the TB-tree are not suitable for range queries because of high overlaps between index nodes. This paper proposes new TR(Trajectory Riving)-tree which is revised for efficiently processing the combined queries. This index scheme has several features like the trajectory preservation, the increase of the capacity of leaf nodes, and the logical trajectory riving in order to reduce dead space and high overlap between bounding boxes of nodes. In our Performance study, the number of node access for combined queries in TR-tree is about 25% less than the STR-tree and the TB-tree.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.319-323
• /
• 2007

실세계의 여러 문제들은 마르코프 결정 문제(Markov decision problem, MDP)로 표현될 수 있고, 이 MDP는 모델이 알려진 경우에는 평가치 반복(value iteration) 이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘 등을 사용하여 풀 수 있다. 하지만 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않아, MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법이 제안되어 왔다. 이러한 시간적 추상화 방법들의 문제점으로는 시간적 추상화의 디자인에 따라 MDP의 풀이 성능이 크게 달라질 수 있으며, 많은 경우 사용자가 이 디자인을 직접 제공해야 한다는 것들이 있다. 최근 사용자의 간섭이 필요 없이 자동적으로 시간적 추상화를 만드는 방법들이 제안된 바 있으나, 이들 방법들 역시 결과물에 대한 이론적인 성능 보장(performance guarantee)은 제공하지 못하고 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 MDP의 구조와 그 풀이 성능을 연관짓는 복잡도 척도에 대해 살펴본다. 이를 위해 MDP로부터 얻은 상태 경로 그래프(state trajectory graph)의 위상적 성질들을 여러 네트워크 척도(network measurements) 들을 이용하여 측정하고, 이와 MDP의 풀이 성능과의 관계를 다양한 상황에 대해 실험적, 이론적으로 분석해 보았다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2275-2284
• /
• 2015

In this paper, the Walsh coded orthogonal training signals for 4 × 4 multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems are designed and the channel estimation equations are derived as a closed form, taking account of the inter training signal interference problems caused by the multi-path delayed signals. The performances of the proposed channel estimation method are analyzed and compared with the conventional methods[9,14] by using computer simulation. The simulation results show that the proposed methods has better performances, compared with the conventional methods[9,14]. As a result, the proposed method can be used for MIMO-OFDM systems with null sub-carriers.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.7
• /
• pp.471-478
• /
• 2013

This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.56-65
• /
• 2002

This paper proposes a novel transmit diversity technique, namely symbol split orthogonal transmit diversity (SS-OTD). In this technique, full path diversity and temporal diversity are achieved by combining orthogonal transmit diversity technique (OTD) technique with the symbol splitting method proposed by Meyer. Its performances is simulated for fundamental channels associated with the forward link of the IS-2000 system, and then compared with those of OTD and space-time spreading (STS). Our proposed method offers a 0.5-7.7dB performance improvement over OTD under various simulation environments and its performance is similar to STS. Moreover, compares with that of STS, the peak-to-average power ratio (PAR) of transmitted signals in SS-OTD is reduced by a maximal 1.35dB, which decreases the complexity of base station RF devices, such as power amplifiers. Thus, SS-OTD is comparable to STS in performance and superior to STS in the cost and efficiency of base station RF devices.