Low-Cost Fast VLSI Algorithm for Discrete Fourier Transform
暂无分享,去创建一个
[1] K.K. Parhi,et al. Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures , 2006, IEEE Transactions on Signal Processing.
[2] Chein-Wei Jen,et al. A new systolic array algorithm for discrete Fourier transform , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.
[3] Keshab K. Parhi,et al. Hardware efficient fast parallel FIR filter structures based on iterated short convolution , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..
[4] Chin-Liang Wang,et al. Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse , 2000, IEEE Trans. Signal Process..
[5] J Vlsi. A High-speed CMOS Implementation of the Winograd Fourier Transform Algorithm , 1996 .
[6] Dulal C. Kar,et al. A new systolic realization for the discrete Fourier transform , 1993, IEEE Trans. Signal Process..
[7] R. Tolimieri,et al. Algorithms for Discrete Fourier Transform and Convolution , 1989 .
[8] Long-Wen Chan,et al. A new systolic array for discrete Fourier transform , 1988, IEEE Trans. Acoust. Speech Signal Process..
[9] J. Choi,et al. A new linear systolic array for FFT computation , 1992 .
[10] Chein-Wei Jen,et al. The efficient memory-based VLSI array designs for DFT and DCT , 1992 .
[11] Harvey F. Silverman,et al. An introduction to programming the Winograd Fourier transform algorithm (WFTA) , 1977 .
[12] N. Rama Murthy,et al. On the real-time computation of DFT and DCT through systolic architectures , 1994, IEEE Trans. Signal Process..
[13] V. Boriakoff,et al. FFT computation with systolic arrays, a new architecture , 1994 .
[14] Chein-Wei Jen,et al. Hardware-efficient DFT designs with cyclic convolution and subexpression sharing , 2000 .
[15] Bertram E. Shi,et al. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS — I : REGULAR PAPERS , VOL . ? ? , NO . ? ? , ? ? ? ? , 2007 .