✦ LIBER ✦

Fast Multipliers for Number Theoretic Transforms

✍ Scribed by Nussabaumer, H.J.

Book ID: 114606199
Publisher: IEEE
Year: 1978
Tongue: English
Weight: 425 KB
Volume: C-27
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1978.1675187

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conditions for the Existence of Fast Num

Conditions for the Existence of Fast Number Theoretic Transforms

✍ Kodek, D.M. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 446 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

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

Microprocessor implementation of number

Microprocessor implementation of number theoretic transforms

✍ Martin, S.C.P.; Stanier, B.J. 📂 Article 📅 1979 🏛 Institution of Electrical Engineers ⚖ 637 KB

Exact deconvolution using number-theoret

Exact deconvolution using number-theoretic transforms

✍ G. Drauschke; M. Tasche 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Number theoretic transforms for the calc

Number theoretic transforms for the calculation of convolutions

✍ Martens, J.-B. 📂 Article 📅 1983 🏛 IEEE ⚖ 948 KB