Pruning fast Fourier transform algorithm design using group-based method
暂无分享,去创建一个
[1] Hannu Tenhunen,et al. A new VLSI-oriented FFT algorithm and implementation , 1998, Proceedings Eleventh Annual IEEE International ASIC Conference (Cat. No.98TH8372).
[2] Keinosuke Nagai,et al. Pruning the decimation-in-time FFT algorithm with frequency shift , 1986, IEEE Trans. Acoust. Speech Signal Process..
[3] M. Omair Ahmad,et al. A new radix-2/8 FFT algorithm for length-q×2m DFTs , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..
[4] D. Skinner. Pruning the decimation in-time FFT algorithm , 1976 .
[5] M. Omair Ahmad,et al. Efficient pruning algorithms for the DFT computation for a subset of output samples , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[6] M. Omair Ahmad,et al. An efficient split-radix FFT algorithm , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[7] J. Markel,et al. FFT pruning , 1971 .
[8] Alvin M. Despain,et al. Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations , 1984, IEEE Transactions on Computers.
[9] A. W. M. van den Enden,et al. Discrete Time Signal Processing , 1989 .
[10] Chih-Peng Fan,et al. Compact recursive structures for discrete cosine transform , 2000 .
[11] Shing-Chow Chan,et al. Split vector-radix fast Fourier transform , 1992, IEEE Trans. Signal Process..
[12] D. Takahashi,et al. An extended split-radix FFT algorithm , 2001, IEEE Signal Processing Letters.
[13] C. Sidney Burrus,et al. Efficient computation of the DFT with only a subset of input or output points , 1993, IEEE Trans. Signal Process..
[14] Chein-Wei Jen,et al. High-speed and low-power split-radix FFT , 2003, IEEE Trans. Signal Process..
[15] P. Laguna,et al. Signal Processing , 2002, Yearbook of Medical Informatics.
[16] Alvin M. Despain,et al. Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.