๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Very fast discrete Fourier transform using number theoretic transform

โœ Scribed by Wan-Chi Siu,; Constantinides, A.G.

Book ID
114452201
Publisher
The Institution of Electrical Engineers
Year
1983
Weight
477 KB
Volume
130
Category
Article
ISSN
0143-7089

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast Fourier Transformation Based on Num
Fast Fourier Transformation Based on Number Theoretic Transforms
โœ Reza Adhami; Robert J. Polge ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 643 KB

Many fast algorithms have been proposed for computing the discrete Fourier transformation. Most of them are based on factorization with the goal of reducing the number of multiplications. They usejoating point arithmetic to avoid repetitious scaling and a sizeable wordlength to minimize quantization

Multiple radix fast fourier transformati
Multiple radix fast fourier transformation based on number theoretic transforms
โœ Brooks Lawrence; Robert Polge; Reza Adhami ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

A multi-radix ,fust Fourier transform/number theoretic transftirm is proposed ,ftir the calculation of the discrete Fourier transform of sequences with a prime length, P. The proposed technique is applicable to sequences of length P = 2"' \* 3K2\* SK3+ 1, where Kl, K2 and K3 are integers. Advantages