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

On discrete Fourier transforms (number-theoretic transforms) with minimum number of rotations (shifts)

โœ Scribed by P. Duhamel; H. Hollmann

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
300 KB
Volume
14
Category
Article
ISSN
0165-1684

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

NF-FF transformation with cylindrical sc
NF-FF transformation with cylindrical scanning from a minimum number of data
โœ F. D'Agostino; F. Ferrara; C. Gennarelli; G. Riccio; C. Savarese ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 424 KB

## Abstract In this paper, an efficient sampling representation for reconstructing the voltage measured by a probe over a cylinder in the antenna NF region from a minimum number of data is proposed, and properly exploited to develop two probe compensated NFโ€“FF transformation techniques. They are ba