Finite State Machine Based Realization of Sparse Matrix Converter

2021 
Matrix converters (MCs), compared to traditional back-to-back converters, offer a series of advantages for ac–ac power conversion. However, increased realization complexity and cost have restricted the proliferation of MCs to a limited number of commercially available solutions. In this article, an efficient sparse matrix converter realization is presented as a step toward the development of simpler, lower-cost, and reliable realization architectures. In contrast to common practices that utilize a flexible logic fabric, such as a field programmable gate array or a complex programmable logic device, and a digital signal processor, the proposed implementation is based on a single commercial off-the-shelf microcontroller unit. This method is possible due to the novel implementation of a synchronous finite state machine that realizes the four-step commutation strategy required by the current source rectifier stage. Since the complete control scheme is implemented in one IC, it inherently avoids important MC realization issues, such as communication delays and synchronization between controllers. In addition, both software and hardware requirements are reduced and lower the overall development effort and cost.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    24
    References
    0
    Citations
    NaN
    KQI
    []