@article{oai:ous.repo.nii.ac.jp:00001161,
 author = {入江, 浩一 and Irie, Koichi},
 journal = {岡山理科大学紀要. A, 自然科学, Bulletin of Okayama University of Science. A, Natural Sciences},
 month = {Mar},
 note = {P(論文), The FFT algorithm is usually used for computing actual DFT problems because of its extremely fast computing function. However, some DFT applications do not require to get all DFT components. An example is calcuation of Fourier Transform by means of DFT, where, in addition, a great serial part of discrete time data sampled from a given waveform is occupied with zero. By utilizing these two features the time required for calculation with basic DFT is much reduced to a measure comparable with that of the FFT. With rectangular, triangular, cosine and squared-cosine waveform, calculation time in connection with numerical accuracy obtained are shown of the proposed method, and are compared with those of the FFT.},
 pages = {285--292},
 title = {離散フーリエ変換によるフーリエ変換の計算 : 計算時間に関する一検討},
 volume = {31},
 year = {1996},
 yomi = {イリエ, コウイチ}
}