The problems of synthesis of the efficient algorithms for digital processing of discrete signals require transforming the signal spectra from one basis system into other. The rational solution to this problem is to construct the Fourier kernel, which is a spectrum of some basis functions, according to the system of functions of the other basis. However, Fourier kernel properties are not equally studied and described for all basis systems of practical importance. The article sets a task and presents an original way to solve the problem of mutual transformation of trigonometric Fourier spectrum into Walsh spectrum of different basis systems.

The relevance of this theoretical and applied problem is stipulated, on the one hand, by the prevalence of trigonometric Fourier basis for harmonic representation of digital signals, and, on the other hand, by the fact that Walsh basis systems allow us to have efficient algorithms to simulate signals. The problem solution is achieved through building the Fourier kernel of a special structure that allows us to establish independent groups of Fourier and Walsh spectrum coefficients for further reducing the computational complexity of the transform algorithms.

The article analyzes the properties of the system of trigonometric Fourier functions and shows its completeness. Considers the Walsh function basis systems in three versions, namely those of Hadamard, Paley, and Hartmut giving different ordering and analytical descriptions of the functions that make up the basis. Proves a completeness of these systems.

Sequentially, for each of the three Walsh systems the analytical curves for the Fourier kernel components are obtained, and Fourier kernel themselves are built with binary rational number of samples of basis functions. The kernels are presented in matrix form and, as an example, recorded for a particular value of the discrete interval of N, equal to 8. The analysis spectral coefficients of the Fourier kernel components, allowed us to combine the nonzero coefficients in independent groups in each of the three cases of transformations. The original rules for group formation are formulated both for particular value of N, and in general terms.

The formation rules of groups, group-by-group and common Parseval equalities were used to obtain descriptions of algorithms for mutual transformation of trigonometric Fourier spectrum into Hadamard, Paley and Hartmut spectra. An analytical record of these algorithms enables speaking of the Fourier kernels as of the new operators of spectra transformation. The computational complexity evaluation of operators showed the effectiveness of their use owing to more than three times reduction of the number of arithmetic operations as compared to the conventional method, i.e. direct calculation of the Walsh spectra. Because of this property the proposed operators become useful when solving the tasks of real-time discrete systems modeling.

In the long run, there is a plan to solve a similar task for the mutual transformation of Walsh and Hartley spectra: both a Hartley basis system and a trigonometric system reflect the frequency structure of the signal that serves a useful purpose in terms of theory and practice.