𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast and numerically stable algorithms for discrete cosine transforms

✍ Scribed by Gerlind Plonka; Manfred Tasche

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
477 KB
Volume
394
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Overlapping block discrete cosine transf
Overlapping block discrete cosine transform coding and its fast algorithm
✍ Hideo Sawami; Yoshitaka Morikawa; Hiroshi Hamada πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 941 KB

## Abstract The discrete cosine transform (DCT) method is well known for a highly efficient coding for still images. A problem in this method is that the block distortion is observed in low‐rate coding. The overlapping block transform (OBT) has recently been proposed, aiming at the reduction of the

A Fast and Numerically Stable Euclidean-
A Fast and Numerically Stable Euclidean-like Algorithm for Detecting Relatively Prime Numerical Polynomials
✍ B. Beckermann; G. Labahn πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 644 KB

In this paper we provide a fast, numerically stable algorithm to determine when two given polynomials a and b are relatively prime and remain relatively prime even after small perturbations of their coefficients. Such a problem is important in many applications where input data are only available up