Modulation Strategies for Indirect Matrix Converter: Complexity, Quality and Performance

In general, there are two main classifications in matrix converters. The most common known type is conventional matrix converter (CMC) or direct matrix converter (DMC). The other type is indirect matrix converter (IMC). A brief review for modulation strategies are provided in this work for modulation strategies in IMC. There are several popular modulation methods for IMC such as carrier-based modulation and space vector modulation (SVM). A sinusoidal current waveform is produced on the input and output sides to implement the modulation method. In the conclusion the modulation methods will compared based on performance, theoretical complexity, and some other parameters

A modified modulation scheme for three-level diode-clamped matrix converter under unbalanced input conditions

The three-level diode-clamped matrix converter topology has outstanding performance under ideal operating conditions. However, input disturbance can influence the waveforms at the output side of the converter due to the direct coupling between the input and output. This paper proposes a modified modulation scheme for three-level diode-clamped matrix converter during operation with unbalanced input voltages and when different transformer turns ratios are used for an isolation transformer at the input. With this modulation technique, sinusoidal and balanced output voltages are guaranteed and the input current harmonics are minimized. Experimental results are presented to demonstrate the feasibility and effectiveness of the proposed modulation scheme

Improved space vector modulation with reduced switching vectors for multi-phase matrix converter

Multi-phase converter inherits numerous advantages, namely superior fault tolerance, lower per-leg power rating and higher degree of freedom in control. With these advantages, this thesis proposes an improved space vector modulation (SVM) technique to enhance the ac-to-ac power conversion capability of the multi-phase matrix converter. The work is set to achieve two objectives. First is to improve the SVM of a three-to-seven phase single end matrix converter by reducing number of space vector combinations. Second is to use the active vector of the SVM to eliminate the common-mode voltage due to the heterogeneous switching combination of a dual three-to-five phase matrix converter. In the first part, the proposed technique utilizes only 129 out of 2,187 possible active space vectors. With the reduction, the SVM switching sequence is greatly simplified and the execution time is shortened. Despite this, no significant degradation in the output and the input waveform quality is observed from the MATLAB/Simulink simulation and the hardware prototype. The results show that the output voltage can reach up to 76.93% of the input voltage, which is the maximum physical limit of a three-to-seven phase matrix converter. In addition, the total harmonics distortion (THD) for the output voltage is measured to be below 5% over the operating frequency range of 0.1 Hz to 300 Hz. For the second part, the common-mode voltage elimination is based on the cancellation of the resultant vectors (that causes the common-mode to be formed), using a specially derived active vectors of the dual matrix converter. The elimination strategy is coupled with the ability to control the input power factor to unity. The proposed concept is verified by the MATLAB/Simulink simulation and is validated using a 5 kW three-to-five phase matrix converter prototype. The SVM switching algorithm itself is implemented on a dSPACE-1006 digital signal processor platform. The results prove that the common-mode voltage is successfully eliminated from the five-phase induction motor winding. Furthermore, the output phase voltage is boosted up to 150% of the input voltage in linear modulation range

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words