• Title/Summary/Keyword: proportional delay

Search Result 167, Processing Time 0.023 seconds

Adaptive Digital Predictive Peak Current Control Algorithm for Buck Converters

  • Zhang, Yu;Zhang, Yiming;Wang, Xuhong;Zhu, Wenhao
    • Journal of Power Electronics
    • /
    • v.19 no.3
    • /
    • pp.613-624
    • /
    • 2019
  • Digital current control techniques are an attractive option for DC-DC converters. In this paper, a digital predictive peak current control algorithm is presented for buck converters that allows the inductor current to track the reference current in two switching cycles. This control algorithm predicts the inductor current in a future period by sampling the input voltage, output voltage and inductor current of the current period, which overcomes the problem of hardware periodic delay. Under the premise of ensuring the stability of the system, the response speed is greatly improved. A real-time parameter identification method is also proposed to obtain the precision coefficient of the control algorithm when the inductance is changed. The combination of the two algorithms achieves adaptive tracking of the peak inductor current. The performance of the proposed algorithms is verified using simulations and experimental results. In addition, its performance is compared with that of a conventional proportional-integral (PI) algorithm.

Performance Evaluation of WAN Storage Migration Scheme for Cloud Computing Environment (클라우드 컴퓨팅 환경을 위한 WAN 스토리지 이주 기법 성능평가)

  • Chang, Jun-Hyub;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.5
    • /
    • pp.1-7
    • /
    • 2012
  • In this paper, we design and implement the simulator for WAN storage replication model performance evaluation in cloud computing environment. Each cloud of simulator is composed of virtual machine emulator and storage emulator. The virtual machine emulator is composed of read/write ratio module, the read/write sequence combination module, and the read/write request module. The storage emulator is composed of storage management module, data transfer module, read/write operations module, and overhead processing module. Using the simulator, we evaluate performance of migration scheme, pre-copy and the post-copy, considering about read/write ratio, network delay, and network bandwidth. Through simulation, we have confirmed that the average migration time of pre-copy was decreased proportional to the read operation. However, average migration time of post-copy was on the increase. Also, the average migration time of post-copy was increased proportional to the network delay. However, average migration time of pre-copy was shown uniformly. Therefore, we show that pre-copy model more effective to reduce the average migration time than the post-copy model. The average migration time of pre-copy and post-copy were not affected by the change of network bandwidth. Therefore, these results show that selects the storage replication model to be, the network bandwidth know not being the important element.

A Digit Serial Multiplier Over GF(2m)Based on the MSD-first Algorithm (GF(2m)상의 MSD 우선 알고리즘 기반 디지트-시리얼 곱셈기)

  • Kim, Chang-Hoon;Kim, Soon-Cheol
    • The KIPS Transactions:PartA
    • /
    • v.15A no.3
    • /
    • pp.161-166
    • /
    • 2008
  • In this paper, an efficient digit-serial systolic array is proposed for multiplication in finite field GF($2^m$) using the polynomial basis representation. The proposed systolic array is based on the most significant digit first (MSD-first) multiplication algorithm and produces multiplication results at a rate of one every "m/D" clock cycles, where D is the selected digit size. Since the inner structure of the proposed multiplier is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of a high regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementation.

Stationary Frame Current Control Evaluations for Three-Phase Grid-Connected Inverters with PVR-based Active Damped LCL Filters

  • Han, Yang;Shen, Pan;Guerrero, Josep M.
    • Journal of Power Electronics
    • /
    • v.16 no.1
    • /
    • pp.297-309
    • /
    • 2016
  • Grid-connected inverters (GCIs) with an LCL output filter have the ability of attenuating high-frequency (HF) switching ripples. However, by using only grid-current control, the system is prone to resonances if it is not properly damped, and the current distortion is amplified significantly under highly distorted grid conditions. This paper proposes a synchronous reference frame equivalent proportional-integral (SRF-EPI) controller in the αβ stationary frame using the parallel virtual resistance-based active damping (PVR-AD) strategy for grid-interfaced distributed generation (DG) systems to suppress LCL resonance. Although both a proportional-resonant (PR) controller in the αβ stationary frame and a PI controller in the dq synchronous frame achieve zero steady-state error, the amplitude- and phase-frequency characteristics differ greatly from each other except for the reference tracking at the fundamental frequency. Therefore, an accurate SRF-EPI controller in the αβ stationary frame is established to achieve precise tracking accuracy. Moreover, the robustness, the harmonic rejection capability, and the influence of the control delay are investigated by the Nyquist stability criterion when the PVR-based AD method is adopted. Furthermore, grid voltage feed-forward and multiple PR controllers are integrated into the current loop to mitigate the current distortion introduced by the grid background distortion. In addition, the parameters design guidelines are presented to show the effectiveness of the proposed strategy. Finally, simulation and experimental results are provided to validate the feasibility of the proposed control approach.

A Performance Analysis and Evaluation of Congestion Avoidance Algorithm for ABR service over ATM Networks (ATM망에서 ABR 서비스를 위한 혼잡회피 알고리즘의 성능 분석 및 평가)

  • 하창승;조익성
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.80-91
    • /
    • 2002
  • A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

  • PDF

Achieving Relative Loss Differentiation using D-VQSDDP with Differential Drop Probability (차별적이니 드랍-확률을 갖는 동적-VQSDDP를 이용한 상대적 손실차별화의 달성)

  • Kyung-Rae Cho;Ja-Whan Koo;Jin-Wook Chung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1332-1335
    • /
    • 2008
  • In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (maxth, minth, maxp) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static maxp parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore maxp parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

Improvement of Microphone Away Performance in the Low Frequencies Using Modulation Technique (변조 기법을 이용한 마이크로폰 어레이의 저주파 대역 특성 개선)

  • Kim, Gi-Bak;Cho, Nam-Ik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.111-118
    • /
    • 2005
  • In this paper, we employ the modulation technique for improving the characteristics of beamformer in the low frequencies and thus improving the overall noise reduction performance. In the 1-dimensional uniform linear microphone arrays, we can suppress the narrowband noise component using the delay-and-sum beamforming. But, for the wideband noise signal, the delay-and-sum beamformer does not work well for the reduction of low frequency component because the inter-element spacing is usually set to avoid spatial aliasing at high frequencies. Hence, the beamwidth is not uniform with respect to each frequency and it is usually wider at the low frequencies. In order to obtain the beamwidth independent of frequencies, subarray systems[1][2][3][4] and multi-beamforming[5] have been proposed. However these algorithms need large space and more microphones since they are based on the theory that the size of the array is proportional to the wavelength of the input signal. In the proposed beamformer, we reduce the low frequency noise by using modulation technique that does not need additional sensors or non-uniform spacing. More Precisely, the array signals are split into subbands, and the low frequency components are shifted to high frequencies by modulation and reduced by the delay-and-sum beamforming techniques with small size microphone array. Experimental results show that the proposed technique Provides better performance than the conventional ones, especially in the low frequency band.

Impact of Group Delay in RF BPF on Impulse Radio Systems (임펄스 라디오 시스템에서 RF 대역 통과 필터의 군지연 영향 분석)

  • Myoung Seong-Sik;Kwon Bong-Su;Kim Young-Hwan;Yook Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.4 s.95
    • /
    • pp.380-388
    • /
    • 2005
  • This paper presents analysis results of the effects of RF filter characteristics on the system performance of impulse radio. The impulse radio system transmits modulated pulses having very short time duration and information can be extracted in receiver side based on cross-correlation between received and transmitted pulses. Accordingly, the pulse distortion due to in-band group delay variation can cause serious system performance degradation. In general, RF bandpass filters inevitably cause group delay difference to the signal passing through the filter which is proportional to its skirt characteristic due to its resonance phenomenon. For time as well as frequency domain analysis, small signal scattering parameter $S_{21}$ and its Fourier transform are used to characterize output pulse waveform under the condition that the input and output ports are matched. The output pulse waveform of the filter is predicted based on convolution integral between input pulse and filter transfer function, and resulting BER performances in the BPM and PPM based impulse radio system are calculated.

Design and Performance Evaluation of An Efficient Transmission Rate Allocation Algorhthm for ABR Services in ATM Networks (ATM 망에서 ABR서비스를 위한 효율적인 전송률 할당 알고리즘 설계 및 성능분석)

  • Kim, Myung-Kyun;Heo, Jung-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.3011-3018
    • /
    • 2000
  • On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].

  • PDF

Time Utility and Channel State based Wireless Downlink Packet Scheduling Algorithm for OFDMA System (OFDMA 무선 시스템에서의 시간-효용과 채널 상태 기반의 하향 링크 패킷 스케줄링)

  • Ryu, Seung-Wan;Seo, Hyun-Hwa;Chung, Soo-Jung;Lim, Soon-Yong;Park, Sei-Kwon
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.111-121
    • /
    • 2004
  • In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.