K-Best Sphere Decoding Algorithm for Long Prediction Horizon FCS-MPC

Finite control set model predictive control (FCS-MPC) strategies for power conversion devices benefit from extending the prediction horizon length. Solving this problem relies on the definition of the underlying integer least-squares problem. Sphere decoding algorithm (SDA) has been extensively used...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on industrial electronics (1982) Ročník 69; číslo 8; s. 7571 - 7581
Hlavní autori: ZafraRatia, Eduardo, Vazquez, Sergio, Marquez Alcaide, Abraham, Franquelo, Leopoldo, Leon, Jose I., Perez Martin, Emilia
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:0278-0046, 1557-9948
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Finite control set model predictive control (FCS-MPC) strategies for power conversion devices benefit from extending the prediction horizon length. Solving this problem relies on the definition of the underlying integer least-squares problem. Sphere decoding algorithm (SDA) has been extensively used in previous works as an approach to solve this problem. In this article, a parallel and fully scalable K-best SDA hardware design is proposed as an alternative. The K-best SDA establishes a different breadth-first search strategy, which addresses some of the main drawbacks of the SDA. Through experimental tests based on an uninterruptible power supply, the K-best SDA performance for long prediction horizon FCS-MPC is assessed and verified. Results demonstrate key beneficial aspects through which the K-best SDA is capable of rendering an improved control performance when compared to the conventional SDA.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0278-0046
1557-9948
DOI:10.1109/TIE.2021.3104600