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

Fast Fourier Transforms on binary fields

โœ Scribed by F. Schipp; W. R. Wade

Publisher
Springer
Year
1998
Tongue
English
Weight
410 KB
Volume
14
Category
Article
ISSN
1573-8175

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Zak Transforms on Binary Fields
Zak Transforms on Binary Fields
โœ F. Schipp; W.R. Wade ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

We introduce analogues of the Zak Transform on binary fields, and show that they are bounded linear operators on L p for p=1 and 2. We also show that positivity of Zak transforms can be used to decide whether orthonormal systems generated by multiplying characters of F by a weight function are compl

Mellin Transforms on Binary Fields
Mellin Transforms on Binary Fields
โœ F. Schipp; W.R. Wade ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

We show that the Mellin transform on any binary field can be extended to a bounded linear isometry on L 2 . We also obtain an explicit formula for the corresponding inverse Mellin transform and prove that inversion holds when the Mellin transform is integrable.

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