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, Domingo Rodriguez, Marlene Vargas Solleiro, Marlene Vargas Solleiro, Yvonne Aviles, 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

Target track system design based on circular projection
Proceedings of SPIE (January 19 2006)
Fast CSAR algorithm
Proceedings of SPIE (April 14 2008)
An efficient decoding for low density parity check codes
Proceedings of SPIE (April 02 2010)
Independent component analysis for audio signal separation
Proceedings of SPIE (October 24 2005)
Recursive ULV decomposition
Proceedings of SPIE (November 12 2000)

Back to Top