A split-radix algorithm for 2-D DFT


(4) approach [I] is extended for computing the 2' x 2' 2-D DFT consists (21 of factoring the even-even indexed terms as a radix-2x2 FFT and the even-odd, odd-even, oddodd indexed terms as a radix-4x4 FFT. This process provides in the first stage one (N/Z)x(N/2) DFT and twelve (N/4)x(N/4) DF'Ib, and it is continued successively until where n, = 0, 1, ..., (N… (More)
DOI: 10.1109/ISCAS.2003.1205115


  • Presentations referencing similar topics