Recursive Fourier transform using convolutions (Q751227)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursive Fourier transform using convolutions |
scientific article; zbMATH DE number 4176411
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive Fourier transform using convolutions |
scientific article; zbMATH DE number 4176411 |
Statements
Recursive Fourier transform using convolutions (English)
0 references
1989
0 references
This paper provides a fast algorithm of the discrete Fourier transform (DFT) of a signal in terms of the DFT of its fragments. The author informs us about a way of good partition of the DFT matrix on 2N samples, reducing the DFT to convolutions. The computation can be recursively performed by known fast algorithms.
0 references
partition of matrix
0 references
recursive implementation
0 references
fast algorithm
0 references
discrete Fourier transform
0 references
DFT matrix
0 references
convolutions
0 references
