A Performance Study of 16-bit Microcomputer-Implemented FFT Algorithms

An FFT algorithm operating on a 16-bit microcomputer can calculate a 256-point transform as much as 10 times faster than a similar algorithm on an eight-bit microcomputer.

Saved in:
Bibliographic Details
Published in:IEEE MICRO 1982-11, Vol.2 (4), p.61-66
Main Authors: Stigall, P. D., Ziemer, R. E., Hudec, L.
Format: Article
Language:English
Subjects:
Application software
Concurrent computing
Digital filters
Digital signal processing
Discrete Fourier transforms
Fast Fourier transforms
Filtering
Hardware
Microcomputers
Signal processing algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An FFT algorithm operating on a 16-bit microcomputer can calculate a 256-point transform as much as 10 times faster than a similar algorithm on an eight-bit microcomputer.
ISSN:0272-1732
1937-4143
DOI:10.1109/MM.1982.291039