1,467 research outputs found
Asymptotically Efficient Quasi-Newton Type Identification with Quantized Observations Under Bounded Persistent Excitations
This paper is concerned with the optimal identification problem of dynamical
systems in which only quantized output observations are available under the
assumption of fixed thresholds and bounded persistent excitations. Based on a
time-varying projection, a weighted Quasi-Newton type projection (WQNP)
algorithm is proposed. With some mild conditions on the weight coefficients,
the algorithm is proved to be mean square and almost surely convergent, and the
convergence rate can be the reciprocal of the number of observations, which is
the same order as the optimal estimate under accurate measurements.
Furthermore, inspired by the structure of the Cramer-Rao lower bound, an
information-based identification (IBID) algorithm is constructed with adaptive
design about weight coefficients of the WQNP algorithm, where the weight
coefficients are related to the parameter estimates which leads to the
essential difficulty of algorithm analysis. Beyond the convergence properties,
this paper demonstrates that the IBID algorithm tends asymptotically to the
Cramer-Rao lower bound, and hence is asymptotically efficient. Numerical
examples are simulated to show the effectiveness of the information-based
identification algorithm.Comment: 16 pages, 3 figures, submitted to Automatic
Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic
Autonomous critical systems, such as satellites and space rovers, must be
able to detect the occurrence of faults in order to ensure correct operation.
This task is carried out by Fault Detection and Identification (FDI)
components, that are embedded in those systems and are in charge of detecting
faults in an automated and timely manner by reading data from sensors and
triggering predefined alarms. The design of effective FDI components is an
extremely hard problem, also due to the lack of a complete theoretical
foundation, and of precise specification and validation techniques. In this
paper, we present the first formal approach to the design of FDI components for
discrete event systems, both in a synchronous and asynchronous setting. We
propose a logical language for the specification of FDI requirements that
accounts for a wide class of practical cases, and includes novel aspects such
as maximality and trace-diagnosability. The language is equipped with a clear
semantics based on temporal epistemic logic, and is proved to enjoy suitable
properties. We discuss how to validate the requirements and how to verify that
a given FDI component satisfies them. We propose an algorithm for the synthesis
of correct-by-construction FDI components, and report on the applicability of
the design approach on an industrial case-study coming from aerospace.Comment: 33 pages, 20 figure
A Novel Kernel Algorithm for Finite Impulse Response Channel Identiο¬cation, Journal of Telecommunications and Information Technology, 2023, nr 2
Over the last few years, kernel adaptive ο¬lters have gained in importance as the kernel trick started to be used in classic linear adaptive ο¬lters in order to address various regression and time-series prediction issues in nonlinear environments.In this paper, we study a recursive method for identifying ο¬nite impulse response (FIR) nonlinear systems based on binary-value observation systems. We also apply the kernel trick to the recursive projection (RP) algorithm, yielding a novel recursive algorithm based on a positive deο¬nite kernel. For purposes, our approach is compared with the recursive projection (RP) algorithm in the process of identifying the parameters of two channels, with the ο¬rst of them being a frequency-selective fading channel, called a broadband radio access network (BRAN B) channel, and the other being a a theoretical frequency-selective channel, known as the Macchi channel. Monte Carlo simulation results are presented to show the performance of the proposed algorith
ΠΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½Π°Ρ ΠΎΡΠ΅Π½ΠΊΠ° ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΏΠ»ΠΎΡΠ½ΠΎΡΡΠΈ ΠΌΠΎΡΠ½ΠΎΡΡΠΈ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΠ³Π½Π°Π»ΠΎΠ² Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΎΠΊΠΎΠ½Π½ΡΡ ΡΡΠ½ΠΊΡΠΈΠΉ
Π‘ΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΠ΅ΡΡΡ ΠΊΠ°ΠΊ ΠΎΠ΄ΠΈΠ½ ΠΈΠ· ΠΎΡΠ½ΠΎΠ²Π½ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌ ΠΈ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² ΡΠ°Π·Π»ΠΈΡΠ½ΠΎΠΉ ΡΠΈΠ·ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΏΡΠΈΡΠΎΠ΄Ρ. Π ΡΡΠ»ΠΎΠ²ΠΈΡΡ
ΡΡΠ°ΡΠΈΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ Π½Π΅ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΠΎΡΡΠΈ ΡΠΈΠ³Π½Π°Π»Ρ ΠΏΠΎΠ΄Π²Π΅ΡΠ³Π°ΡΡΡΡ ΡΠ»ΡΡΠ°ΠΉΠ½ΡΠΌ ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΡΠΌ ΠΈ Π·Π°ΡΡΠΌΠ»Π΅Π½ΠΈΡΠΌ. ΠΠ½Π°Π»ΠΈΠ· ΡΠ°ΠΊΠΈΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡ ΠΊ Π½Π΅ΠΎΠ±Ρ
ΠΎΠ΄ΠΈΠΌΠΎΡΡΠΈ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΏΠ»ΠΎΡΠ½ΠΎΡΡΠΈ ΠΌΠΎΡΠ½ΠΎΡΡΠΈΒ (Π‘ΠΠ). ΠΠ° ΠΏΡΠ°ΠΊΡΠΈΠΊΠ΅ Π΄Π»Ρ Π΅Ρ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ ΡΠΈΡΠΎΠΊΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΠ΅ΡΡΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄. ΠΡΠ½ΠΎΠ²Ρ ΡΠΈΡΡΠΎΠ²ΡΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ², ΡΠ΅Π°Π»ΠΈΠ·ΡΡΡΠΈΡ
ΡΡΠΎΡ ΠΌΠ΅ΡΠΎΠ΄, ΡΠΎΡΡΠ°Π²Π»ΡΠ΅Ρ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠ΅ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΠ΅ Π€ΡΡΡΠ΅. Π ΡΡΠΈΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°Ρ
ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠΈΡΡΠΎΠ²ΠΎΠ³ΠΎ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΡΠ²Π»ΡΡΡΡΡ ΠΌΠ°ΡΡΠΎΠ²ΡΠΌΠΈ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌΠΈ. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ Π²Π΅Π΄Π΅Ρ ΠΊ ΡΠ²Π΅Π»ΠΈΡΠ΅Π½ΠΈΡ ΡΠΈΡΠ»Π° ΡΡΠΈΡ
ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ. ΠΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΠΎΡΠ½ΠΎΡΡΡΡΡ ΠΊ Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΡΡΡΠ΄ΠΎΠ΅ΠΌΠΊΠΈΠΌ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌ. ΠΠ½ΠΈ ΡΠ²Π»ΡΡΡΡΡ Π΄ΠΎΠΌΠΈΠ½ΠΈΡΡΡΡΠΈΠΌ ΡΠ°ΠΊΡΠΎΡΠΎΠΌ ΠΏΡΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠΈ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΡ
Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΠ΅ΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΡΡ Π΅Π³ΠΎ ΠΌΡΠ»ΡΡΠΈΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ²Π½ΡΡ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΡ.
Π ΡΡΠ°ΡΡΠ΅ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΡΡΡ Π·Π°Π΄Π°ΡΠ° ΡΠ½ΠΈΠΆΠ΅Π½ΠΈΡ ΠΌΡΠ»ΡΡΠΈΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ²Π½ΠΎΠΉ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ Ρ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ΠΌ ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠ°Π΄Π°ΡΠ° ΡΠ΅ΡΠ°Π΅ΡΡΡ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ Π΄Π»Ρ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΠ³Π½Π°Π»Π° Π² ΡΠΈΡΡΠΎΠ²ΡΡ ΡΠΎΡΠΌΡ. Π’Π°ΠΊΠΎΠ΅ Π΄Π²ΡΡ
ΡΡΠΎΠ²Π½Π΅Π²ΠΎΠ΅ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ΅ΡΡΡ Π±Π΅Π· ΡΠΈΡΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΏΠΎΠ³ΡΠ΅ΡΠ½ΠΎΡΡΠΈ. ΠΠ° ΠΎΡΠ½ΠΎΠ²Π΅ ΡΠ΅ΠΎΡΠΈΠΈ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ, ΡΠ΅Π·ΡΠ»ΡΡΠ°Ρ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ Π²ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΡΡΡ ΠΊΠ°ΠΊ Ρ
ΡΠΎΠ½ΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠ°Ρ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΡ ΡΡΡΠ΅ΡΡΠ²Π΅Π½Π½ΡΡ
ΡΠΎΠ±ΡΡΠΈΠΉ, ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ΅ΠΌΡΡ
ΡΠΌΠ΅Π½ΠΎΠΉ Π΅Π³ΠΎ Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ. ΠΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ Π΄Π»Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠ° Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠΈΠ»ΠΎ Π°Π½Π°Π»ΠΈΡΠΈΡΠ΅ΡΠΊΠΎΠ΅ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΠΈΠ½ΡΠ΅Π³ΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠΈ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄Π΅ ΠΎΡ Π°Π½Π°Π»ΠΎΠ³ΠΎΠ²ΠΎΠΉ ΡΠΎΡΠΌΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ ΠΊ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΏΡΠΎΡΠ΅Π΄ΡΡΠ°ΠΌ Π΅Π΅ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ Π² Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠΌ Π²ΠΈΠ΄Π΅. ΠΡΠΈ ΠΏΡΠΎΡΠ΅Π΄ΡΡΡ ΡΡΠ°Π»ΠΈ ΠΎΡΠ½ΠΎΠ²ΠΎΠΉ Π΄Π»Ρ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠΈ ΡΠΈΡΡΠΎΠ²ΠΎΠ³ΠΎ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°. ΠΡΠ½ΠΎΠ²Π½ΡΠΌΠΈ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΠΌΠΈ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΡΠ²Π»ΡΡΡΡΡ Π°ΡΠΈΡΠΌΠ΅ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠ»ΠΎΠΆΠ΅Π½ΠΈΡ ΠΈ Π²ΡΡΠΈΡΠ°Π½ΠΈΡ. Π£ΠΌΠ΅Π½ΡΡΠ΅Π½ΠΈΠ΅ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²Π° ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΡΠ½ΠΈΠΆΠ°Π΅Ρ ΠΎΠ±ΡΡΡ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΡ ΡΡΡΠ΄ΠΎΠ΅ΠΌΠΊΠΎΡΡΡ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ Π‘ΠΠ. Π‘ ΡΠ΅Π»ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ°Π±ΠΎΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° Π±ΡΠ»ΠΈ ΠΏΡΠΎΠ²Π΅Π΄Π΅Π½Ρ ΡΠΈΡΠ»Π΅Π½Π½ΡΠ΅ ΡΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΡ. ΠΠ½ΠΈ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ»ΠΈΡΡ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΈΠΌΠΈΡΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠΉ ΠΏΡΠΎΡΠ΅Π΄ΡΡΡ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ. Π ΠΊΠ°ΡΠ΅ΡΡΠ²Π΅ ΠΏΡΠΈΠΌΠ΅ΡΠ° ΠΏΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΎΡΠ΅Π½ΠΎΠΊ Π‘ΠΠ Ρ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ΠΌ ΡΡΠ΄Π° Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΡ
ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠΎΠ»ΡΡΠ΅Π½Π½ΡΠ΅ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΡΠ²ΠΈΠ΄Π΅ΡΠ΅Π»ΡΡΡΠ²ΡΡΡ, ΡΡΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΠΎΠ³ΠΎ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ Π²ΡΡΠΈΡΠ»ΡΡΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΡΠ΅ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ Ρ Π²ΡΡΠΎΠΊΠΎΠΉ ΡΠΎΡΠ½ΠΎΡΡΡΡ ΠΈ ΡΠ°ΡΡΠΎΡΠ½ΡΠΌ ΡΠ°Π·ΡΠ΅ΡΠ΅Π½ΠΈΠ΅ΠΌ Π² ΡΡΠ»ΠΎΠ²ΠΈΡΡ
ΠΏΡΠΈΡΡΡΡΡΠ²ΠΈΡ Π°Π΄Π΄ΠΈΡΠΈΠ²Π½ΠΎΠ³ΠΎ Π±Π΅Π»ΠΎΠ³ΠΎ ΡΡΠΌΠ° ΠΏΡΠΈ Π½ΠΈΠ·ΠΊΠΎΠΌ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΠΈ ΡΠΈΠ³Π½Π°Π»/ΡΡΠΌ. ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠ°Ρ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΎΡΡΡΠ΅ΡΡΠ²Π»Π΅Π½Π° Π² Π²ΠΈΠ΄Π΅ ΡΡΠ½ΠΊΡΠΈΠΎΠ½Π°Π»ΡΠ½ΠΎ ΡΠ°ΠΌΠΎΡΡΠΎΡΡΠ΅Π»ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ. ΠΠ°Π½Π½ΡΠΉ ΠΌΠΎΠ΄ΡΠ»Ρ ΠΌΠΎΠΆΠ΅Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°ΡΡΡΡ ΠΊΠ°ΠΊ ΠΎΡΠ΄Π΅Π»ΡΠ½ΡΠΉ ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½Ρ Π² ΡΠΎΡΡΠ°Π²Π΅ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΠΎΠ³ΠΎ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈ Π·Π½Π°ΡΠΈΠΌΠΎΠ³ΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ Π΄Π»Ρ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠ²Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° ΡΠ°ΡΡΠΎΡΠ½ΠΎΠ³ΠΎ ΡΠΎΡΡΠ°Π²Π° ΡΠ»ΠΎΠΆΠ½ΡΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ²
ΠΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½Π°Ρ ΠΎΡΠ΅Π½ΠΊΠ° ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΏΠ»ΠΎΡΠ½ΠΎΡΡΠΈ ΠΌΠΎΡΠ½ΠΎΡΡΠΈ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΠ³Π½Π°Π»ΠΎΠ² Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ΠΌ ΠΎΠΊΠΎΠ½Π½ΡΡ ΡΡΠ½ΠΊΡΠΈΠΉ
Spectral analysis of signals is used as one of the main methods for studying systems and objects of various physical natures. Under conditions of a priori statistical uncertainty, the signals are subject to random changes and noise. Spectral analysis of such signals involves the estimation of the power spectral density (PSD). One of the classical methods for estimating PSD is the periodogram method. The algorithms that implement this method in digital form are based on the discrete Fourier transform. Digital multiplication operations are mass operations in these algorithms. The use of window functions leads to an increase in the number of these operations. Multiplication operations are among the most time consuming operations. They are the dominant factor in determining the computational capabilities of an algorithm and determine its multiplicative complexity.
The paper deals with the problem of reducing the multiplicative complexity of calculating the periodogram estimate of the PSD using window functions. The problem is solved based on the use of binary-sign stochastic quantization for converting a signal into digital form. This two-level signal quantization is carried out without systematic error. Based on the theory of discrete-event modeling, the result of a binary-sign stochastic quantization in time is considered as a chronological sequence of significant events determined by the change in its values. The use of a discrete-event model for the result of binary-sign stochastic quantization provided an analytical calculation of integration operations during the transition from the analog form of the periodogram estimation of the SPM to the mathematical procedures for calculating it in discrete form. These procedures became the basis for the development of a digital algorithm. The main computational operations of the algorithm are addition and subtraction arithmetic operations. Reducing the number of multiplication operations decreases the overall computational complexity of the PSD estimation. Numerical experiments were carried out to study the algorithm operation. They were carried out on the basis of simulation modeling of the discrete-event procedure of binary-sign stochastic quantization. The results of calculating the PSD estimates are presented using a number of the most famous window functions as an example. The results obtained indicate that the use of the developed algorithm allows calculating periodogram estimates of PSD with high accuracy and frequency resolution in the presence of additive white noise at a low signal-to-noise ratio. The practical implementation of the algorithm is carried out in the form of a functionally independent software module. This module can be used as a part of complex metrologically significant software for operational analysis of the frequency composition of complex signals.Π‘ΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΠ΅ΡΡΡ ΠΊΠ°ΠΊ ΠΎΠ΄ΠΈΠ½ ΠΈΠ· ΠΎΡΠ½ΠΎΠ²Π½ΡΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ² ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΡΡΠ΅ΠΌ ΠΈ ΠΎΠ±ΡΠ΅ΠΊΡΠΎΠ² ΡΠ°Π·Π»ΠΈΡΠ½ΠΎΠΉ ΡΠΈΠ·ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΏΡΠΈΡΠΎΠ΄Ρ. Π ΡΡΠ»ΠΎΠ²ΠΈΡΡ
ΡΡΠ°ΡΠΈΡΡΠΈΡΠ΅ΡΠΊΠΎΠΉ Π½Π΅ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΠΎΡΡΠΈ ΡΠΈΠ³Π½Π°Π»Ρ ΠΏΠΎΠ΄Π²Π΅ΡΠ³Π°ΡΡΡΡ ΡΠ»ΡΡΠ°ΠΉΠ½ΡΠΌ ΠΈΠ·ΠΌΠ΅Π½Π΅Π½ΠΈΡΠΌ ΠΈ Π·Π°ΡΡΠΌΠ»Π΅Π½ΠΈΡΠΌ. ΠΠ½Π°Π»ΠΈΠ· ΡΠ°ΠΊΠΈΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡ ΠΊ Π½Π΅ΠΎΠ±Ρ
ΠΎΠ΄ΠΈΠΌΠΎΡΡΠΈ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΏΠ»ΠΎΡΠ½ΠΎΡΡΠΈ ΠΌΠΎΡΠ½ΠΎΡΡΠΈ (Π‘ΠΠ). ΠΠ° ΠΏΡΠ°ΠΊΡΠΈΠΊΠ΅ Π΄Π»Ρ Π΅Ρ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ ΡΠΈΡΠΎΠΊΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΡΠ΅ΡΡΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄. ΠΡΠ½ΠΎΠ²Ρ ΡΠΈΡΡΠΎΠ²ΡΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ², ΡΠ΅Π°Π»ΠΈΠ·ΡΡΡΠΈΡ
ΡΡΠΎΡ ΠΌΠ΅ΡΠΎΠ΄, ΡΠΎΡΡΠ°Π²Π»ΡΠ΅Ρ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠ΅ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΠ΅ Π€ΡΡΡΠ΅. Π ΡΡΠΈΡ
Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°Ρ
ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠΈΡΡΠΎΠ²ΠΎΠ³ΠΎ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΡΠ²Π»ΡΡΡΡΡ ΠΌΠ°ΡΡΠΎΠ²ΡΠΌΠΈ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌΠΈ. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ Π²Π΅Π΄Π΅Ρ ΠΊ ΡΠ²Π΅Π»ΠΈΡΠ΅Π½ΠΈΡ ΡΠΈΡΠ»Π° ΡΡΠΈΡ
ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ. ΠΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΠΎΡΠ½ΠΎΡΡΡΡΡ ΠΊ Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΡΡΡΠ΄ΠΎΠ΅ΠΌΠΊΠΈΠΌ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌ. ΠΠ½ΠΈ ΡΠ²Π»ΡΡΡΡΡ Π΄ΠΎΠΌΠΈΠ½ΠΈΡΡΡΡΠΈΠΌ ΡΠ°ΠΊΡΠΎΡΠΎΠΌ ΠΏΡΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»Π΅Π½ΠΈΠΈ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΡ
Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΠ΅ΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΈ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΡΡ Π΅Π³ΠΎ ΠΌΡΠ»ΡΡΠΈΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ²Π½ΡΡ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΡ.
Π ΡΡΠ°ΡΡΠ΅ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΡΡΡ Π·Π°Π΄Π°ΡΠ° ΡΠ½ΠΈΠΆΠ΅Π½ΠΈΡ ΠΌΡΠ»ΡΡΠΈΠΏΠ»ΠΈΠΊΠ°ΡΠΈΠ²Π½ΠΎΠΉ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ Ρ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ΠΌ ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠ°Π΄Π°ΡΠ° ΡΠ΅ΡΠ°Π΅ΡΡΡ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ Π΄Π»Ρ ΠΏΡΠ΅ΠΎΠ±ΡΠ°Π·ΠΎΠ²Π°Π½ΠΈΡ ΡΠΈΠ³Π½Π°Π»Π° Π² ΡΠΈΡΡΠΎΠ²ΡΡ ΡΠΎΡΠΌΡ. Π’Π°ΠΊΠΎΠ΅ Π΄Π²ΡΡ
ΡΡΠΎΠ²Π½Π΅Π²ΠΎΠ΅ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠΈΠ³Π½Π°Π»ΠΎΠ² ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ΅ΡΡΡ Π±Π΅Π· ΡΠΈΡΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΏΠΎΠ³ΡΠ΅ΡΠ½ΠΎΡΡΠΈ. ΠΠ° ΠΎΡΠ½ΠΎΠ²Π΅ ΡΠ΅ΠΎΡΠΈΠΈ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ, ΡΠ΅Π·ΡΠ»ΡΡΠ°Ρ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ Π²ΠΎ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΡΡΡ ΠΊΠ°ΠΊ Ρ
ΡΠΎΠ½ΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠ°Ρ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΡ ΡΡΡΠ΅ΡΡΠ²Π΅Π½Π½ΡΡ
ΡΠΎΠ±ΡΡΠΈΠΉ, ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΠ΅ΠΌΡΡ
ΡΠΌΠ΅Π½ΠΎΠΉ Π΅Π³ΠΎ Π·Π½Π°ΡΠ΅Π½ΠΈΠΉ. ΠΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ Π΄Π»Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΠ° Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠΈΠ»ΠΎ Π°Π½Π°Π»ΠΈΡΠΈΡΠ΅ΡΠΊΠΎΠ΅ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΠΈΠ½ΡΠ΅Π³ΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠΈ ΠΏΠ΅ΡΠ΅Ρ
ΠΎΠ΄Π΅ ΠΎΡ Π°Π½Π°Π»ΠΎΠ³ΠΎΠ²ΠΎΠΉ ΡΠΎΡΠΌΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ ΠΊ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠΌ ΠΏΡΠΎΡΠ΅Π΄ΡΡΠ°ΠΌ Π΅Π΅ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ Π² Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠΌ Π²ΠΈΠ΄Π΅. ΠΡΠΈ ΠΏΡΠΎΡΠ΅Π΄ΡΡΡ ΡΡΠ°Π»ΠΈ ΠΎΡΠ½ΠΎΠ²ΠΎΠΉ Π΄Π»Ρ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠΈ ΡΠΈΡΡΠΎΠ²ΠΎΠ³ΠΎ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°. ΠΡΠ½ΠΎΠ²Π½ΡΠΌΠΈ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΠΌΠΈ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΡΠΌΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΡΠ²Π»ΡΡΡΡΡ Π°ΡΠΈΡΠΌΠ΅ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΈ ΡΠ»ΠΎΠΆΠ΅Π½ΠΈΡ ΠΈ Π²ΡΡΠΈΡΠ°Π½ΠΈΡ. Π£ΠΌΠ΅Π½ΡΡΠ΅Π½ΠΈΠ΅ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²Π° ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ ΡΠΌΠ½ΠΎΠΆΠ΅Π½ΠΈΡ ΡΠ½ΠΈΠΆΠ°Π΅Ρ ΠΎΠ±ΡΡΡ Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΡ ΡΡΡΠ΄ΠΎΠ΅ΠΌΠΊΠΎΡΡΡ ΠΎΡΠ΅Π½ΠΈΠ²Π°Π½ΠΈΡ Π‘ΠΠ. Π‘ ΡΠ΅Π»ΡΡ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΡΠ°Π±ΠΎΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° Π±ΡΠ»ΠΈ ΠΏΡΠΎΠ²Π΅Π΄Π΅Π½Ρ ΡΠΈΡΠ»Π΅Π½Π½ΡΠ΅ ΡΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΡ. ΠΠ½ΠΈ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΠ»ΠΈΡΡ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ ΠΈΠΌΠΈΡΠ°ΡΠΈΠΎΠ½Π½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎ-ΡΠΎΠ±ΡΡΠΈΠΉΠ½ΠΎΠΉ ΠΏΡΠΎΡΠ΅Π΄ΡΡΡ Π±ΠΈΠ½Π°ΡΠ½ΠΎ-Π·Π½Π°ΠΊΠΎΠ²ΠΎΠ³ΠΎ ΡΡΠΎΡ
Π°ΡΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΊΠ²Π°Π½ΡΠΎΠ²Π°Π½ΠΈΡ. Π ΠΊΠ°ΡΠ΅ΡΡΠ²Π΅ ΠΏΡΠΈΠΌΠ΅ΡΠ° ΠΏΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΎΡΠ΅Π½ΠΎΠΊ Π‘ΠΠ Ρ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ΠΌ ΡΡΠ΄Π° Π½Π°ΠΈΠ±ΠΎΠ»Π΅Π΅ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΡ
ΠΎΠΊΠΎΠ½Π½ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠΎΠ»ΡΡΠ΅Π½Π½ΡΠ΅ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΡΠ²ΠΈΠ΄Π΅ΡΠ΅Π»ΡΡΡΠ²ΡΡΡ, ΡΡΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠ°Π½Π½ΠΎΠ³ΠΎ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ Π²ΡΡΠΈΡΠ»ΡΡΡ ΠΏΠ΅ΡΠΈΠΎΠ΄ΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΡΠ΅ ΠΎΡΠ΅Π½ΠΊΠΈ Π‘ΠΠ Ρ Π²ΡΡΠΎΠΊΠΎΠΉ ΡΠΎΡΠ½ΠΎΡΡΡΡ ΠΈ ΡΠ°ΡΡΠΎΡΠ½ΡΠΌ ΡΠ°Π·ΡΠ΅ΡΠ΅Π½ΠΈΠ΅ΠΌ Π² ΡΡΠ»ΠΎΠ²ΠΈΡΡ
ΠΏΡΠΈΡΡΡΡΡΠ²ΠΈΡ Π°Π΄Π΄ΠΈΡΠΈΠ²Π½ΠΎΠ³ΠΎ Π±Π΅Π»ΠΎΠ³ΠΎ ΡΡΠΌΠ° ΠΏΡΠΈ Π½ΠΈΠ·ΠΊΠΎΠΌ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΠΈ ΡΠΈΠ³Π½Π°Π»/ΡΡΠΌ. ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠ°Ρ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ° ΠΎΡΡΡΠ΅ΡΡΠ²Π»Π΅Π½Π° Π² Π²ΠΈΠ΄Π΅ ΡΡΠ½ΠΊΡΠΈΠΎΠ½Π°Π»ΡΠ½ΠΎ ΡΠ°ΠΌΠΎΡΡΠΎΡΡΠ΅Π»ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΌΠΎΠ΄ΡΠ»Ρ. ΠΠ°Π½Π½ΡΠΉ ΠΌΠΎΠ΄ΡΠ»Ρ ΠΌΠΎΠΆΠ΅Ρ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°ΡΡΡΡ ΠΊΠ°ΠΊ ΠΎΡΠ΄Π΅Π»ΡΠ½ΡΠΉ ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½Ρ Π² ΡΠΎΡΡΠ°Π²Π΅ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΠΎΠ³ΠΎ ΠΌΠ΅ΡΡΠΎΠ»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈ Π·Π½Π°ΡΠΈΠΌΠΎΠ³ΠΎ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ½ΠΎΠ³ΠΎ ΠΎΠ±Π΅ΡΠΏΠ΅ΡΠ΅Π½ΠΈΡ Π΄Π»Ρ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠ²Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° ΡΠ°ΡΡΠΎΡΠ½ΠΎΠ³ΠΎ ΡΠΎΡΡΠ°Π²Π° ΡΠ»ΠΎΠΆΠ½ΡΡ
ΡΠΈΠ³Π½Π°Π»ΠΎΠ²
Double Asynchronous Switching Control for TakagiβSugeno Fuzzy Markov Jump Systems via Adaptive Event-Triggered Mechanism
This article addresses the issue of adaptive event- triggered Hβ control for Markov jump systems based on Takagi-Sugeno (T-S) fuzzy model. Firstly, a new double asynchronous switching controller is presented to deal with the problem of the mismatch of premise variables and modes between the controller and the plant, which is widespread in real network environment. To further reduce the power consumption of communication, a switching adaptive event-triggered mechanism is adopted to relieve the network transmission pressure while ensuring the control effect. In addition, a new Lyapunov-Krasovskii functional (LKF) is constructed to reduce conservatism by introducing the membership functions (MFs) and time-varying delays informa- tion. Meanwhile, the invariant set is estimated to ensure the stability of the system. And the disturbance rejection ability is measured by the optimal Hβ performance index. Finally, two examples are presented to demonstrate the effectiveness of the proposed approach
Closed-Loop Brain-Computer Interfaces for Memory Restoration Using Deep Brain Stimulation
The past two decades have witnessed the rapid growth of therapeutic brain-computer interfaces (BCI) targeting a diversity of brain dysfunctions. Among many neurosurgical procedures, deep brain stimulation (DBS) with neuromodulation technique has emerged as a fruitful treatment for neurodegenerative disorders such as epilepsy, Parkinson\u27s disease, post-traumatic amnesia, and Alzheimer\u27s disease, as well as neuropsychiatric disorders such as depression, obsessive-compulsive disorder, and schizophrenia. In parallel to the open-loop neuromodulation strategies for neuromotor disorders, recent investigations have demonstrated the superior performance of closed-loop neuromodulation systems for memory-relevant disorders due to the more sophisticated underlying brain circuitry during cognitive processes. Our efforts are focused on discovering unique neurophysiological patterns associated with episodic memories then applying control theoretical principles to achieve closed-loop neuromodulation of such memory-relevant oscillatory activity, especially, theta and gamma oscillations.
First, we use a unique dataset with intracranial electrodes inserted simultaneously into the hippocampus and seven cortical regions across 40 human subjects to test for the presence of a pattern that the phase of hippocampal theta oscillation modulates gamma oscillations in the cortex, termed cross-regional phase-amplitude coupling (xPAC), representing a key neurophysiological mechanism that promotes the temporal organization of interregional oscillatory activities, which has not previously been observed in human subjects. We then establish that the magnitude of xPAC predicts memory encoding success along with other properties of xPAC. We find that strong functional xPAC occurs principally between the hippocampus and other mesial temporal structures, namely entorhinal and parahippocampal cortices, and that xPAC is overall stronger for posterior hippocampal connections.
Next, we focus on hippocampal gamma power as a `biomarker\u27 and use a novel dataset in which open-loop DBS was applied to the posterior cingulate cortex (PCC) during the encoding of episodic memories. We evaluate the feasibility of modulating hippocampal power by a precise control of stimulation via a linear quadratic integral (LQI) controller based on autoregressive with exogenous input (ARX) modeling for in-vivo use. In the simulation framework, we demonstrate proposed BCI system achieves effective control of hippocampal gamma power in 15 out of 17 human subjects and we show our DBS pattern is physiologically safe with realistic time scales.
Last, we further develop the PCC-applied binary-noise (BN) DBS paradigm targeting the neuromodulation of both hippocampal theta and gamma oscillatory power in 12 human subjects. We utilize a novel nonlinear autoregressive with exogenous input neural network (NARXNN) as the plant paired with a proportionalβintegralβderivative (PID) controller (NARXNN-PID) for delivering a precise stimulation pattern to achieve desired oscillatory power level. Compared to a benchmark consisted of a linear state-space model (LSSM) with a PID controller, we not only demonstrate that the superior performance of our NARXNN plant model but also show the greater capacity of NARXNN-PID architecture in controlling both hippocampal theta and gamma power. We outline further experimentation to test our BCI system and compare our findings to emerging closed-loop neuromodulation strategies
Methoden und Beschreibungssprachen zur Modellierung und Verifikation vonSchaltungen und Systemen: MBMV 2015 - Tagungsband, Chemnitz, 03. - 04. MΓ€rz 2015
Der Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV 2015) findet nun schon zum 18. mal statt. Ausrichter sind in diesem Jahr die Professur Schaltkreis- und Systementwurf der Technischen UniversitΓ€t Chemnitz und das Steinbeis-Forschungszentrum Systementwurf und Test.
Der Workshop hat es sich zum Ziel gesetzt, neueste Trends, Ergebnisse und aktuelle Probleme auf dem Gebiet der Methoden zur Modellierung und Verifikation sowie der Beschreibungssprachen digitaler, analoger und Mixed-Signal-Schaltungen zu diskutieren. Er soll somit ein Forum zum Ideenaustausch sein.
Weiterhin bietet der Workshop eine Plattform fΓΌr den Austausch zwischen Forschung und Industrie sowie zur Pflege bestehender und zur KnΓΌpfung neuer Kontakte. Jungen Wissenschaftlern erlaubt er, ihre Ideen und AnsΓ€tze einem breiten Publikum aus Wissenschaft und Wirtschaft zu prΓ€sentieren und im Rahmen der Veranstaltung auch fundiert zu diskutieren. Sein langjΓ€hriges Bestehen hat ihn zu einer festen GrΓΆΓe in vielen Veranstaltungskalendern gemacht. Traditionell sind auch die Treffen der ITGFachgruppen an den Workshop angegliedert.
In diesem Jahr nutzen zwei im Rahmen der InnoProfile-Transfer-Initiative durch das Bundesministerium fΓΌr Bildung und Forschung gefΓΆrderte Projekte den Workshop, um in zwei eigenen Tracks ihre Forschungsergebnisse einem breiten Publikum zu prΓ€sentieren. Vertreter der Projekte Generische Plattform fΓΌr SystemzuverlΓ€ssigkeit und Verifikation (GPZV) und GINKO - Generische Infrastruktur zur nahtlosen energetischen Kopplung von Elektrofahrzeugen stellen Teile ihrer gegenwΓ€rtigen Arbeiten vor. Dies bereichert denWorkshop durch zusΓ€tzliche Themenschwerpunkte und bietet eine wertvolle ErgΓ€nzung zu den BeitrΓ€gen der Autoren. [... aus dem Vorwort
- β¦