On computation of certain discrete Fourier transforms using binary calculus

DOI10.1016/0165-1684(94)00146-QzbMath0874.65105MaRDI QIDQ674150

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

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

Related Items (1)

Discrete Fourier transform computation using prime Ramanujan numbers

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