• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2005

In this paper, we propose and evaluate symbol timing recovery algorithm for S-DMT cable modern, which supports more channels and better quality symmetric mutimedia service over HFC network. We adopt timing recovery algorithm of PN sequence insertion in time domain and evaluate the performance of it in various noise channel such as AWGN, ISI, impulse. We verified that performance of this algorithm is depends on the channel noise environment and sampling clock offset and that over 10 dB degradation of Eb/No is occurred at the timing failure probability of $10^3$ in the composite noise channel of AWGN, ISI, and impulse in comparison with impulse noise-alone channel. finally, we verified that this algorithm showed good timing failure probability in case of sampling clock optimization was performed in advance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.4
• /
• pp.7-14
• /
• 2005

Recently, images/videos have been preferred as the communication media because of their information-implication and easy recognizability. But the amount of their data is so large that it has been the major research area to compress their data. This paper is related to optimization in the image data format which can make a great effect in performance of data compression and is based on the wavelet transform and JPEG2000. This paper established a criterion to decide the data format to he used in wavelet transform which is on the bases of the data errors in frequency transform and quantization. This criterion has been used to extract the optimal data format experimentally. The result were (1, 9) of 10-bit fixed-point format for filter coefficients and (9, 7) of 16-bit fixed-point data format for wavelet coefficients and their optimality was confirmed.

• Journal of IKEEE
• /
• v.19 no.1
• /
• pp.45-51
• /
• 2015

Recently, as WPAN (Wireless Personal Area Network) becomes the necessary feature in IoT (Internet of Things) devices, the importance of data security also hugely increases. In this paper, we present the low-complexity 128-bit AES-$CCM^*$ hardware IP for IEEE 802.15.4 standard. For low-cost and low-power implementation which is essentially required in IoT devices, we propose two optimization methods. First, the folded AES(Advanced Encryption Standard) processing core with 8-bit datapath is presented where composite field arithmetic is adopted for reduced hardware complexity. In addition, to support $CCM^*$ mode defined in IEEE 802.15.4, we propose the mode-toggling architecture which requires less hardware resources and processing time. With the proposed methods, the gate count of the proposed AES-$CCM^*$ IP can be lowered up to 57% compared to the conventional architecture.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.521-530
• /
• 2005

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the Portability of mobile clients. Mobile computing satisfies user's demands for convenience and Performance to use information at any time and in any Place, but it has many Problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Query Processing System(MQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client-server environments. In addition, we proved the superiority of the proposed MQPS by comparing its performance to the C-I-S(Client-Intercept- Server) model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1119-1127
• /
• 2012

The one of features of M2M communications, which are recently attracted attention as a future business of mobile communications, is that there is a large number of devices compared with traditional communication services. Hence, the control signal that are generated by the M2M devices may cause a significant congestion in the network and in order to solve this problem, a standardization is progressing for reducing the redundant signaling by managing M2M devices as a group in 3GPP standardization. In this paper, we propose a method of group based mobility management by managing M2M devices that have the same mobility as a group. In the proposed method, M2M devices that have the same mobility are grouped by the Mobility Management Entity (MME) and the MME elects a group header among the M2M devices in the group. Then, the group header performs the Tracking Area Update (TAU) on behalf of the group members to reduce the signaling overhead of mobility management. With the proposed method, we can achieve 80% decrease of the signaling overhead of mobility management compared with the case where each M2M device individually performs its TAU procedure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.360-370
• /
• 2009

Using solar power in wireless sensor networks requires a different approach to energy optimization from networks with battery-based nodes. Solar energy is an inexhaustible supply which can potentially allow a system to run forever, but there are several issues to be considered such as the uncertainty of energy supply and the constraint of rechargeable battery capacity. In this paper, we present SolarSS: a reliable storage system for solar-powered sensor networks, which provides a set of functions, in separate layers, such as sensory data collection, replication to prevent failure-induced data loss, and storage balancing to prevent depletion-induced data loss. SolarSS adapts the level of layers activated dynamically depending on solar energy availability, and provides an efficient resource allocation and data distribution scheme to minimize data loss.

• Journal of Digital Convergence
• /
• v.18 no.2
• /
• pp.261-268
• /
• 2020

Machine learning is achieved by making a cost function from a given digital signal data and optimizing the cost function. The cost function here has local minimums in the cost function depending on the amount of digital signal data and the structure of the neural network. These local minimums make a problem that prevents learning. Among the many ways of solving these methods, our proposed method is to change the learning step-size. Unlike existed methods using the learning rate (step-size) as a fixed constant, the use of multivariate function as the cost function prevent unnecessary machine learning and find the best way to the minimum value. Numerical experiments show that the results of the proposed method improve about 3%(88.8%→91.5%) performance using the proposed method rather than the existed methods.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.1-8
• /
• 2007

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the $\phi$-function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures. We can confirm after dead code elimination though test results that nodes decreases.