Treffer: АЛГОРИТМІЧНІ ОСНОВИ МОДУЛЬНОЇ АРИФМЕТИКИ ВИЗНАЧЕННЯ ВИБІРКОВОГО МАТЕМАТИЧНОГО СПОДІВАННЯ.

The mathematical foundations and algorithms for determining the sample expectation of stationary random processes are investigated. The functional limitations of the algorithms for determining the sample expectation in binary arithmetic of the Rademacher number-theoretic basis are substantiated. The low speed of determining the sample expectation in the Rademacher number-theoretic basis codes is due to the presence of end-to-end transfers when performing operations for accumulating the sums of the input digitized data of the random process. Lattice models and graphs of rank sum formation during the streaming accumulation of digital data on the sampling interval of a random process are presented. The theoretical foundations for algorithms determining the sample expectation in a non-positional number system of the Haar-Crestenson number-theoretic basis of residues are developed.. Recommendations for choosing Haar-Crestenson code modules that correspond to four-bit codes of the Rademacher basis and eight-bit codes of RGB pixels of color images are provided. The results of the study allow expanding the functionality and increasing the speed of statistical data processing at the lower levels of interactive distributed computer systems. [ABSTRACT FROM AUTHOR]

Copyright of Cybernetics & Systems Analysis / Kibernetiki i Sistemnyj Analiz is the property of V.M. Glushkov Institute of Cybernetics of NAS of Ukraine and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)