๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The integer cubic algorithm

โœ Scribed by Efim A. Galperin

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
625 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The cubic algorithm
The cubic algorithm
โœ Efim A. Galperin ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 304 KB
The fast cubic algorithm
The fast cubic algorithm
โœ E.A. Galperin ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 944 KB
Invertible integer DCT algorithms
Invertible integer DCT algorithms
โœ Gerlind Plonka; Manfred Tasche ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

Integer DCTs have important applications in lossless coding. In this paper, an integer DCT of radix-2 length n is understood to be a nonlinear, (left-)invertible mapping which acts on Z n and approximates the classical discrete cosine transform (DCT) of length n. In image compression, the DCT of typ

Improvements on the accelerated integer
Improvements on the accelerated integer GCD algorithm
โœ Mohamed S. Sedjelmaci; Christian Lavault ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB

The present paper analyses and presents several improvements to the algorithm for finding the (a, b)-pairs used in the k-ary reduction of the right-shift k-ary integer GCD algorithm. While the worst-case complexity of the "Accelerated integer GCD algorithm" is 0( (log,( k))'), we show that the worst