By Topic

Improved implementation of FFT algorithm on a high-performance processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Said, S.M. ; University of Kent at Canterbury, Electronics Laboratories, Canterbury, UK ; Dimond, K.R.

The letter demonstrates an FFT algorithm implemented on the 68000 microprocessor that can calculate a 256-point transform in less than 48 ms. The algorithm employs an interesting method of scaling data to overcome overflow.

Published in:

Electronics Letters  (Volume:20 ,  Issue: 8 )