26 July 2000 DFT beamforming algorithms for space-time-frequency applications
Author Affiliations +
Abstract
This work presents modified variants, in a recursive format, of the Kahaner's additive fast Fourier transform algorithm. The variants are presented in Kronecker products algebra language. The language serves as a tool for the analysis, design, modification and implementation of the FFT variants on re-configurable field programmable gate array computational structures. The target for these computational structures are discrete Fourier transform beamforming algorithms for space-time-frequency applications in wireless.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Domingo Rodriguez, Marlene Vargas Solleiro, Yvonne Aviles, "DFT beamforming algorithms for space-time-frequency applications", Proc. SPIE 4045, Digital Wireless Communication II, (26 July 2000); doi: 10.1117/12.394082; https://doi.org/10.1117/12.394082
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top