Radix-2 Based Structure for Ultra-long FFT
Hyeong‐Ju Kang · The Journal of the Korean Institute of Information and Communication Engineering · 2013
본 논문에서는 32768-point FFT에서 radix-2에 기반한 구조들을 비교한다. Radix-2에 기반한 radix- $2^k$ 구조들은 버터플라이가 단순하면서 곱셈기의 수를 줄일 수 있어서 많이 이용되고 있다. 본 논문에서는 근래에 많이 연구되고 있는 ultra-long FFT 중 대표적인 32768-point FFT에 대해 다양한 radix- $2^k$ 구조를 적용하였다. 합성했을 때의 복잡도와 SQNR 성능을 비교한 결과 radix- $2^4$ 구조가 가장 적합함을 보였다. This paper compares radix-2 based structures for 32768-point FFT. Radix- $2^k$ structures have been widely used because the butterfly is simple and the number of multipliers can be reduced in those structures. This paper applied various radix- $2^k$ structures to 32768-point FFT that is representing ultra-long FFT. The ultra-long FFT has been studied much recently. This paper shows that the radix- $2^4$ structure is the most adequate because it shows the smallest complexity in the synthesis and the best SQNR performance. should be placed here.