✦ LIBER ✦

Polynomial evaluation in VLSI using distributed arithmetic

✍ Scribed by Burleson, W.P.

Book ID: 114559516
Publisher: IEEE
Year: 1990
Weight: 642 KB
Volume: 37
Category: Article
ISSN: 0098-4094
DOI: 10.1109/31.103226

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

High-performance VLSI architecture of mu

High-performance VLSI architecture of multiplierless LMS adaptive filters using distributed arithmetic

✍ Yoshitaka Tsunekawa; Kyo Takahashi; Shinji Toyoda; Mamoru Miura 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

Algorithms in unnormalized arithmetic II

Algorithms in unnormalized arithmetic II. Unrestricted polynomial evaluation

✍ M. Menzel; N. Metropolis 📂 Article 📅 1967 🏛 Springer-Verlag 🌐 English ⚖ 765 KB

High-performance VLSI architecture suita

High-performance VLSI architecture suitable for control systems for state-space digital filters using distributed arithmetic

✍ Yoshitaka Tsunekawa; Mamoru Miura 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 629 KB

Parallel Multiplication in GF(2k) using

Parallel Multiplication in GF(2k) using Polynomial Residue Arithmetic

✍ A. Halbutogullari; C. K. Koc 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 197 KB

The bit-operation complexity of approxim

The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

✍ V. Pan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.

Accurate summation, dot product and poly

Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic

✍ Stef Graillat; Valérie Ménissier-Morain 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 303 KB