Algorithms and pipeline architectures for 2-D FFT and FFT-like transforms
暂无分享,去创建一个
[1] Satnam Singh Dlay,et al. VLSI implementation issues for the 2-D Fermat number transform , 1991, Signal Process..
[2] J. Pollard,et al. The fast Fourier transform in a finite field , 1971 .
[3] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975 .
[4] Myoung Seob Lim,et al. New Radix-2 to the 4th Power Pipeline FFT Processor , 2005, IEICE Trans. Electron..
[5] Mats Torkelson,et al. A new approach to pipeline FFT processor , 1996, Proceedings of International Conference on Parallel Processing.
[6] Said Boussakta,et al. Pipeline Architectures for Radix-2 New Mersenne Number Transform , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.
[7] E. V. Jones,et al. A pipelined FFT processor for word-sequential data , 1989, IEEE Trans. Acoust. Speech Signal Process..
[8] T. M. Pytosh,et al. A new parallel 2-D FFT architecture , 1990, International Conference on Acoustics, Speech, and Signal Processing.
[9] C. K. Yuen,et al. Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.
[10] Erdal Oruklu,et al. An Efficient FFT Engine With Reduced Addressing Logic , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.
[11] Hong Ren Wu,et al. The structure of vector radix fast Fourier transforms , 1989, IEEE Trans. Acoust. Speech Signal Process..
[12] Yu-Yun Lee,et al. A novel algorithm for computing the 2D split-vector-radix FFT , 2004, Signal Process..
[13] C. Burrus,et al. Fast Convolution using fermat number transforms with applications to digital filtering , 1974 .
[14] Charles M. Rader,et al. Number theory in digital signal processing , 1979 .
[15] Hyesook Lim,et al. A systolic array for 2-D DFT and 2-D DCT , 1994, Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94).
[16] Yunho Jung,et al. New efficient FFT algorithm and pipeline implementation results for OFDM/DMT applications , 2003, IEEE Trans. Consumer Electron..
[17] Chen-Yi Lee,et al. An Indexed-Scaling Pipelined FFT Processor for OFDM-Based WPAN Applications , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.
[18] A. Lynn Abbott,et al. Implementation of a 2-D Fast Fourier Transform on an FPGA-Based Custom Computing Machine , 1995, FPL.
[19] Martin Vetterli,et al. Fast Fourier transforms: a tutorial review and a state of the art , 1990 .
[20] Alvin M. Despain,et al. Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.
[21] Keshab K. Parhi,et al. High-Throughput VLSI Architecture for FFT Computation , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.
[22] Samuel C. Lee,et al. A new approach to solve the sequence-length constraint problem in circular convolution using number theoretic transform , 1991, IEEE Trans. Signal Process..
[23] Henri J. Nussbaumer. Digital filtering using complex Mersenne transforms , 1976 .
[24] Abbes Amira,et al. FPGA implementations of fast Fourier transforms for real-time signal and image processing , 2005 .
[25] Tom Dillon. An Efficient Architecture for Ultra Long FFTs in FPGAs and ASICs , 2004 .
[26] Yun-Nan Chang,et al. An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.
[27] Richard Conway. Modified Overlap Technique Using Fermat and Mersenne Transforms , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.
[28] H. Nussbaumer. Digital filtering using pseudo fermat number transforms , 1977 .