Structures for evaluating the discrete Fourier transform on staggered blocks
暂无分享,去创建一个
In this work three structures are presented for evaluating in real time the discrete Fourier transform (DFT) on successive sections of a sampled signal. Each section consists of<tex>N</tex>elements and two successive sections are staggered of<tex>M \leq N</tex>elements. Each structure evaluates<tex>N/M</tex>DFT coefficients at every step and requires about<tex>(N/(2M)) \log_{2} 4M</tex>multipliers.
[1] G. O'Leary. Nonrecursive digital filtering using cascade fast Fourier transformers , 1970 .
[2] T. Bially,et al. Parallelism in fast Fourier transform hardware , 1973 .
[3] G. Bongiovanni,et al. Procedures for computing the discrete Fourier transform on staggered blocks , 1976 .