✦ LIBER ✦

Programmable modified systolic array for fast one- and two-dimensional convolutions

✍ Scribed by Borghesi, L.; Giuliano, E.; Musso, G.; Cabiati, F.; Ottonello, P.

Book ID: 115386232
Publisher: Optical Society of America
Year: 1986
Tongue: English
Weight: 636 KB
Volume: 3
Category: Article
ISSN: 1084-7529
DOI: 10.1364/JOSAA.3.001561

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast direct implementations of two-dimen

Fast direct implementations of two-dimensional digital filters via systolic and wavefront arrays

✍ B. G. Mertzios; A. N. Venetsanopoulos 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

Fast algorithms for computing one- and t

Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

✍ H. Krishna Garg; C. C. Ko 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 871 KB

A NOTE ON CONVOLUTION AND PADDING FOR TW

A NOTE ON CONVOLUTION AND PADDING FOR TWO-DIMENSIONAL DATA

✍ V. K. GUPTA; N. RAMANI 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB

A Fast Algorithm for Matrix Multiplicati

A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays

✍ L.D. Elfimova; Yu.V. Kapitonova 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 114 KB

The Modified Local Crank–Nicolson method

The Modified Local Crank–Nicolson method for one- and two-dimensional Burgers’ equations

✍ Pengzhan Huang; Abdurishit Abduwali 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 341 KB

The Modified Local Crank-Nicolson method is applied to solve one-and two-dimensional Burgers' equations. New difference schemes that are explicit, unconditionally stable, and easy to compute are obtained. Numerical solutions obtained by the present method are compared with exact solutions, and it is

On the application of a fast polynomial

On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution

✍ Truong, T.; Reed, I.; Lipes, R.; Wu, C. 📂 Article 📅 1981 🏛 IEEE ⚖ 684 KB