Abstract
The method for fast finding the values of arithmetic autocorrelation function (ACF) using Walsh transform was investigated. Random process with the constant component presence in the sinusoidal signal form with Gaussian noise was modeled. For this process arithmetic ACF are found based on matrix transformations of logical ACF. Comparison of the arithmetic ACF performing complexity, using the fast Fourier transform and Walsh transform was conducted. References 5, figures 2.
References
Vlasenko V.A., Lappa Yu.M., Yaroslavskii L.P. The methods for the fast convolution algorithms synthesis and signals spectral analysis. – Moskva: Nauka, 1990. – 180 p. (Rus)
Dmitriev E.A., Malakhov V.P. Application of Walsh transform processing system diagnostic information about the rotary machines // Pratsi Odeskoho Politekhnichnoho Universytetu. – 2001. – Vol. 1. – Pp. 135–137. (Rus)
Maks G. Methods and techniques of signal processing physical measurements. – Moskva: Mir, 1983. – 568 p. (Rus)
Tereshchenko T., Lazariev D. The Definition of Cyclic Convolution Based on Radix-m Argument Spectral Transform // Electronics and Nanotechnology. Proceeding of the XXXII International Scientific Conference ELNANO 2012. – April 10–12, 2012. – Pp. 92–93.
Chegolin L.M. Matrix telecom operators arithmetic and logical correlation function // Vychislitelnaia Tekhnika v Mashinostroenii. – December, 1973. – Pp. 129–137. (Rus)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Copyright (c) 2023 Array