Electrical Design of a Portable Pure Sine Wave Inverter Using Ferrite Core Transformer and Double Stage Technique

The size of the iron core transformer in an inverter is large and heavy because it has more conductor turns and works at low frequencies. In contrast, ferrite core transformers are designed to work at high frequencies, so the number of turns of the conductor is less, and the transformer size is relatively small and light. Device portability is a significant challenge in designing high-power inverters. This research uses a ferrite core transformer to design a portable pure sine wave inverter. A two-stage technique is proposed in designing the inverter so that the dc-link voltage and capacitor size can be flexibly selected, and the device size can be compacted. The design consists of two stages. First, a circuit to generate a 400-Volt DC voltage is designed using IC SG3525, a MOSFET power amplifier, and a ferrite core step-up transformer. Second, a pure sine wave generator circuit is constructed using an EGS002 module, MOSFETs, and a filter circuit. Experiments are performed by measuring the output voltage, monitoring power and frequency, and observing the waveform with an oscilloscope. The results reveal that the designed inverter can generate a 220-volt pure sine wave output, a maximum power of 500 Watts, a frequency of 50 Hz, and an efficiency between 91.4% to 98.1%

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