A New Architecture For Radix-2 New Mersenne Number Transform
暂无分享,去创建一个
[1] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975, Proceedings of the IEEE.
[2] Mats Torkelson,et al. A new approach to pipeline FFT processor , 1996, Proceedings of International Conference on Parallel Processing.
[3] Charles M. Rader,et al. Discrete Convolutions via Mersenne Transrorms , 1972, IEEE Transactions on Computers.
[4] A. G. J. Holt,et al. New transform using the Mersenne numbers , 1995 .
[5] C. K. Yuen,et al. Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.
[6] K. J. Ray Liu,et al. Fast algorithms for 2-D circular convolutions and number theoretic transforms based on polynomial transforms over finite rings , 1995, IEEE Trans. Signal Process..
[7] A. G. J. Holt,et al. 3-D vector radix algorithm for the 3-D new Mersenne number transform , 2001 .
[8] Said Boussakta,et al. Fast algorithm for the 2-D new Mersenne number transform , 2001, Signal Process..
[9] V. S. Dimitrov,et al. Number theoretic transforms over the golden section quadratic field , 1995, IEEE Trans. Signal Process..
[10] Andreas Antoniou,et al. Number theoretic transform based on ternary arithmetic and its application to cyclic convolution , 1983 .
[11] Rainer Storn. Radix-2 FFT-pipeline architecture with reduced noise-to-signal ratio , 1994 .
[12] Weiping Li. The modified Fermat number transform and its application , 1990, IEEE International Symposium on Circuits and Systems.
[13] 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..