|
This article is cited in 1 scientific paper (total in 1 paper)
Digital Information Telecommunication Technologies
On the expediency and possibilities of approximating a pure delay link
V. Zhmuda, L. Dimitrovb, G. Sablinac, H. Rothd, J. Noseke, W. Hardtf a Institute of Laser Physics SB RAS
b Technical University of Sofia
c Novosibirsk State Technical University
d University of Siegen
e Technical University of Liberec
f Technical University of Chemnitz
Abstract:
When solving problems of controlling an object with delay, it is often necessary to approximate a pure delay link with a minimum phase link in order to ensure the possibility of using analytical methods for regulator design. There are many approximation methods based on the Taylor series expansion, as well as modified methods. The most famous one is the Padé approximation method. The known approximation methods have significant drawbacks, which this paper reveals. However, there are other methods of forming other types of filters that can serve as a better approximation in determining the delay relationship, although they are not used for these purposes. In particular, methods of forming the desired differential equation of a locked-loop system of a given order by the method of numerical optimization are known. In this case, the locked-loop system behaves like a filter of the corresponding order, the numerator of which is equal to one, and the specified polynomial is in the denominator. Modeling has shown that such a filter is an effective alternative approximation of the delay link and can be used for the same purposes for which it was supposed to use the Padé approximation. The polynomial coefficients in the literature were calculated only up to the 12th order. The higher the polynomial order is, the more accurate the approximation is.
Keywords:
Padé, formula, delay, approximation, control, automation.
Received: 07.09.2021
Citation:
V. Zhmud, L. Dimitrov, G. Sablina, H. Roth, J. Nosek, W. Hardt, “On the expediency and possibilities of approximating a pure delay link”, Informatics and Automation, 21:1 (2022), 41–67
Linking options:
https://www.mathnet.ru/eng/trspy1183 https://www.mathnet.ru/eng/trspy/v21/i1/p41
|
Statistics & downloads: |
Abstract page: | 70 | Full-text PDF : | 45 |
|