I N-PLACE , IN-ORDER MI XED- RADIX FFTs
暂无分享,去创建一个
Conditions are stated for mixed-radix FFTs that are both in-place and in-order. ordering of both the input and output data is achieved as the computation progresses at the expense of a small amount of temporary storage. The number of additional data transfers is the order of 1 L/2lN where N has L factors, but the logic for the data transfers is very simple. The natural
[1] C. Burrus,et al. An in-place, in-order prime factor FFT algorithm , 1981 .
[2] C. Sidney Burrus,et al. An in-order, in-place radix-2 FFT , 1984, ICASSP.