Key points are not available for this paper at this time.
The paper is devoted to the development of methods and algorithms for fast discrete Fourier transform of discrete finite signals in real time. The paper considers the case when the duration of discrete finite signals is not a power of two. The drawbacks of an efficient FFT algorithm on base 2 are analyzed, and ways of solving the problems arising in practice are suggested. The generalization of the unitary Fourier transform in the form of new unitary Fourier transforms - parametric discrete Fourier transforms - is briefly considered. The block structure of the basis system of the discrete Fourier transform with the purpose of realtime realization is investigated. The efficiency of the developed method and fast discrete Fourier transform of discrete finite signals in real time is evaluated.
Building similarity graph...
Analyzing shared references across papers
Loading...
Ponomarev et al. (Wed,) studied this question.
synapsesocial.com/papers/68e72200b6db64358769bb5f — DOI: https://doi.org/10.1109/dspa60853.2024.10510069
A. V. Ponomarev
Izhevsk State Technical University
О. В. Пономарева
Izhevsk State Technical University
Izhevsk State Technical University
Building similarity graph...
Analyzing shared references across papers
Loading...