An Alternate Approach for Developing Higher Radix FFT Algorithms

Author

Bouguezel, Saad ; Ahmad, M. Omair ; Swamy, M.N.S.

Author_Institution

Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que.

fYear

2006

fDate

4-7 Dec. 2006

Firstpage

227

Lastpage

230

Abstract

In this paper, the authors propose an alternate method to derive higher radix FFT algorithms by using a recursive approach and by appropriately combining the twiddle factors without increasing the structural complexity. Specifically, efficient radix-8 and radix-16 FFT algorithms are designed and their arithmetic complexities shown to be slightly less than those of the corresponding existing Cooley-Tukey FFT algorithms

Keywords

computational complexity; digital arithmetic; fast Fourier transforms; Cooley-Tukey FFT; arithmetic complexity; fast Fourier transforms; higher radix FFT; radix-16 FFT; radix-8 FFT; Algorithm design and analysis; Arithmetic; Counting circuits; Discrete Fourier transforms; Fast Fourier transforms; Hardware; Hydrogen; Signal processing algorithms; Software algorithms; Table lookup; higher radix FFT algorithms; radix-16 FFT; radix-8 FFT;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on

Conference_Location

Singapore

Print_ISBN

1-4244-0387-1

Type

conf

DOI

10.1109/APCCAS.2006.342373

Filename

4145372

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2240400