The authors indicate an apparently novel method for computing an inverse discrete Fourier transform (IDFT) through the use of a forward DFT program. They point out that, in many cases, this is obtained without any additional cost, either in terms of program length or in terms of computational time
%0 Journal Article
%1 duhamel88
%A Duhamel, P.
%A Piron, B.
%A Etcheto, J.M.
%D 1988
%J Acoustics, Speech and Signal Processing, IEEE Transactions on
%K dft fourier linear.algebra matrix
%N 2
%P 285-286
%R 10.1109/29.1519
%T On Computing the Inverse DFT
%V 36
%X The authors indicate an apparently novel method for computing an inverse discrete Fourier transform (IDFT) through the use of a forward DFT program. They point out that, in many cases, this is obtained without any additional cost, either in terms of program length or in terms of computational time
@article{duhamel88,
abstract = {The authors indicate an apparently novel method for computing an inverse discrete Fourier transform (IDFT) through the use of a forward DFT program. They point out that, in many cases, this is obtained without any additional cost, either in terms of program length or in terms of computational time},
added-at = {2015-09-03T05:42:03.000+0200},
author = {Duhamel, P. and Piron, B. and Etcheto, J.M.},
biburl = {https://www.bibsonomy.org/bibtex/2caa0b80ef55edd8e17c187105015038c/ytyoun},
doi = {10.1109/29.1519},
interhash = {ca3d5c7c9b98b2628ce730ca98051cc9},
intrahash = {caa0b80ef55edd8e17c187105015038c},
issn = {0096-3518},
journal = {Acoustics, Speech and Signal Processing, IEEE Transactions on},
keywords = {dft fourier linear.algebra matrix},
month = feb,
number = 2,
pages = {285-286},
timestamp = {2015-11-21T14:33:42.000+0100},
title = {On Computing the Inverse {DFT}},
volume = 36,
year = 1988
}