A new proposed algorithm of arbitrary radix for the computation of the 2D DFT

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0207(19990910)46:1<103::AID-NME666>3.0.CO;2-F" /><103::AID-NME666>3.0.CO;2-F 10.1002/(SICI)1097-0207(19990910)46:1<103::AID-NME666>3.0.CO;2-FzbMath0943.65161OpenAlexW2019340041MaRDI QIDQ4935718

Ammar Khellaf, Djamel Chikouche, Saad Bouguezel

Publication date: 31 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0207(19990910)46:1<103::aid-nme666>3.0.co;2-f

zbMATH Keywords

arithmetical complexityindex mappingtwo-dimensional fast Fourier transformdecimation-in-time algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

This page was built for publication: A new proposed algorithm of arbitrary radix for the computation of the 2D DFT