Revision as of 07:34, 1 May 2018 edit Cherkash (talk \| contribs) Extended confirmed users 30,402 edits mNo edit summary ← Previous edit		Revision as of 23:33, 24 July 2018 edit undo Cherkash (talk \| contribs) Extended confirmed users 30,402 edits m →Other approaches Next edit →
Line 44: == Other approaches == The [[~~Split~~split-radix FFT algorithm]] has been proved to be a useful method for 1-D DFT. And this method has been applied to the vector-radix FFT to obtain a split vector-radix FFT.<ref name=Chan92/><ref name="Pei87">{{cite journal\|last1=Pei\|first1=Soo-Chang\|last2=Wu\|first2=Ja-Lin\|title=Split vector radix 2D fast Fourier transform\|journal=IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '87.\|date=April 1987\|pages=1987–1990\|doi=10.1109/ICASSP.1987.1169345\|url=http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1169345&isnumber=26345}}</ref> In conventional 2-D vector-radix algorithm, we decompose the indices <math>k_1,k_2</math> into 4 groups:

Vector-radix FFT algorithm: Difference between revisions