Discrete time analysis of High gain Bidirectional DCDC Converter with single edge PWM

Author(s):  
G. Nagesh ◽  
D.S.G. Krishna ◽  
S. Poornima ◽  
P. Naresh
2002 ◽  
Vol 39 (3) ◽  
pp. 503-516 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
I. T. Castro

We consider, in discrete time, a single machine system that operates for a period of time represented by a general distribution. This machine is subject to failures during operations and the occurrence of these failures depends on how many times the machine has previously failed. Some failures are repairable and the repair times may or may not depend on the number of times the machine was previously repaired. Repair times also have a general distribution. The operating times of the machine depend on how many times it has failed and was subjected to repairs. Secondly, when the machine experiences a nonrepairable failure, it is replaced by another machine. The replacement machine may be new or a refurbished one. After the Nth failure, the machine is automatically replaced with a new one. We present a detailed analysis of special cases of this system, and we obtain the stationary distribution of the system and the optimal time for replacing the machine with a new one.


2006 ◽  
Vol 5 (7) ◽  
pp. 1575-1578
Author(s):  
MoonYoung Choi ◽  
Yu-Dong Yao ◽  
H. Heffes

2005 ◽  
Vol 37 (1) ◽  
pp. 160-184 ◽  
Author(s):  
Juan Alvarez ◽  
Bruce Hajek

In this paper, we analyze the diffusion limit of a discrete-time queueing system with constant service rate and connections that randomly enter and depart from the system. Each connection generates periodic traffic while it is active, and a connection's lifetime has finite mean. This can model a time division multiple access system with constant bit-rate connections. The diffusion scaling retains semiperiodic behavior in the limit, allowing for both short-time analysis (within one frame) and long-time analysis (over multiple frames). Weak convergence of the cumulative arrival process and the stationary buffer-length distribution is proved. It is shown that the limit of the cumulative arrival process can be viewed as a discrete-time stationary-increment Gaussian process interpolated by Brownian bridges. We present bounds on the overflow probability of the limit queueing process as functions of the arrival rate and the connection lifetime distribution. Also, numerical and simulation results are presented for geometrically distributed connection lifetimes.


Sign in / Sign up

Export Citation Format

Share Document