Abstract:
A new theorem that gives necessary and sufficient conditions for the existence of computationally fast number theoretic transforms is presented. The theorem combines the ...Show MoreMetadata
Abstract:
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.
Published in: IEEE Transactions on Computers ( Volume: C-30, Issue: 5, May 1981)