Document Type
Thesis
Date of Award
1-31-1988
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical Engineering
First Advisor
Dale Thorpe Teaney
Second Advisor
Joseph Frank
Abstract
In this report, the 256 point radix-2 FFT algorithm is written in assembly languages of microprocessor 68000( or 68008) and microcontroller 8052( or 8051). The data used can be upto 30 bits, of which the least significant 12 bits are assigned for fractional part.
The FFT code in assembly of 68000 is written for Sinclair's QL-100 personal computer with 68008 CPU. The SuperBASIC programs are used to access and test the performance of FFT code. The average time of execution falls between 0.3 to 0.4 seconds for 256 discrete points.
Again, same FFT algorithm is written in assembly language of 8052 for single board 8052AH computer (SBC). The BASIC-52 programs are used to access and test the performance of FFT code. The average time of execution falls between 1.0 to 1.2 seconds.
To simplify the understanding of assembly code, in addition to documentation, the FFT algorithms are written in QuickBASIC for IBM XT personal computer, SuperBASIC for Sinclair QL 100 personal computer and BASIC-52 for SBC. The assembly and/or BASIC codes can be further fine tuned to specific applications to maximize the speed of execution.
Recommended Citation
Baldawa, Hari Kumar, "The fast fourier transform in assembly languages of microprocessor 68000 and microcontroller 8052" (1988). Theses. 3007.
https://digitalcommons.njit.edu/theses/3007
