✦ LIBER ✦

On number theoretic Fourier transforms in residue class rings

✍ Scribed by Vanwormhoudt, M.

Book ID: 117905166
Publisher: IEEE
Year: 1977
Weight: 258 KB
Volume: 25
Category: Article
ISSN: 0096-3518
DOI: 10.1109/tassp.1977.1163006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Structural properties of complex residue

Structural properties of complex residue rings applied to number theoretic Fourier transforms

✍ Vanwormhoudt, M. 📂 Article 📅 1978 🏛 IEEE ⚖ 671 KB

Residue number system implementations of

Residue number system implementations of number theoretic transforms in complex residue rings

✍ Baraniecka, A.; Jullien, G. 📂 Article 📅 1980 🏛 IEEE ⚖ 681 KB

Two-dimensional convolutions by means of

Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings

✍ Martens, J.-B. 📂 Article 📅 1984 🏛 IEEE ⚖ 841 KB

Convolutions of long integer sequences b

Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings

✍ Martens, J.-B.; Vanwormhoudt, M. 📂 Article 📅 1983 🏛 IEEE ⚖ 922 KB

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

On discrete Fourier transforms (number-t

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

✍ P. Duhamel; H. Hollmann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 300 KB