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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2017
Accession Number
AD1038266

Entities

People

  • Arjuna Madanayake
  • Diego Coelho
  • Najath Akram
  • Renato J. Cintra
  • Viduneth Ariyarathna

Organizations

  • University of Akron

Tags

Communities of Interest

  • Advanced Electronics
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Astronomy
  • Complementary Metal-Oxide Semiconductors
  • Computational Complexity
  • Detectors
  • Digital Signal Processing
  • Discrete Fourier Transforms
  • Electronically Scanned Array
  • Fast Fourier Transforms
  • Frequency
  • Radar
  • Radio Frequency
  • Sensor Networks
  • Signal Processing
  • Very Large Scale Integration

Fields of Study

  • Engineering

Readers

  • Approximation Theory.
  • Computer Networking
  • Phased Array Antenna Design.