FPGA implementations of piecewise affine functions based on multi-resolution hyperrectangular partitions

F. Comaschi, B.A.G. Genuit, A. Oliveri, W.P.M.H. Heemels, M. Storace

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)
6 Downloads (Pure)

Abstract

In this paper we propose a digital architecture suited for fast, low-power and small-size electronic implementation of PieceWise Affine (PWA) functions defined over n-dimensional domains partitioned into multi-resolution hyperrectangles. The point location problem, which requires most of the computational effort, is solved through an orthogonal search tree, which is easily and efficiently implementable. In the case of domains partitioned into single-resolution hyperrectangles, a simpler and even faster architecture is proposed. After introducing the new architectures, their key features are discussed and compared to previous architectures implementing PWA functions with domains partitioned into different types of polytopes. Case studies concerning the FPGA implementation of so-called explicit Model Predictive Control (MPC) laws for constrained linear systems are used as benchmarks to compare the different architectures.
Original languageEnglish
Pages (from-to)2920-2933
Number of pages14
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume59
Issue number12
DOIs
Publication statusPublished - 2012

Fingerprint

Partitions (building)
Field programmable gate arrays (FPGA)
Model predictive control
Linear systems

Cite this

@article{ac8620da27e24f3984f8d716cccb0655,
title = "FPGA implementations of piecewise affine functions based on multi-resolution hyperrectangular partitions",
abstract = "In this paper we propose a digital architecture suited for fast, low-power and small-size electronic implementation of PieceWise Affine (PWA) functions defined over n-dimensional domains partitioned into multi-resolution hyperrectangles. The point location problem, which requires most of the computational effort, is solved through an orthogonal search tree, which is easily and efficiently implementable. In the case of domains partitioned into single-resolution hyperrectangles, a simpler and even faster architecture is proposed. After introducing the new architectures, their key features are discussed and compared to previous architectures implementing PWA functions with domains partitioned into different types of polytopes. Case studies concerning the FPGA implementation of so-called explicit Model Predictive Control (MPC) laws for constrained linear systems are used as benchmarks to compare the different architectures.",
author = "F. Comaschi and B.A.G. Genuit and A. Oliveri and W.P.M.H. Heemels and M. Storace",
year = "2012",
doi = "10.1109/TCSI.2012.2206490",
language = "English",
volume = "59",
pages = "2920--2933",
journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers",
number = "12",

}

FPGA implementations of piecewise affine functions based on multi-resolution hyperrectangular partitions. / Comaschi, F.; Genuit, B.A.G.; Oliveri, A.; Heemels, W.P.M.H.; Storace, M.

In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 59, No. 12, 2012, p. 2920-2933.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - FPGA implementations of piecewise affine functions based on multi-resolution hyperrectangular partitions

AU - Comaschi, F.

AU - Genuit, B.A.G.

AU - Oliveri, A.

AU - Heemels, W.P.M.H.

AU - Storace, M.

PY - 2012

Y1 - 2012

N2 - In this paper we propose a digital architecture suited for fast, low-power and small-size electronic implementation of PieceWise Affine (PWA) functions defined over n-dimensional domains partitioned into multi-resolution hyperrectangles. The point location problem, which requires most of the computational effort, is solved through an orthogonal search tree, which is easily and efficiently implementable. In the case of domains partitioned into single-resolution hyperrectangles, a simpler and even faster architecture is proposed. After introducing the new architectures, their key features are discussed and compared to previous architectures implementing PWA functions with domains partitioned into different types of polytopes. Case studies concerning the FPGA implementation of so-called explicit Model Predictive Control (MPC) laws for constrained linear systems are used as benchmarks to compare the different architectures.

AB - In this paper we propose a digital architecture suited for fast, low-power and small-size electronic implementation of PieceWise Affine (PWA) functions defined over n-dimensional domains partitioned into multi-resolution hyperrectangles. The point location problem, which requires most of the computational effort, is solved through an orthogonal search tree, which is easily and efficiently implementable. In the case of domains partitioned into single-resolution hyperrectangles, a simpler and even faster architecture is proposed. After introducing the new architectures, their key features are discussed and compared to previous architectures implementing PWA functions with domains partitioned into different types of polytopes. Case studies concerning the FPGA implementation of so-called explicit Model Predictive Control (MPC) laws for constrained linear systems are used as benchmarks to compare the different architectures.

U2 - 10.1109/TCSI.2012.2206490

DO - 10.1109/TCSI.2012.2206490

M3 - Article

VL - 59

SP - 2920

EP - 2933

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1549-8328

IS - 12

ER -