Low-complexity twiddle factor generation for FFT processor
Low-complexity twiddle factor generation for FFT processor
复制标题
DOI：
10.1049/el.2013.2461
复制
发表时间：
2013-12
影响因子：
1.1
通讯作者：
Hyeong-Ju Kang;Jong-Yeol Lee;Ji-Hoon Kim
中科院分区：
文献类型：
--
作者：
Hyeong-Ju Kang;Jong-Yeol Lee;Ji-Hoon Kim
提出了一种用于快速傅立叶变换(FFT)的低复杂度旋转因子生成结构。在FFT中，旋转阵元的产生和乘法运算所占的面积比其他数学运算所占的面积更大。该结构消除了传统结构中的冗余，压缩了旋转因子只读存储器的内容，减少了旋转因子的产生部分。与传统结构相比，该结构的旋转因子产生部分减少了32-45%。
A low-complexity twiddle factor generation structure for fast Fourier transform (FFT) is proposed. In FFT, twiddle faction generation and multiplication occupies more area than the other mathematical operations. The proposed structure reduces the twiddle factor generation part by removing the redundancies in the conventional structure and compressing the twiddle factor ROM contents. With the proposed structure, the twiddle factor generation part is reduced by 32–45% compared with that of the conventional structure.