Accession Number:

AD1038266

Title:

Multi-Beam Radio Frequency (RF) Aperture Arrays Using Multiplierless Approximate Fast Fourier Transform (FFT)

Corporate Author:

University of Akron Akron United States

Report Date:

2017-08-01

Abstract:

Fast Fourier transforms FFTs are fast algorithms for the computation of the discrete Fourier transform DFT with low computational complexity. FFT owes its popularity to the fact that the parent algorithm the DFT is of critical importance in a wide range of applications, such as wireless communications, data networks, sensor networks, cognitive radio, radar and beamforming, imaging, filtering, correlation and radio-astronomy. In this report approximate transforms that closely follow the DFT have been studied and found. The approximate-DFT a-DFT transforms are derived to have acceptable performance in terms of achieving spatial multi-beams.

Descriptive Note:

Technical Report,17 Mar 2016,17 Mar 2017

Pages:

0160

Communities Of Interest:

Modernization Areas:

Distribution Statement:

Approved For Public Release;

Contract Number:

FA8650-16-1-7610

File Size:

10.97MB