Journal
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS
Volume 67, Issue 2, Pages 832-841Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIE.2019.2901647
Keywords
Algorithm complexity; cascaded H-bridge (CHB); model predictive control (MPC); static synchronous compensators (STATCOM)
Categories
Funding
- Key Project of National Natural Science Foundation of China [U1510205]
- Newton Research Collaboration Programme [NRCP/1415/138]
Ask authors/readers for more resources
The algorithm complexity of model predictive control (MPC) for cascaded H-bridge (CHB) static synchronous compensators (STATCOMs) was optimized to a polynomial level in previous studies. However, implementing MPC with conventional approaches still suffers from long execution time, where a low cost digital signal processor (DSP) is used to execute optimization algorithms and a small-sized field-programmable gate array (FPGA) is used to extend gate signals and sampling functions. This paper presents a parallel implementation approach to reduce the execution time of MPC, where the FPGA is configured to be used for accelerating the high-complexity sorting tasks. By running the DSP and FPGA in parallel, the algorithm execution time is only determined by the DSP, and the resource consumption is only determined by the FPGA. To minimize the resource consumption and requirement in FPGA, a parallel comparison-based sorter with multiple comparison and accumulators is proposed. The proposed implementation method can reduce the time and space complexity of the MPC from the polynomial level to a linear level without additional hardware cost, which means the MPC for medium-voltage CHB STATCOMs (e.g., 20 stages) can be implemented online with existing control platforms. Experimental results for various CHB STATCOMs are presented to validate the proposed configuration and algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available