Preselected Adjacent Vectors with Sphere Decoding Algorithm for Fast FCS-MPC in Three-Phase 2L-VSI

Finite control set model predictive control (FCSMPC) is a widely used formulation of MPC in power electronics converters that requires higher switching frequencies and, thus, often limits its prediction and control horizons for a single sample. Then, reducing the computational burden is one of the main goals when dealing with this formulation, since it can enable achieving better results by increasing the size of the horizons employed. This paper approaches this problem by building on two established concepts: the subset of adjacent vectors (SAV) and the sphere decoding algorithm (SDA), which optimizes computations by reducing the search space. A novel technique, the preselected adjacent vectors with sphere decoding algorithm (PAV-SDA), is introduced. The proposed approach is implemented in a three-phase two-level voltage source inverter and evaluated through simulation. The findings demonstrate that the PAV-SDA achieves a balance between computational efficiency and performance. For longer horizons, the PAV-SDA significantly reduces computational effort compared to the standard FCSMPC while maintaining the same THD and MSE values.

Authors

Institutions

Publication Details

Published
2025-06-05
DOI
https://doi.org/10.1109/precede63178.2025.11131061
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Preselected Adjacent Vectors with Sphere Decoding Algorithm for Fast FCS-MPC in Three-Phase 2L-VSI

João Pedro Brunoni, Diogo Ortiz Machado, Rodolfo C.C. Flesch
Advanced Data Storage Technologies
article

Preselected Adjacent Vectors with Sphere Decoding Algorithm for Fast FCS-MPC in Three-Phase 2L-VSI

João Pedro Brunoni, Diogo Ortiz Machado, Rodolfo C.C. Flesch
article en

Abstract

Finite control set model predictive control (FCSMPC) is a widely used formulation of MPC in power electronics converters that requires higher switching frequencies and, thus, often limits its prediction and control horizons for a single sample. Then, reducing the computational burden is one of the main goals when dealing with this formulation, since it can enable achieving better results by increasing the size of the horizons employed. This paper approaches this problem by building on two established concepts: the subset of adjacent vectors (SAV) and the sphere decoding algorithm (SDA), which optimizes computations by reducing the search space. A novel technique, the preselected adjacent vectors with sphere decoding algorithm (PAV-SDA), is introduced. The proposed approach is implemented in a three-phase two-level voltage source inverter and evaluated through simulation. The findings demonstrate that the PAV-SDA achieves a balance between computational efficiency and performance. For longer horizons, the PAV-SDA significantly reduces computational effort compared to the standard FCSMPC while maintaining the same THD and MSE values.

Universidade Federal de Santa Catarina (BR)
Openalex Percentile: Top 74%
Advanced Data Storage Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.