Algorithm for Optimal Processing of Information Parameters

The article deals with the applied aspects of digital processing of information parameters related to the implementation of the fast discrete Fourier transform (FFT) algorithm. The algorithm uses decimation of the input data samples by time. Depending on the volume and complexity of calculations, four- and eight-point sequences are formed. The use of built-in FFT algorithms for spectral analysis does not allow removing distortions associated with the presence of parasitic components in the information signal spectrum. To eliminate errors when allocating information components, an adaptive FFT algorithm is proposed, which implements decimation of input data samples by time without built-in functions. Changing the point structure reduces computations and improves system responsiveness. To increase the noise immunity of the information channel, the code is checked for parity. To reduce the vulnerability of the information channel, the transmitted code pattern is summed modulo two with the M-sequence of maximum length. Digital filtering of information parameters uses Hamming smoothing windows.