• Journal of Satellite, Information and Communications
• /
• v.5 no.2
• /
• pp.57-63
• /
• 2010

Many efficient frequency sharing methods are issued in present because of increasing users with various wireless communication terminals. In the satellite communications, the service coverage is generally very wide so frequency sharing with terrestrial system is essentially needed, and the research is progressing dynamically related on this frequency sharing method. But if we adopt the terrestrial system which is commonly used, it can't avoid the interference from terrestrial service to satellite service. Therefore, this paper will introduce methods for reducing the interference from terrestrial station to earth station using cognitive radio system Satellite system is guaranteed with decreasing interference from terrestrial stations using Genetic Algorithm based power control method. Furthermore, terrestrial systems can have increased QoS because the frequency reuse factor in proposed method is higher than existing methods.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.343-350
• /
• 2005

During the design of a successful digital watermarking systems, Pseudo-Noise(PN) sequences are widely used to modulate information bits into watermark signals. In this method, the number of bits that can be hidden within a small image by means of frequency domain watermarking is limited. In this paper, we show the possibility of introducing chaotic sequences into digital watermarking systems as potential substitutes to commonly used PN-sequences. And we propose a method that transforms the text to chaotic sequence. In our current implementation, we show how the sample text is expressed by an implied unit data(watermark) and the implied unit data is regenerated into the original left. Because we use this implied data as watermark for information hiding, we can insert much more watermark compared with previous method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.741-747
• /
• 2010

These days many meeting minutes of various organizations are publicly available and the interest in these documents by people is increasing. However, it is time-consuming and tedious to read and understand whole documents even if the documents can be accessed easily. In addition, what most people want from meeting minutes is to catch the main issues of the meeting and understand its contexts rather than to know whole discussions of the meetings. This paper proposes a novel method for summarizing documents considering the characteristics of the meeting minutes. It first extracts the sentences which are addressing the main issues. For each issues expressed in the extracted sentences, the sentences related with the issue are then extracted in the next step. Then, by transforming the extracted sentences into a tree-structure form, the results of the proposed method can be understood better than existing methods. In the experiments, the proposed method shows remarkable improvement in performance and this result implies that the proposed method is plausible for summarizing meeting minutes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.1-7
• /
• 2009

At a Internet service provider(ISP), field human resources visit many customers sites to provide multimedia services to customers in ubiquitous environment. Scheduling the resources is a hard problem because there are many tasks which have to be done by the resources and the number of the resources is not sufficient. To tackle this problem, ISPs had used team-based scheduling system. However, this aporoach was not sufficient to reduce the number of frequent changes of arrival time and could not increase operational efficiency. We also developed an optimal resource selection algorithm based on statistical information when an operator assigns a task to the resource. After we adopted this algorithm to the real world, the resources can do more tasks in a day.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.103-112
• /
• 2006

Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1256-1261
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.27-32
• /
• 2010

We can cut and paste portions of MPEG coded bitstream efficiently to rearrange the audio and video sequences using our proposed method. The proposed method decodes the MPEG stream within just only one GOP(Group of Picture), edits the decoded video frames, and encodes it back to a MPEG stream. In this method, precise editing is possible. A pre-processing step is specially designed to provide easy cut and paste processing. In the pre-processing step for editing MPEG streams, the detail information is extracted. In addition, video quality is not degraded after the proposed editing process is applied. Consequently, the experimental results show significant improvements compared with traditional algorithms for video editing method in terms of the efficiency and exactness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.250-258
• /
• 2011

In this paper we propose a load balancing scheme for heterogeneous multiple AS's (Application Server) in IMS (IP Multimedia Subsystem) based network. In IMS network, to perform load balancing among multiple ASs with different registration pattern, different weight value should be set for each AS. In previous systems, there exists an inconvenience that the weight value should be set manually by the operator after monitoring the result. In this paper we propose a method to calculate optimal weight in automatic manner and to perform load balancing simultaneously. We also propose a simplified algorithm to reduce calculation in specific situation and present a way to apply our proposed scheme in adaptive manner according to the situation. Through simulation result, we verify that our proposing scheme outperforms previous schemes in load balancing and adjusts well to the change of the system in automatic manner with fast convergence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.784-795
• /
• 2009

An accurate positioning estimation in the wireless sensor networks (WSN) is very important in which each sensor node is aware of neighbor conditions. The multi-hop positioning estimation technique is considered as one of the suitable techniques for the WSN with many low power devices. However geographical holes, where there is no sensor node, may severely decrease the positioning accuracy so that the positioning error can be beyond the tolerable range. Therefore in this paper, we analyze error factors of DV-hop and hole effect to obtain node's accurate position. The proposed methods include boundary node detection, distance level adjustment, and unreliable anchor elimination. The simulation results show that the proposed method can achieve higher positioning accuracy using the hole detection and enhanced distance calculation methods compared with the conventional DV-hop.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.151-161
• /
• 2014

3GPP LTE-Advanced (Release 10) system specifies carrier aggregation (CA) to enable high data rate on using multiple frequency bands, including the variout CA-specific deployment scenarios. Considering one of those scenarios in which the different directional sector antenna is employed by each frequency band, we propose a per-carrier cell selection scheme that can improve the average throughput of the cell-edge users by allowing each user equipment (UE) to select the frequency band of the adjacent cell. Furthermore, a distributed algorithm for inter-cell copperative scheduling in this scheme is proposed to support proportional fairness among the cells. It has been shown that the proposed scheduling algorithm for the per-carrier cell selection scheme improves the cell-edge user throughput roughly by 50% over that of the conventional scheme.