A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs

From MaRDI portal

Revision as of 14:11, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4590311

Jump to:navigation, search

DOI10.1109/TCSI.2004.834508zbMath1388.65187MaRDI QIDQ4590311

M. Omair Ahmad, M. N. S. Swamy, Saad Bouguezel

Publication date: 20 November 2017

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Fast Fourier transform using matrix decomposition ⋮ Fast computation of the discrete Hartley transform ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform

This page was built for publication: A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4590311&oldid=18747868"