Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems
© 2018 In this paper, we consider a problem of designing discrete-time systems which are optimal in frequency-weighted least squares sense subject to a maximal output amplitude constraint. It can be shown for such problems, in general, that the optimality conditions do not provide an explicit way of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier BV
2021
|
| Online Access: | https://hdl.handle.net/1721.1/134909 |
| _version_ | 1826208287730696192 |
|---|---|
| author | Tanovic, Omer Megretski, Alexandre |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Tanovic, Omer Megretski, Alexandre |
| author_sort | Tanovic, Omer |
| collection | MIT |
| description | © 2018 In this paper, we consider a problem of designing discrete-time systems which are optimal in frequency-weighted least squares sense subject to a maximal output amplitude constraint. It can be shown for such problems, in general, that the optimality conditions do not provide an explicit way of generating the optimal output as a real-time implementable transformation of the input, due to instability of the resulting dynamical equations and sequential nature in which criterion function is revealed over time. In this paper, we show that, under some mild assumptions, the optimal system has exponentially fading memory. We then propose a causal and stable finite-dimensional nonlinear system which, under an L1 dominance assumption about the equation coefficients, returns high-quality approximations to the optimal solution. The fading memory of the optimal system justifies the receding horizon assumption and suggests that such approach can serve as a cheaper alternative to standard MPC-based algorithms. The result is illustrated on a problem of minimizing peak-to-average-power ratio of a communication signal, stemming from power-efficient transceiver design in modern digital communication systems. |
| first_indexed | 2024-09-23T14:03:28Z |
| format | Article |
| id | mit-1721.1/134909 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T14:03:28Z |
| publishDate | 2021 |
| publisher | Elsevier BV |
| record_format | dspace |
| spelling | mit-1721.1/1349092023-03-15T19:57:20Z Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems Tanovic, Omer Megretski, Alexandre Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science © 2018 In this paper, we consider a problem of designing discrete-time systems which are optimal in frequency-weighted least squares sense subject to a maximal output amplitude constraint. It can be shown for such problems, in general, that the optimality conditions do not provide an explicit way of generating the optimal output as a real-time implementable transformation of the input, due to instability of the resulting dynamical equations and sequential nature in which criterion function is revealed over time. In this paper, we show that, under some mild assumptions, the optimal system has exponentially fading memory. We then propose a causal and stable finite-dimensional nonlinear system which, under an L1 dominance assumption about the equation coefficients, returns high-quality approximations to the optimal solution. The fading memory of the optimal system justifies the receding horizon assumption and suggests that such approach can serve as a cheaper alternative to standard MPC-based algorithms. The result is illustrated on a problem of minimizing peak-to-average-power ratio of a communication signal, stemming from power-efficient transceiver design in modern digital communication systems. 2021-10-27T20:09:49Z 2021-10-27T20:09:49Z 2018 2019-06-13T18:26:14Z Article http://purl.org/eprint/type/ConferencePaper https://hdl.handle.net/1721.1/134909 en 10.1016/J.IFACOL.2018.11.007 IFAC-PapersOnLine Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/4.0/ application/pdf Elsevier BV MIT web domain |
| spellingShingle | Tanovic, Omer Megretski, Alexandre Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title | Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title_full | Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title_fullStr | Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title_full_unstemmed | Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title_short | Real-Time Realization of a Family of Optimal Infinite-Memory Non-Causal Systems |
| title_sort | real time realization of a family of optimal infinite memory non causal systems |
| url | https://hdl.handle.net/1721.1/134909 |
| work_keys_str_mv | AT tanovicomer realtimerealizationofafamilyofoptimalinfinitememorynoncausalsystems AT megretskialexandre realtimerealizationofafamilyofoptimalinfinitememorynoncausalsystems |