Re: Fast Discrete Cosine Transforms, Anyone?

Article View: comp.dsp

Article #778

#778

From: Patrick L. Reilly
Date: Thu, 03 May 1990 19:02

11 lines
949 bytes

edhall@rand.org (Ed Hall) writes:

: I need a fast discrete cosine transform routine for an image-
: compression program.  Although I have a description of the fast DCT
: [IEEE Trans.  Comm.  Nov. 1977 & Jan. 1983], coding it is decidedly
: non-trivial and I'd rather if someone could point me at an existing
: implementation.

A good place to start is the IEEE Press book, Programs for Digital
Signal Processing. Lots of good pieces of code that exploit
symmetry.

Technical Details

Message-ID: <2767@graphite2.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!uunet!motcid!reilly

References: <2529@randvax.UUCP>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!uunet!motcid!reilly
From: reilly@motcid.UUCP (Patrick L. Reilly)
Newsgroups: comp.dsp,comp.graphics
Subject: Re: Fast Discrete Cosine Transforms, Anyone?
Keywords: Fast DCT routines
Message-ID: <2767@graphite2.UUCP>
Date: 3 May 90 19:02:02 GMT
References: <2529@randvax.UUCP>
Reply-To: motcid!reillyp@uunet.uu.net
Organization: Motorola Inc., Cellular Infrastructure Div., Arlington Heights, IL
Lines: 11

Reply to Parent Message