• Journal of Advanced Marine Engineering and Technology
• /
• v.41 no.1
• /
• pp.105-110
• /
• 2017

This paper introduces a heave compensation system for offshore crane when it subjected to unexpected disturbances such as ocean waves, tidal currents or winds and their external force. The dynamic model consists of a crane which is considered to behave in the same manner as a rigid body, a hydraulic driven winch, an elastic rope and a payload. To keep the payload from moving upwards and downwards, PD(Proportional-Derivative) control was applied by using linearization. In order to achieve a better performance, the sliding mode control and the nonlinear generalized predictive control algorithm was applied according to the time-delay. As a result, the oscillating amplitude of the payload was reduced by the control algorithm. Considering the time-delay involved in the system to be one second, nonlinear generalized predictive controller with a robust controller was a suitable control algorithm for this heave compensation system because it made the position of te payload reach the desired position with the minimum error. This paper presented a control algorithm using the robust control and its simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.778-785
• /
• 2010

This paper proposes a high-precision ranging scheme based on channel estimation technique and multipath delay analysis in IR-UWB systems. When the IR-UWB signal is transmitted and received, the high-precision ranging is estimated with the time-of-arrival information of the signal. In the proposed scheme, the channel estimation process with the minimum mean square error technique or zero forcing technique is performed and the overlapped multipath within the pulse is analyzed with matrix pencil (MP) algorithm to achieve the ranging accuracy of centimeters. The performance of proposed scheme is evaluated with various IEEE 802.15.4a channel models and the relationship between the ranging performance and the computational complexity is analyzed in terms of the MP parameter values.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.3
• /
• pp.174-179
• /
• 2007

In this paper, we present a optimal module selection using genetic algorithm under the power, area, delay constraint. The proposed algorithm use the way of optimal module selection it will be able to minimize power consumption. In the comparison and experimental results, The proposed application algorithm reduce maximum power saving up to 26.9% comparing to previous non application algorithm, and reduce minimum power saving up to 9.0%. It also show the average power saving up to 15.525% and proved the power saving efficiency.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.364-369
• /
• 2008

The FSA algorithm for identifying multiple tags in RFID systems is based on the slotted ALOHA scheme with a fixed frame size. The performance of FSA algorithm is dependent on the frame size and the number of tags in the reader's identification range. Therefore, this paper proposes a new ODFSA. The proposed ODFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.6
• /
• pp.548-555
• /
• 2013

The localization of sources has a numerous number of applications. To estimate the position of sources, the relative delay between two or more received signals for the direct signal must be determined. Although the generalized cross-correlation method is the most popular technique, an approach based on eigenvalue decomposition (EVD) is also popular one, which utilizes an eigenvector of the minimum eigenvalue. The performance of the eigenvalue decomposition (EVD) based method degrades in the low SNR and the correlated environments, because it is difficult to select a single eigenvector for the minimum eigenvalue. In this paper, we propose a new adaptive algorithm based on Canonical Correlation Analysis (CCA) in order to extend the operation range to the lower SNR and the correlation environments. The proposed algorithm uses the eigenvector corresponding to the maximum eigenvalue in the generalized eigenvalue decomposition (GEVD). The estimated eigenvector contains all the information that we need for time delay estimation. We have performed simulations with uncorrelated and correlated noise for several SNRs, showing that the CCA based algorithm can estimate the time delays more accurately than the adaptive EVD algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3080-3099
• /
• 2016

In this paper, we propose an algorithm for energy efficient cooperative communication in wireless sensor network (WSN). The algorithm computes the appropriate transmission distance corresponding to optimal broadcast bit error probability, while taking the circuit energy consumption and the number of cooperating nodes into consideration. The algorithm guarantees minimum energy consumption by choosing higher value of bit error probability for cooperative phase and lower value of bit error probability for broadcast phase while maintaining the required end-to-end reliability. The simulation results show that the proposed algorithm provides significant energy saving gain when compared with traditional fixed distance schemes and is suitable for applications demanding energy efficiency with high quality of reception.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.59-66
• /
• 2003

We propose the novel optical burst switching scheme to guarantee a minimum bandwidth for multiple classes. To date, QoS studies on OBS network are capable of differentiating two classes, but have difficulties in providing a minimum bandwidth lot several classes because of lower classes' collision with the highest class bursts in the networks. To solve that problem, in our proposed scheme we assign time zones in a data channel for each class periodically, making one burst have top priority at least its zone. Also, the new burst assembling algorithm, as well as the way of managing data channel, is necessarily proposed to coordinate with the proposed OBS scheme. Through the evaluation, we show that the worst-case end-to-end delay is small enough and the received bandwidth of the lower classes is still assured regardless of the traffic load of the highest class.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12A
• /
• pp.1978-1982
• /
• 2001

In a Multi-carrier modulation system, CP (Cyclic prefix) is inserted in the transmit tame in order to eliminate the ISI (Intersymbol Interference) and ICI (Interchannel Interference) caused by delay spread of a received signal, which in rum degrades the throughput of the system. TEQ (Time-domain equalizer) improves the system throughput by shortening the CIR (Channel Impulse Response) time and maintaining the CP length to the minimum regardless of the channel condition. In this paper, a new MMSE (Minimum Mean Square Error) TEQ algorithm is proposed and its performance is analyzed in order to speed up computing the optimum tap coefficients of the equalizer by employing Newton method.

• The Journal of Information Technology
• /
• v.9 no.4
• /
• pp.65-74
• /
• 2006

The back propagation of neural networks has the problems of falling into local minimum and delay of the speed by the iterative learning. An algorithm to solve the problem and improve the speed of the learning was already proposed in[8], which updates the learning parameter related with the connection weight. In this paper, we propose the algorithm generating initial weight to improve the efficiency of the algorithm by offering the difference between the input vector and the target signal to the generating function of initial weight. The algorithm proposed here can classify more than 98.75% of the handwritten digits and this rate shows 30% more effective than the other previous methods.