Rapid prototyping of update algorithm of discrete Fourier transform for real-time signal processing

Yogendra P. Kakad; Barry G. Sherlock; Krishnan V. Chatapuram; Stephen Bishop

doi:10.1117/12.445399

22 October 2001 Rapid prototyping of update algorithm of discrete Fourier transform for real-time signal processing

Yogendra P. Kakad, Barry G. Sherlock, Krishnan V. Chatapuram, Stephen Bishop

Proceedings Volume 4379, Automatic Target Recognition XI; (2001) https://doi.org/10.1117/12.445399
Event: Aerospace/Defense Sensing, Simulation, and Controls, 2001, Orlando, FL, United States

Abstract

An algorithm is developed in the companion paper, to update the existing DFT to represent the new data series that results when a new signal point is received. Updating the DFT in this way uses less computation than directly evaluating the DFT using the FFT algorithm, This reduces the computational order by a factor of log2 N. The algorithm is able to work in the presence of data window function, for use with rectangular window, the split triangular, Hanning, Hamming, and Blackman windows. In this paper, a hardware implementation of this algorithm, using FPGA technology, is outlined. Unlike traditional fully customized VLSI circuits, FPGAs represent a technical break through in the corresponding industry. The FPGA implements thousands of gates of logic in a single IC chip and it can be programmed by users at their site in a few seconds or less depending on the type of device used. The risk is low and the development time is short. The advantages have made FPGAs very popular for rapid prototyping of algorithms in the area of digital communication, digital signal processing, and image processing. Our paper addresses the related issues of implementation using hardware descriptive language in the development of the design and the subsequent downloading on the programmable hardware chip.

Citation Download Citation

Yogendra P. Kakad, Barry G. Sherlock, Krishnan V. Chatapuram, and Stephen Bishop "Rapid prototyping of update algorithm of discrete Fourier transform for real-time signal processing", Proc. SPIE 4379, Automatic Target Recognition XI, (22 October 2001); https://doi.org/10.1117/12.445399

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

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Field programmable gate arrays

Signal processing

Fourier transforms

Rapid manufacturing

Algorithm development

Clocks

Logic

Show All Keywords

Keywords/Phrases

Search In:

Publication Years