Couscous-constant approximation in signal filtration task
نویسندگان
چکیده
The paper considers the task of assessing state a nonlinear dynamic system, based on couscous-linear approximation non-linear functions included in and observa-tion equation. Examples method presented filtration tasks are given it is shown that use allows at least half margin sampling error by Kalman-Busey filter compared to first-order approximation. Dynamic systems processing algorithms form vector-matrix equations have been obtained for multidi-mensional systems.
منابع مشابه
Radar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملsignal specific successive approximation analog to digital converter
چکیده: در میان انواع متفاوتی از مبدل های آنالوگ به دیجیتال که تا کنون معرفی شده اند، مبدل های آنالوگ به دیجیتال تقاریب متوالی(sar ) به علت سادگی ساختار و همچنین توان مصرفی کم، همواره یکی از پرکاربرد ترین مبدل های آنالوگ به دیحیتال در کاربرد های بایومدیکال بوده اند. به همین دلیل تاکنون روش های متعددی برای کاهش هرچه بیشتر توان مصرفی در این مبدل ها ارائه شده است که در اکثر آنها توجهی به مشخصات سی...
15 صفحه اولOn Diophantine Approximation below the Lagrange Constant
We define A(a) by X{a) = Mq>0q\\aq\\. Given a, two natural and fundamental problems are to compute X(a) and, for a given c, A (a) < c < //(#), t 0 explicitly determine the complete set of solutions to (1.1). In a series of three papers ([8], [9], [10]), Winley, Tognetti, and Van Ravenstein address these problems for the case in which a equals a generalized golden ratio <pa, that is, a W a 2 + 4...
متن کاملA Constant Approximation Algorithm for Sorting Buffers
We consider an algorithmic problem that arises in manufacturing applications. The input is a sequence of objects of various types. The scheduler is fed the objects in the sequence one by one, and is equipped with a finite buffer. The goal of the scheduler/sorter is to maximally reduce the number of type transitions. We give the first polynomial-time constant approximation algorithm for this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ???????????? ???????????? ? ?????????????? ????????????
سال: 2021
ISSN: ['2307-1400']
DOI: https://doi.org/10.37468/2307-1400-2021-1-34-43