Browse > Article

Study of Radix-3 FFT  

Jung, Hae-Seung (전자팀)
Publication Information
Aerospace Engineering and Technology / v.9, no.1, 2010 , pp. 98-105 More about this Journal
Abstract
Fast Fourier Transform is the fast implementation of Discrete Fourier Transform, which deletes periodic operation of DFT. According to the definition, radix-2 FFT can be implemented byre cursive call which divides the input signal points into 2 signal points. Because of its time-consuming stack-copy operation, this recursive method is very slow. To overcome this drawback, butterfly operation with signal rearrangement was devised. Based on the ideas of signal rearrangement and butterfly operation, this paper applies the signal rearrangement method to the Radix-3 FFT and checks the validity of this method.
Keywords
Fourier Transform; Fast Fourier Transform; Radix-2; Radix-3; Twiddle Factor; Bit-Reversing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Yoiti Suzuki, Toshio Sone, AND Ken'iti Kido, "A New FFT Algorithm of Radix 3, 6, and 12", IEEE Trans. acoustics, speech, and signal processing, VOL. ASSP-34. NO. 2, APRIL 1986
2 장영범, 허은성, 박진수, 홍대기, "OFDM용 고속 Radix-8 FFT 구조", 전자공학회논문지-SP, 제44권 제5호, 2007.9, pp. 84-93
3 서석호, 박세승, 이강현, "효율적인 FFT Radix-4의 구현", 한국정보기술학회 2007년도 하계학술발표논문집 2007.6, pp. 249-252
4 리우항, 이한호, "A High-Speed Low-Complexity 128/64-point $Radix-2^4$ FFT Processor for MIMO-OFDM Systems", 전자공학회논문지-SD, 제46권 제2호 2009.2, pp. 15-23
5 J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series" Math. Comp., vol.19, April 1965, pp, 297-301   DOI   ScienceOn
6 Eric Dubois, Anastasios N. Venetsanopoulos, "A New Algorithm for the Radix-3 FFT", IEEE Trans. acoustics, speech, and signal processing, VOL. ASSP-26, NO. 3, June 1978
7 R. C. Singleton, "An algorithm for computing the mixed radix fast Fourier transform," IEEE Trans. Audio Electroacoust., vol. AU-17, pp. 93-103, June 1969.