Abstract
An approach based on uniform Markov chains is proposed for estimating the efficiency of a class of window compression-rejection algorithms. The approach makes it possible to calculate windows and to obtain detailed information on the operation of these algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. A. Levchenko, Metrologiya, No. 1, 12 (1991).
A. F. Fomin, O. N. Novoselov, and A. V. Plyushchev, Elimination of Anomalous Results of Measurements [in Russian], énergoatomizdat, Moscow (1985).
A. I. Beklemishchev et al., Prib. Sist. Upravl. [Control Instruments and Systems], No. 2, 19 (1988).
S. V. Baidikov et al., Avtometriya, No. 6, 88 (1990).
E. S. Venttsel' and L. A. Ovcharov, Theory of Random Processes and Its Applications in Engineering [in Russian], Nauka, Moscow (1991).
G. Box and G. Jenkins, Time Series Analysis. Forecasting and Control [Russian translation], Mir, Moscow (1973).
A. S. Golubkov and V. P. Korotaev, Metrologiya, No. 2, 14 (1973).
E. I. Krinetskii et al., Principles of Aircraft Testing [in Russian], Mashinostroenie, Moscow (1989).
N. G. Chernoguz, Avtometriya, No. 3, 19 (1983).
Additional information
Translated from Izmeritel'naya Tekhnika, No. 10, pp. 12–17, October, 1993.
Rights and permissions
About this article
Cite this article
Levchenko, M.A. Design of compression window algorithms for elimination of errors. Meas Tech 36, 1083–1092 (1993). https://doi.org/10.1007/BF00979449
Issue Date:
DOI: https://doi.org/10.1007/BF00979449