• 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.

• 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.

• 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.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.406-413
• /
• 2013

In this paper, an orthogonal frequency division multiple access (OFDMA)-based minimum end-to-end delay (MED) distributed routing scheme for mobile backhaul wireless mesh networks is proposed. The proposed scheme selects routing paths based on OFDMA subcarrier synchronization control, subcarrier availability, and delay. In the proposed scheme, OFDMA is used to transmit frames between mesh routers using type-I hybrid automatic repeat request over multipath Rayleigh fading channels. Compared with other distributed routing algorithms, such as most forward within radius R, farthest neighbor routing, nearest neighbor routing, and nearest with forwarding progress, simulation results show that the proposed MED routing can reduce end-to-end delay and support highly reliable routing using only local information of neighbor nodes.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• 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.