There are 4 messages in this thread.
You are currently looking at messages 0 to 4.
Dear All, I have DCT by B.G.Lee paper with me. I want to know whether source code for this algorithm is available on web?. If available where can I get ?. Regards, Ramya.______________________________
What about this:
#define M_PI 3.14159265358979323846
long bin,k;
double arg;
for (bin = 0; bin < transformLength; bin++) {
transformData[bin] = 0.;
for (k = 0; k < transformLength; k++) {
arg = (float)bin * M_PI *(float)k / (float)transformLength;
transformData[bin] += inputData[k] * cos(arg);
}
}
Modified from http://www.dspdimension.com
--smb
r...@yahoo.com (Ramya) wrote in message news:<3...@posting.google.com>...
> Dear All,
>
> I have DCT by B.G.Lee paper with me. I want to know whether source
> code for this algorithm is available on web?.
>
> If available where can I get ?.
>
> Regards,
> Ramya.
______________________________Did you pay royalties for that, Stephan?? :-) Ciao, Peter K. -- Peter J. Kootsookos "I will ignore all ideas for new works [..], the invention of which has reached its limits and for whose improvement I see no further hope." - Julius Frontinus, c. AD 84______________________________
Well, I think so... :-) Cheers, Stephan p...@remove.ieee.org (Peter J. Kootsookos) wrote in message news: > > Did you pay royalties for that, Stephan?? :-) > > Ciao, > > Peter K.______________________________