|
|
Subject:
Computing DCT coefficients using DFT.
Category: Reference, Education and News > Homework Help Asked by: budday-ga List Price: $10.00 |
Posted:
24 Nov 2006 15:27 PST
Expires: 24 Dec 2006 15:27 PST Question ID: 785334 |
For signal u[n],n=0,1,....N-1, show that its DCT coefficients w[k],k=0,1,...N-1 can be computed as follows: w[k]=sqrt[2(2-del[k])]R{e to the power-j(pi)k/2N v'[k]}where del[k] is the Kronecker Delta, R denotes the real part of a complex number and v'[k]is the Unitary DFT coefficient for signal u'[n] belongs to R to the power 2N defined as follows: Transpose of(u')=[u[0]u[1].....u[N-1]00...0],i.e u'is the zero padded version(upto length 2N)of u. Based on the above derivation, describe steps needed to implement fast DCT using FFT. |
|
There is no answer at this time. |
|
There are no comments at this time. |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |