Fast Radix-32 Approximate DFTs for 1024-Beam Digital RF Beamforming
A. Madanayake, R. J. Cintra, N. Akram, V. Ariyarathna, S. Mandal, V., A. Coutinho, F. M. Bayer, D. Coelho, T. S. Rappaport

TL;DR
This paper introduces three new approximate DFT algorithms tailored for 1024-point digital RF beamforming, significantly reducing hardware complexity and power consumption with minimal impact on signal quality, suitable for future large-scale antenna systems.
Contribution
The paper presents novel hybrid approximate DFT algorithms for 1024-point transforms, optimized for RF beamforming, with efficient hardware implementations and performance comparable to exact FFTs.
Findings
Up to 48.5% reduction in chip area
Up to 66.0% reduction in power consumption
SNR loss of ≤0.9 dB compared to exact DFTs
Abstract
The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption, processing time, and consumption of other hardware resources. This paper proposes three new hybrid DFT 1024-point DFT approximations and their respective fast algorithms. These approximate DFT (ADFT) algorithms have significantly reduced circuit complexity and power consumption compared to traditional FFT approaches while trading off a subtle loss in computational precision which is acceptable for digital beamforming applications in RF antenna implementations. ADFT algorithms have not been introduced for beamforming beyond , but this paper anticipates the need for massively large adaptive arrays for future 5G and 6G systems. Digital CMOS circuit…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
