Multi-beam 8×8 RF aperture digital beamformers using multiplierless 2-D FFT approximations

摘要: The two-dimensional (2-D) discrete Fourier transform (DFT) is widely used in digital signal processing (DSP) and computing applications. Fast transforms (FFTs) are as low-complexity algorithms for the computation of DFT it reduces required operations from O(N2) to O(N log 2 N). multiplicative complexity a benchmark comparing different affects circuit complexity, chip area power. This paper introduces new class multiplierless hardware algorithm consisting only arithmetic adder circuits that closely approximates 2-D version 8-point DFT. discusses theory behind proposed algorithm, with presented form an 8 × matrix. Furthermore provide multi-beam RF aperture application example where approximation has been obtain antenna array patterns.