When computing the N point DFT of a P point signal with P<N, from what I underst

Q: When computing the N point DFT of a P point signal with P

Second one is the correct way to do DFT. Because in this method due to sampling process(fs > 2fm) no chance of aliasing. but in first method there is chance of aliasing due to zero pading.

ID: 3349315 • Letter: W

Question

When computing the N point DFT of a P point signal with P<N,

from what I understand there are 2 possibilities,

1) We can zero pad our original signal, and we can calculate the N point DFT of this new finite length(from now on N) signal.

or 2) We can use periodic extension to obtain a new periodic signal, and then calculate the DFT of this new periodic signal( which should be equivalent to computing the DTFT and then sampling it in frequency domain).

My question is, what are the differences between the 2 methods in terms of the acquired DFT, aliasing,...

Explanation / Answer

Second one is the correct way to do DFT. Because in this method due to sampling process(fs > 2fm) no chance of aliasing.

but in first method there is chance of aliasing due to zero pading.

Navigate

When computing standard cost variances, the difference between actual an standar

When computing the NPV of an investment opportunity, which of the following item

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

When computing the N point DFT of a P point signal with P<N, from what I underst

Question

Explanation / Answer

Related Questions

Navigate