One-dimensional and two-dimensional generalised discrete fourier transforms
暂无分享,去创建一个
One-dimensional and two-dimensional generalized discrete Fourier transforms (GFT) are introduced. If a one-dimensional vector A is fractured into a two-dimensional matrix B, a one-dimensional GFT on A and a two-dimensional GFT on B give the same result and require the same number of operations to be computed. The result holds also for the DFT, as it is a particular case of the GFT.
[1] T. Bially,et al. Parallelism in fast Fourier transform hardware , 1973 .
[2] B. Arazi. Two-dimensional digital processing of one-dimensional signal , 1974 .