On the real complexity of a complex DFT

DOI10.1134/S0032946017030103MaRDI QIDQ1752320

Igor S. Sergeev

Publication date: 24 May 2018

Published in: Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On the multiplicative complexity of the discrete Fourier transform
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• Generating and Searching Families of FFT Algorithms
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: On the real complexity of a complex DFT