摘要
本文提出一种实傅里叶变换(RFT)的新定义,用这种定义推导出计算实序列离散傅里叶变换(DFT)的一种快速算法(FRFT);它是当前同类算法中乘法次数、总运算次数、存储量均属最低水平的结构性最强的一种同址算法。
A new definition for Real-valued Fourier transform(RFT) is presented. By this definition, a Fast Real-valued Fourier Transform (FRFT) algorithm is developed for calculating Discrete Fourier Transform (DFT) of Real-valued sequence. It is an in-place algorithm with better regularity in structure among algorithms which takes the least number of multiplication, total opration, and size of memory.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1991年第3期16-22,共7页
Acta Electronica Sinica
基金
国家自然科学基金
