Share Email Print
cover

Proceedings Paper

DFT beamforming algorithms for space-time-frequency applications
Author(s): Domingo Rodriguez; Marlene Vargas Solleiro; Yvonne Aviles
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 26 July 2000
PDF: 8 pages
Proc. SPIE 4045, Digital Wireless Communication II, (26 July 2000); doi: 10.1117/12.394082
Show Author Affiliations
Domingo Rodriguez, Univ. of Puerto Rico/Mayaguez (United States)
Marlene Vargas Solleiro, Univ. of Puerto Rico/Mayaguez (United States)
Yvonne Aviles, Univ. of Puerto Rico/Mayaguez (United States)


Published in SPIE Proceedings Vol. 4045:
Digital Wireless Communication II
Raghuveer M. Rao; Soheil A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top