An approach to fast transform coding in software

Techniques for fast image transform coding on 32-bit processors are described. The Reparameterized Suehiro Transform is used to avoid multiplication; then two 16-bit arithmetic computations are accomplished simultaneously with ‘paired arithmetic’. This reduces the effective cost of the 8-point DCT-I...

Full description

Saved in:
Bibliographic Details
Published inSignal processing. Image communication Vol. 8; no. 1; pp. 3 - 11
Main Author Allen, James D.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 1996
Subjects
Discrete Cosine Transform
Fast transform
Image compression
Parallel arithmetic
Transform coding
Image compression
Discrete Cosine Transform
Fast transform
Transform coding
Parallel arithmetic
Online AccessGet full text

Cover

More Information
Summary:Techniques for fast image transform coding on 32-bit processors are described. The Reparameterized Suehiro Transform is used to avoid multiplication; then two 16-bit arithmetic computations are accomplished simultaneously with ‘paired arithmetic’. This reduces the effective cost of the 8-point DCT-III to about 11 additions, 9 subtractions and 15 shifts. With these techniques the Sun Sparcstation can perform JPEG compression and decompression at rates of 45 and 80 million pixels per minute respectively.
ISSN:0923-5965
1879-2677
DOI:10.1016/0923-5965(94)00047-6