Pages that link to "Item:Q1060552"
From MaRDI portal
The following pages link to The multiplicative complexity of the discrete Fourier transform (Q1060552):
Displaying 12 items.
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- On the real complexity of a complex DFT (Q1752320) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Multiplicative characters and the discrete Fourier transform (Q1819920) (← links)
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811) (← links)
- Multiplicative complexity of length-2<sup>m</sup>two-dimensional discrete cosine transform (Q3985183) (← links)
- On the multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
- (Q4040743) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Composite Cyclotomic Fourier Transforms With Reduced Complexities (Q4572922) (← links)
- (Q4864906) (← links)