Abstract
Lattice converters combine the merits of both cascaded-bridge converters and multi-paralleled converters, leading to infinitely large current and voltage capabilities with modularity and scalability as well as small passive components. However, lattice converters suffer from complexity, which poses a serious threat to their widespread adoption. By use of graph theory, this article proposes a unified modeling and control methodology for various lattice converters, resulting in the satisfaction of their key control objectives, including selected inputs/outputs, desired voltages, current sharing, dynamic voltage balancing, and performance optimization. In addition, this article proposes a plurality of novel lattice converter topologies, which complement state-of-the-art options. Simulation and experimental results verify the effectiveness and superiority of the proposed methodology and lattice converters.
Highlights
Higher power is one of the primary drivers behind the research and development of novel power converters [1,2,3,4]
We can connect simple yet basic power converters in series, which collectively share a high voltage, giving rise to the invention of cascaded-bridge converters, such as the well-known cascaded H-bridge converter shown in Figure 1a [1]
As compared with other practically viable multilevel converters, cascaded-bridge converters excel in modularity and scalability [1]
Summary
Higher power is one of the primary drivers behind the research and development of novel power converters [1,2,3,4]. Along the trajectory of high-power converters, wide-bandgap devices are proven to be effective in pushing up switching frequencies, and the simplification of circuit structures [12]. They still suffer from inherent thermal limitations, necessitating novel circuit topologies. G x ( N x , Ex , A x ) , where Nx , Ex , and Ax represent the set of nodes, set of edges, and adjacency matrix, where Nx, Ex,[21]. The set of edges (i.e., Ex ) contain the node pairs, in which the tively [21]. According Knowledge to graph theory, weTheory define a graph Gx by the following triplet: According to graph theory, we define a graph Gx by the following triplet: Gx , (Nx , Ex , Ax ),
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
