Fast computation of real discrete Fourier transform for any number of data points (Q3986791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 29419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast computation of real discrete Fourier transform for any number of data points |
scientific article; zbMATH DE number 29419 |
Statements
Fast computation of real discrete Fourier transform for any number of data points (English)
0 references
27 June 1992
0 references
discrete cosine transform
0 references
discrete sine transform
0 references
fast algorithms
0 references
matrix factorization
0 references
real discrete Fourier transform
0 references
real Fourier coefficients
0 references
image coding
0 references
image enhancement
0 references
nonlinear matched filtering
0 references
artificial neural networks
0 references
Kronecker-product
0 references
0.92099345
0 references
0 references
0 references
0.8883219
0 references
0.8858309
0 references
0.8853419
0 references
0.88435614
0 references
0.88357264
0 references
The real discrete Fourier transform (RDFT) corresponds to a discretization of the real Fourier coefficients. The RDFT has found various recent applications, such as in image coding, image enhancement, nonlinear matched filtering and artificial neural networks. A fast RDFT-algorithm corresponds to the factorization of the RDFT-matrix into a product of sparse matrices, expressed in the Kronecker-product formalism. Algorithms of the RDFT with arbitrary length \(N\) (not only with radix-2 length) are developed in this paper. Especially, the cases \(N\) is of the shape \(pq\), \(pqr\) or \(p^ t\) are considered. The computation of the inverse RDFT can be carried out by the same fast RDFT- algorithm.
0 references
