Fast Discrete Cosine Transforms, Anyone?

Thread View: comp.dsp

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Ed Hall Tue, 01 May 1990 22:44

#777

Author: Ed Hall
Date: Tue, 01 May 1990 22:44

16 lines
1194 bytes

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

Re: Fast Discrete Cosine Transforms, Anyone?

#778

Author: 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.

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads