• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.1
• /
• pp.187-192
• /
• 2009

This paper presents a method for designing a robust controller that alleviates disturbance effects and compensates performance degradation owing to the time-delay. Disturbance observer(DOB) approach as a tool of robust control has been widely employed in industry. However, since the Pade approximation of time-delay makes the plant non-minimum phase, the classical DOB cannot be applied directly to the system with time-delay. By using a new DOB structure for non-minimum phase systems together with the Smith Predictor, we propose a new controller for reducing the both effects of disturbance and time-delay. Moreover, the closed-loop system can be made robust against uncertain time-delay with the help of a Pill controller tuning method that is based on a second-order plus dead time modeling technique.

• Management Science and Financial Engineering
• /
• v.10 no.1
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1512-1515
• /
• 1987

The buffer circuit having minimum delay time is designed and analyzed in this paper. Considering the parasitic components of the MOS transistor, the optimal transistor size ratio between the individual buffer stages is presented. This paper's result is better than that of the Mead and Conway's analysis [1] with respect to both delay time and total area that buffer occupies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1013-1020
• /
• 2013

In this paper the super-resolution time delay estimation algorithms based on eigen-analysis are developed for spread spectrum signals along with their comparative performance analysis. First, we shall develop super-resolution time delay estimation algorithms using the representative eigen-analysis based AOA (angle-of-arrival) estimation algorithms such as MUSIC, Minimum-Norm, and ESPRIT, and apply them to the ISO/IEC 24730-2.1 real-time locating system (RTLS) employing a direct sequence spread spectrum (DS-SS) technique to compare their performances in RTLS environments. Simulation results illustrate that all the three algorithms can resolve multipath signals whose delay differences are even smaller than the Rayleigh resolution limit. Simulation results also show that MUSIC and Minimum-Norm provide a similar performance while ESPRIT is inferior to both algorithms in RTLS environments.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.509-521
• /
• 1988

In the designs of integrated circuits, the buffer circuits used for driving a large capacitive load from minimum-structured logic circuit outputs have important effects upon system throughputs. Therefore it is important to optimize the buffer circuits. In this paper, the principle of designing CMOS buffer circuits which have the minimum delay and drive the given capacitive load is discussed. That is, the effects of load capacitance upon rise time, fall time, and delay of the CMOS inverter and the effects of parasitic capacitances are finely analysed to calculate the requested minimum-delay CMOS buffer condition. This is different from the method by C.A. Mead et. al.[2.3.4.]which deals with passive-load-nMOS buffers. Large channel width MOS transistor stages are necessary to drive a large capacitive load. The effects of polysilicon gate resistances of such large stages upon delay are also analysed.And, the area of buffer circuits designed by the proposed method is smaller than that of buffer circuits designed by C.A. Mead's method.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.441-444
• /
• 2003

Network uncertainties such as data loss and time delay can vary the stability property of networked control system. Therefore, these uncertainties must be considered first in designing networked control system. In this paper, we present a new stability analysis method of networked control system with data loss and time delay. The proposed method can determine maximum allowable time delay and minimum allowable transmission rate that preserves stability performance of networked control system. The results of the simulation validate effectiveness of our stability analysis method.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.213-214
• /
• 2008

This paper considers design of a robust controller that alleviates disturbance effects and compensates performance degradation of plants with time-delay. Disturbance observer(DOB) approach as a tool of robust control has been widely employed in industry. However, since the time-delay makes the plant non-minimum phase, classical DOB cannot be applied directly to the time-delay system. By using a new DOB structure for non-minimum phase systems together with the Smith Predictor, we propose a new control algorithm for reducing the effects of disturbance and time-delay of the system.

• Journal of the Korean Society for Railway
• /
• v.12 no.6
• /
• pp.953-960
• /
• 2009

In the major operation section of urban railway, there has been occurred habitual delay, and delay propagation and spread to consecutive trains. Therefore, this delay cause the increase of operation time and irregular operation, also the increase of crowd and inconvenience to passengers. The railway operation plan is a promise to passengers and must have reliability. In the case of high frequency urban operation, dwell time have considerable influence on operational headway, so it is very important to efficiently plan and control the dwell time at stations. In this paper, the survey of the research on dwell time for urban railways is presented. The practical estimation model for minimum required dwell time, and the numerical example and validity are proposed.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.11
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.99-115
• /
• 2005

For an analysis of the performance of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the Initial marking in a timed net. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing 'Timed Net with Probabilities of Choices' where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a 'Timed Net with Probabilities of Choices'. As an example of application, we are performing an analysis of the location based service system using 'Timed Net with Probabilities of Choices'.