DFT beamforming algorithms for space-time-frequency applications

Domingo Rodriguez; Marlene Vargas Solleiro; Yvonne Aviles

doi:10.1117/12.394082

26 July 2000 DFT beamforming algorithms for space-time-frequency applications

Domingo Rodriguez, Marlene Vargas Solleiro, Yvonne Aviles

Proceedings Volume 4045, Digital Wireless Communication II; (2000) https://doi.org/10.1117/12.394082
Event: AeroSense 2000, 2000, Orlando, FL, United States

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.

Citation Download Citation

Domingo Rodriguez, Marlene Vargas Solleiro, and Yvonne Aviles "DFT beamforming algorithms for space-time-frequency applications", Proc. SPIE 4045, Digital Wireless Communication II, (26 July 2000); https://doi.org/10.1117/12.394082

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available