Discrete weighted transforms and large-integer arithmetic
暂无分享,去创建一个
[1] Barry S. Fagin,et al. Large Integer Multiplication on Hypercubes , 1992, J. Parallel Distributed Comput..
[2] D. Calvetti. A Stochastic Roundoff Error Analysis for the Fast Fourier Transform , 1991 .
[3] Weiping Li,et al. FIR filtering by the modified Fermat number transform , 1990, IEEE Trans. Acoust. Speech Signal Process..
[4] Douglas L. Jones,et al. Real-valued fast Fourier transform algorithms , 1987, IEEE Trans. Acoust. Speech Signal Process..
[5] R.C. Agarwal,et al. Number theory in digital signal processing , 1980, Proceedings of the IEEE.
[6] F. Preparata,et al. Computational Complexity of Fourier Transforms over Finite Fields , 1977 .
[7] Trieu-Kien Truong,et al. The use of finite fields to compute convolutions , 1975, IEEE Trans. Inf. Theory.
[8] J. Pollard,et al. The fast Fourier transform in a finite field , 1971 .
[9] G. Ramos. Roundoff error analysis of the fast Fourier transform , 1970 .
[10] D. H. Lehmer,et al. IRREGULAR PRIMES TO ONE MILLION , 1992 .
[11] Reiner Creutzburg,et al. Parameter determination for complex number-theoretic transforms using cyclotomic polynomials , 1989 .
[12] Duncan A. Buell,et al. The twentieth Fermat number is composite , 1988 .
[13] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .
[14] Charles M. Rader,et al. Number theory in digital signal processing , 1979 .
[15] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .