Digital Signal Processing · DFT, FFT, and spectral leakage
Reuse the length-8 sequence x=(1,2,3,4,0,0,0,0) of the previous packet
Problem
Digital Signal Processing practice problemReuse the length- sequence of the previous packet. Fix the DFT bin , so the resonator frequency is . The Goertzel state is initialized by and, because , reduces toDefine the complex combination1. Compute the eight samples and prove that they are
.
2. Evaluate and prove . Using the already-known DFT value
from the eight-point transform, prove the phase identitiesand therefore .
3. Compare with and compare with .
Conclude that omitting the phase factor keeps the magnitude of the bin and destroys the phase.
4. Audit both sentences: (i) “the general Goertzel recurrence keeps the
middle term even though , or the state sequence is just itself”; (ii) “ already equals , so no phase correction is required.”
Do not replace the calculation by any of the six stated Digital Signal Processing seed exercises.
Hint
HintWith the recurrence produces .
Check your work
Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.
The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Digital Signal Processing sample problem: Try the free sample problem.
More Digital Signal Processing practice problems
- Let x[n]=cos(πn/3) for n ∈ ℤ, and let L=3Sampling, multirate, and polyphase processing
- Work throughout with sampling period T=1FIR and IIR filter design