汇编语言编写FFT蝶型算法，应用平台TMS320C5416-FFT Butterfly algorithm written in assembly language, application platform TMS320C5416

快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. T

这个目录包含ADSP-2191单核程序例子，实现64位或更多位的 radix-2 FFt算法。CFFT2_2191.ASM文件里包含详细讨论。(This directory contains an example ADSP-2191 single-core subroutine that implements radix-2 FFT of length 64 or greater on input data x(n). A detailed discussion of the compl