Abstract :
Hardware Fourier transformations are considered with the goal of increasing speed through parallel operation. Two designs in which the basic element is a fast counter are developed. One is applicable when the number of transformed points N is prime while the other, requiring somewhat more hardware, is applicable to all N.
Keywords :
Fast Fourier transformation for batches of arbitrary size, hardware Fourier transformation, high-precision Fourier transformation, relation of Fourier transformation to Hankel matrices, sign flipping in radix (−2), speedup through parallel computation.; Algorithm design and analysis; Concurrent computing; Costs; Counting circuits; Discrete Fourier transforms; Fast Fourier transforms; Hardware; Libraries; Propulsion; Space technology; Fast Fourier transformation for batches of arbitrary size, hardware Fourier transformation, high-precision Fourier transformation, relation of Fourier transformation to Hankel matrices, sign flipping in radix (−2), speedup through parallel computation.;
