|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Conditions for the Existence of Fast Number Theoretic Transforms
May 1981 (vol. 30 no. 5)
pp. 359-360
| ASCII Text | x | ||
| D.M. Kodek, "Conditions for the Existence of Fast Number Theoretic Transforms," IEEE Transactions on Computers, vol. 30, no. 5, pp. 359-360, May, 1981. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1981.1675794, author = {D.M. Kodek}, title = {Conditions for the Existence of Fast Number Theoretic Transforms}, journal ={IEEE Transactions on Computers}, volume = {30}, number = {5}, issn = {0018-9340}, year = {1981}, pages = {359-360}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1981.1675794}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Conditions for the Existence of Fast Number Theoretic Transforms IS - 5 SN - 0018-9340 SP359 EP360 EPD - 359-360 A1 - D.M. Kodek, PY - 1981 KW - number theoretic transforms KW - Digital filtering KW - discrete Fourier transforms KW - fast convolution KW - fast Fourier transform (FFT) KW - Fermat number transforms VL - 30 JA - IEEE Transactions on Computers ER - | |||
A new theorem that gives necessary and sufficient conditions for the existence of computationally fast number theoretic transforms is presented. The theorem combines the general conditions for the existence of number theoretic transforms in the rings of integers modulo m with two conditions for high computational efficiency.
Index Terms:
number theoretic transforms, Digital filtering, discrete Fourier transforms, fast convolution, fast Fourier transform (FFT), Fermat number transforms
Citation:
D.M. Kodek, "Conditions for the Existence of Fast Number Theoretic Transforms," IEEE Transactions on Computers, vol. 30, no. 5, pp. 359-360, May 1981, doi:10.1109/TC.1981.1675794
Usage of this product signifies your acceptance of the Terms of Use.

