Application of Binary Inversion in Implementation of Adaptive Fast Fourier Transform Algorithm

The article deals with the applied aspects of digital processing of information parameters related to the fast Fourier transform algorithm (FFT) implementation. The algorithm performs continuous processing of information parameters. To find complex values of the phase factor, the binary inversion method is used, numerical sequences are calculated in bit-backward order. To form nested blocks with a small number of points, the algorithm provides for the decomposition of the sequence into coprime factors. Cryptographic protection is achieved by sum modulo two of the transmitted numerical sequence with a floating M-sequence of maximum length. To protect against errors, the method of many times repeated code combinations is used. The spreading effect is reduced by weighting using the Hamming window function. To simulate input data the Wolfram Mathematica computer environment is used. The program code is written in $\mathrm{C}++$.