Referenced Items are not available for this document.
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
)
Date of Publication: April 12 1984
- Page(s):
- 347 - 349
- ISSN :
- 0013-5194
- Digital Object Identifier :
- 10.1049/el:19840236
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 11 July 2007
- Issue Date :
- April 12 1984
- Sponsored by :
- Institution of Engineering and Technology
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
