A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677)
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 4035097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A self-sorting in-place prime factor real/half-complex FFT algorithm |
scientific article; zbMATH DE number 4035097 |
Statements
A self-sorting in-place prime factor real/half-complex FFT algorithm (English)
0 references
1988
0 references
This algorithm performs the fast Fourier transform in-place and without pre- or post-reordering for a real or half-complex (conjugate-symmetric) input data. Emphasis is placed on reducing the necessary numbers of additions and multiplications for computation by decomposition of the length of the transform into mutually prime factors.
0 references
self-sorting
0 references
half-complex data
0 references
fast Fourier transform
0 references
decomposition
0 references
0.8742982149124146
0 references
0.8303853273391724
0 references
0.829991340637207
0 references
0.8278492093086243
0 references
0.8261941075325012
0 references
