Kronecker-FFT Algorithms for Multidimensional SAR PSF Processing

Abstract

This work presents new variants of FFT algorithms (not necessarily power of two lengths), in a computational Kronecker-core array algebra setting, tailored to the efficient point spread function (PSF) processing in multidimensional synthetic aperture radar (SAR) systems. The tailoring of the algorithms is performed through a targeted study of group theoretic properties of input/output data indexing sets and associated groups of stride permutations. The advantage of these new FFT variants over conventional formulations is that additive group theoretic properties of multidimensional input/output indexing sets are used for their mathematical formulations, establishing mapping identifications between computing structures and mathematical expressions identified as factored compositions of functional primitives, reducing in this manner their computational complexity and improving their implementation performance.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 30, 2004
Accession Number
ADA433254

Entities

People

  • Domingo Rodriguez

Organizations

  • University of Puerto Rico at Mayaguez

Tags

Communities of Interest

  • Sensors

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Detection
  • Detectors
  • Embedded Systems
  • Information Operations
  • Instructions
  • Linear Arrays
  • Mathematics
  • Puerto Rico
  • Signal Detection
  • Simulations
  • Synthetic Aperture Radar
  • United States
  • Universities

Fields of Study

  • Engineering

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Mathematical Modeling and Probability Theory.
  • Radar Systems Engineering.