Xref: utzoo comp.dsp:635 comp.graphics:11285
Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!usc!randvax!edhall@rand.org
From: edhall@rand.org (Ed Hall)
Newsgroups: comp.dsp,comp.graphics
Subject: Fast Discrete Cosine Transforms, Anyone?
Summary: Can anyone point me to some code for this?
Keywords: Fast DCT routines
Message-ID: <2529@randvax.UUCP>
Date: 1 May 90 22:44:02 GMT
Sender: edhall@randvax.UUCP
Reply-To: edhall@rand.org
Organization: The RAND Corporation, Santa Monica, CA  90406
Lines: 16

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.

I already know about using FFT's for this purpose; this is not
what I'm talking about.  The FCT is supposed to be considerably
more efficient.

Any pointers?  I'm working in C, although I'd be happy with code
in just about any language.  And, if there is other interest in
this sort of thing, I'll be happy to pass along any suggestions.

		-Ed Hall
		edhall@rand.org