Find an efficient procedure to compute the discrete cosine & sin transforms using fft

**drewprogden** · October 5th 2011, 05:36 PM

Can't figure this out to save my life. Please help if possible

Consider the discrete cosine and sine transforms of a real sequence of numbers
${x_j, j=0,....,2N-1}$

$C_k = \sum_{j=0}^{2N-1} x_j cos(\frac{jk\pi}{N}),$
$S_k = \sum_{j=0}^{2N-1} x_j sin(\frac{jk\pi}{N})$

Find an efficient procedure to compute $C_k, S_k$ using a Fast Fourier Transform of $\{x_j, j=0,...2N-1\}$ .

Can someone give me a hint/explain to me the way to go about doing this problem? I am completely lost. Thanks!

**CaptainBlack** · October 6th 2011, 10:56 PM

Originally Posted by drewprogden

Can't figure this out to save my life. Please help if possible

Consider the discrete cosine and sine transforms of a real sequence of numbers
${x_j, j=0,....,2N-1}$

$C_k = \sum_{j=0}^{2N-1} x_j cos(\frac{jk\pi}{N}),$
$S_k = \sum_{j=0}^{2N-1} x_j sin(\frac{jk\pi}{N})$

Find an efficient procedure to compute $C_k, S_k$ using a Fast Fourier Transform of $\{x_j, j=0,...2N-1\}$ .

Can someone give me a hint/explain to me the way to go about doing this problem? I am completely lost. Thanks!

What is the real part of the DFT of a real sequence? What is the imaginary part?

CB

Thread: Find an efficient procedure to compute the discrete cosine & sin transforms using fft

LinkBack

Thread Tools

Display

Find an efficient procedure to compute the discrete cosine & sin transforms using fft

Re: Find an efficient procedure to compute the discrete cosine & sin transforms using

Similar Math Help Forum Discussions

[SOLVED] Not sure of the procedure to find the volume of a solid for a function

Mathematica and Discrete Fourier Transforms

Discrete Fourier Transforms as Descriptors

Discrete Cosine Transform

...Find the most efficient way to build this box...

Search Tags