• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2010.06a
• /
• pp.203-203
• /
• 2010

The proton exchange membrane fuel cell (PEMFC) is different from the normal power supply, and it is a nonlinear, multi-input, strong coupling, the complex dynamic system with large time delay. At present, many studies on the content of the fuel cell fuel cells focus on a static process, this paper analyzed in subsequent sections of the process of fuel cell dynamic response time of transition, and then it found the method to reduce the response time during the process of load change to ensure that the stability of output power.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.19-26
• /
• 2002

This paper propose the queue structure of cell buffering in the output buffer of ATM switch for the traffic with the different QoS. The proposed queue structure can minimize the cell loss ratio of bursty traffic, maximize the queue utilization through the sharing of real-time queue and non-real-time queue. To evaluate the proposed queue structure, we compare the CLP and cell average delay of the proposed queue and fixed queue using the bursty traffic patterns.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.4
• /
• pp.315-320
• /
• 2015

Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.339-348
• /
• 2001

In this paper, a cell scheduling algorithm which can be applied to all of the service class in ATM network is proposed. The proposed algorithm classifies the order of priority in each service class into 4 categories and generates the weight of each class service based on the traffic parameters which are negotiated in connection contract. The proposed algorithm guarantees QoS(Quality of Service) to the traffic which is sensitive to delay carrying out CBR and rt_VBR service. As it effectively manages the connection which has small bandwidth, it minimizes the cell delay in the queue. For verifying the effectiveness of the proposed algorithm the proposed algorithm is simulated with existing cell scheduling algorithm and the result is showed.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.4
• /
• pp.165-176
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories： static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks.. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.505-507
• /
• 2005

In this paper, a timing analysis is performed for the CAN-based simulator system for a fuel cell hybrid electric vehicles. The CAN protocol is recently being used for conventional vehicles, however, the network-induced delay can make the in-vehicle network system unstable. This problem may be occurred in the future vehicles because more ECUs are being required than recent vehicles. In order to develop a stable network-based control system, timing analysis is required at the design process. Throughout this analysis, timing parameters that affect transmission delay are examined and an effective method of predicting a sampling time for a stable communication via CAN protocol. In order to show the validityof suggested timing analysis. some experiments are performed using DSPs with CAN module.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.548-557
• /
• 2018

In this paper, Asynchronous Self-Power Gating technique (ASPG) is used to reduce consumption power in asynchronous digital watch application. The power gating control signal is automatically generated by internal system operation characteristics instead of using replica circuit delay or four-phase handshaking protocol. Isolation cell is designed to insert it between power gating domain and normal operation domain. By using self-power gating circuit, asynchronous digital watch application consumes very low power and maintains data during sleep mode. The comparison results show the proposed ASPG technique saves leakage power up to 40.47% and delay time is reduced to 71% compared to the conventional circuit.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.131-134
• /
• 2000

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.182-189
• /
• 2014

A tapped delay line time-to-digital converter (TDC) can be easily implemented using internal carry chains in a field-programmable gate array, and hence, its use is widespread. However, the tapped delay line TDC suffers from performance degradation because of differences in the delay times of dedicated carry chains. In this paper, a dual edge measurement method is proposed instead of a typical step signal to the delay cell to compensate for the performance degradation caused by wide-delay cells in carry chains. By applying a pulse of a fixed width as an input to the carry chains and using the time information between the up and down edges of the signal pulse, the timing accuracy can be increased. Two dedicated carry chain sites are required for the dual edge measurements. By adopting the proposed dual edge measurement method, the average delay widths of the two carry chains were improved by more than 35%, from 17.3 ps and 16.7 ps to 11.2 ps and 10.1 ps, respectively. In addition, the maximum delay times were improved from 41.4 ps and 42.1 ps to 20.1 ps and 20.8 ps, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.774-782
• /
• 2003

Generally, in the Mobile IP technologies, the use of RSVP(Resource ReSerVation Protocol) is recommended in order to provide a mobile node real-time service. However, the handoff of a mobile node increases the registration delay, RSVP reservation delay and signalling overhead in the Mobile IP and RSVP interworking. Specially, the resource reservation on the path between a mobile node and a correspondent node is the duplicated reservation and then causes unnecessary creation of the signalling overhead and waste of the resource, since the majority of the path before handoff and after handoff is same. If the radius of a cell providing a wireless interface to a mobile node is small, the number of handoff will increase and also signalling overhead and duplicated resource reservation will increase. In this paper, we proposed the integration model of Cellular IP and RSVP with RSVP proxy scheme. Here, Cellular IP protocol minimizes registration delay, transfer delay, and loss by handoff in micro cell network, the RS VP proxy that minimizes the duplication of resource reservation prevents the path for RSVP session from change using the address for reservation of a mobile node. Proposed scheme was evaluated in comparison with the existing Mobile IP and RSVP interworking scheme using the probability of resource reservation fail to the radius of a cell and the handoff rate.