Results 251 to 260 of about 120,753 (284)
Some of the next articles are maybe not open access.
Number theoretic transforms (NTTs)
2010We introduce the number theoretic transforms (NTTs). The routines for the fast NTTs are rather straightforward translations of the FFT algorithms. Radix-2 and radix-4 routines are given, there should be no difficulty to translate any given complex FFT into the equivalent NTT.
openaire +1 more source
Frequency detection capability of number theoretic transforms
[1989] Proceedings. The Twenty-First Southeastern Symposium on System Theory, 2003A novel application of number theoretic transforms (NTTs) is presented. Examination of the NTTs of a certain class of sine waves indicates a simple relationship between waves of zero relative phase shift having frequencies of the general form 2/sup n/ for n an integer.
V.E. Brewer, R.R. Adhami
openaire +1 more source
Long convolutions using number theoretic and polynominal transforms
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984Summary: A method is proposed for partitioning a long convolution in several short convolutions to be computed by the Fermat number transform. The method is based on the use of polynomial transforms. The computational cost is much lower than that required by the algorithms already available in the technical literature.
openaire +2 more sources
Number theoretic transform based on ternary arithmetic
ICASSP '83. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005A number theoretic transform (NTT) is proposed, which can efficiently be computed by using ternary modular arithmetic. The new NTT relaxes the restriction imposed on the convolution length and, as in other efficient NTT's, its computation can be performed by means of data shifts and additions.
P. Balla, A. Antoniou
openaire +1 more source
Mersenne numbers rooted on 3 for number theoretic transforms
ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005Number Theoretic Transforms (NTT) have been shown capable of implementing efficiently finite digital convolutions for signal processing applications in voice, video, and pattern recognition areas. In this paper the concept of Generalized Mersenne Numbers (GMN) is introduced with the goal of obtaining a new discrete transform having certain desirable ...
D. Minoli, W. Nakamine
openaire +1 more source
The eigenstructure of the number theoretic transforms
Signal Processing, 1982Abstract Fast digital transforms are linear matrix operations and their eigenstructure is of fundamental interest. The eigensystem for the Fast Fourier transform, FFT, known for several years, can be used to design FFT algorithms. The Number Theoretic Transforms have a similar eigen problem, defined over ofZ /p which is solved in this paper. We find
openaire +1 more source
Pattern Analysis under Number Theoretic Transforms
2012Number Theoretic Transforms (NTT) are integer-valued transforms that may be applied for signal processing. Particularly the Mersenne and the Fermat Transforms are interesting, since being close related to special powers of two, at the computational level, product operations needed for convolution may be efficiently reduced to shift operations.
openaire +1 more source
Conditions for the Existence of Fast Number Theoretic Transforms
IEEE Transactions on Computers, 1981A 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.
openaire +2 more sources
Cancer treatment and survivorship statistics, 2022
Ca-A Cancer Journal for Clinicians, 2022Kimberly D Miller +2 more
exaly
PipeNTT: A Pipelined Number Theoretic Transform Architecture
IEEE Transactions on Circuits and Systems II: Express Briefs, 2022Zewen Ye, Ray C. C. Cheung, Kejie Huang
openaire +1 more source