A simplified binary arithmetic for the Fermat number transform
暂无分享,去创建一个
A binary arithmetic that permits the exact computation of the Fermat number transform (FNT) is described. This technique involves arithmetic in a binary code corresponding to the simplest one of a set of code translations from the normal binary representation of each integer in the ring of integers modulo a Fermat number F t = 2b+ 1, b = 2t. The resulting FNT binary arithmetic operations are of the complexity of 1's complement arithmetic as in the case of a previously proposed technique which corresponds to another one of the set of code translations. The general multiplication of two integers modulo F t required in the computation of FNT convolution is discussed.
[1] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[2] J. Pollard,et al. The fast Fourier transform in a finite field , 1971 .
[3] Charles M. Rader,et al. Discrete Convolutions via Mersenne Transrorms , 1972, IEEE Transactions on Computers.
[4] C. Burrus,et al. Fast Convolution using fermat number transforms with applications to digital filtering , 1974 .