This paper investigates the possibilities for the design of current control for VSI from the discrete event point if view. Event-driving determines the transistor switching pattern directly from the current error logi...
详细信息
ISBN:
(纸本)0780387384
This paper investigates the possibilities for the design of current control for VSI from the discrete event point if view. Event-driving determines the transistor switching pattern directly from the current error logic signals change and is designed using a novel matrix based approach for the description of the discrete event systems. A new approach for description of event-driven systems is introduced. It is based on matrix description of Petri Nets, supplemented with a combination of logic and algebraic equations. The control algorithms designed by proposed approach can be easily implemented on modern DSP an FPGA devices. Instead of traditional coding, the control algorithms are loaded in the form of logical matrices. Such implementation does not include time consumptive AID converters and transistor duty cycle algebraic calculations which significantly reduces the modulator calculation efforts. The approach is illustrated by the design of direct current controller for a three phase inverter fed Permanent Magnet Synchronous Machine and is examined by simulations.
The paper describes operation of three-level inverters with synchronized pulsewidth modulation (PWM) at control regimes different from standard Volts/Hertz control. Control algorithms provide common-mode voltage cance...
详细信息
ISBN:
(纸本)0780387384
The paper describes operation of three-level inverters with synchronized pulsewidth modulation (PWM) at control regimes different from standard Volts/Hertz control. Control algorithms provide common-mode voltage cancellation in three-phase load in this case. The output voltage of converters has quarter-wave symmetry ring the whole control range including the zone of overmodulation. Simulations give the behaviour of different versions of synchronous PWM.
In this paper we propose an admission control algorithm which is suitable for real time traffic in a sink-tree network in which per-aggregate resource management is in place. Every flow specifies its leaky-bucket para...
详细信息
ISBN:
(纸本)0769524478
In this paper we propose an admission control algorithm which is suitable for real time traffic in a sink-tree network in which per-aggregate resource management is in place. Every flow specifies its leaky-bucket parameters and a required delay bound, and the algorithm admits a new flow if a guarantee can be given that the delay bound for every established flow is not exceeded. The algorithm is based on a formula, derived through Network Calculus, that relates the worst-case delay of a single flow to the transmission rate provisioned for the aggregate and to the leaky-bucket parameters of flows at the ingress of the network. We describe the algorithm and the employed data structures, and we evaluate its complexity.
Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our underst...
详细信息
Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one-and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.
暂无评论