Open AccessLow‐complexity twiddle factor generation for FFT processor
Author(s) -
Kang HyeongJu,
Lee JongYeol,
Kim JiHoon
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.2461
Subject(s) - twiddle factor , fast fourier transform , computer science , factor (programming language) , parallel computing , arithmetic , split radix fft algorithm , computer hardware , algorithm , mathematics , fourier transform , programming language , mathematical analysis , fourier analysis , short time fourier transform
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.