A fast algorithm for exact convolution of rational sequences by using integer arithmetics only (Q1091077)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for exact convolution of rational sequences by using integer arithmetics only |
scientific article; zbMATH DE number 4009658
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for exact convolution of rational sequences by using integer arithmetics only |
scientific article; zbMATH DE number 4009658 |
Statements
A fast algorithm for exact convolution of rational sequences by using integer arithmetics only (English)
0 references
1986
0 references
The digital convolution of rational numbers is exactly computed. This computation is done by the polynomial transforms with extended digit length in Hensel code plane. Its exactness stems from the representation using the finite p-adic number systems, and its efficiency, from the multiplication using the integer arithmetics.
0 references
digital convolution of rational numbers
0 references
polynomial transforms
0 references
Hensel code
0 references
p-adic number systems
0 references
integer arithmetics
0 references
