On computation of certain discrete Fourier transforms using binary calculus

DOI10.1016/0165-1684(94)00146-QMaRDI QIDQ674150zbMATH OpenFDO

Authors Nirdosh Bhatnagar

Publication date 28 February 1997

Published in Signal Processing (Search for Journal in Brave)

zbMATH Keywords

computational complexityparallel computationdiscrete Fourier transformBinary calculusRamanujan numbers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4050931
• On computing the discrete Fourier and cosine transforms
• scientific article; zbMATH DE number 1180015
• Binary Discrete Fourier Transform and Its Inversion
• On the computational complexity of the general discrete Fourier transform
• On computation of the discrete \(W\) transform
• Approximate calculation of ordinary Fourier transform by means of the discrete one
• scientific article; zbMATH DE number 3915602
• scientific article; zbMATH DE number 55187
• On recursive discrete Fourier transformation

Cited in

(6)

• Discrete Fourier transform computation using prime Ramanujan numbers
• A low-complexity approach to computation of the discrete fractional Fourier transform
• The best formulae for the approximate computation of discrete Fourier transforms
• scientific article; zbMATH DE number 4129404 (Why is no real title available?)
• scientific article; zbMATH DE number 55187 (Why is no real title available?)
• Fast discrete Fourier transform computations using the reduced adder graph technique

This page was built for publication: On computation of certain discrete Fourier transforms using binary calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674150)