✦ LIBER ✦

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

✍ Scribed by H. Krishna Garg; C. C. Ko

Publisher: Springer
Year: 1997
Tongue: English
Weight: 871 KB
Volume: 16
Category: Article
ISSN: 0278-081X
DOI: 10.1007/bf01183180

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On fast algorithms for one-dimensional d

On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings

✍ Hari Krishna Garg; Tian Wei 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 915 KB

A novel modularized fast polynomial tran

A novel modularized fast polynomial transform algorithm for two-dimensional convolutions

✍ Ja-Ling Wu; Yuh-Ming Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 506 KB

An efficient algorithm for cyclic convol

An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms

✍ Cheng Lizhi; Jiang Zengrong 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 548 KB

Two-dimensional shift register synthesis

Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring

✍ Shojiro Sakata 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1023 KB

Optimal Algorithms for All-to-All Person

Optimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori

✍ Chi Chung Lam; C.-H. Huang; P. Sadayappan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 254 KB

All-to-all personalized communication is a basic communication operation in a parallel computing environment. In this operation, each processor sends a distinct message to every other processor. It is used in several parallel algorithms, such as for the fast Fourier transform. This paper presents ne

Coupling of one- and two-dimensional fin

Coupling of one- and two-dimensional finite elements for the computation of tidal flow in estuaries

✍ B. Herrling 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 522 KB