Skip to main content

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 problem

Reuse the length-88 sequence x=(1,2,3,4,0,0,0,0)x=(1,2,3,4,0,0,0,0) of the previous packet. Fix the DFT bin k=2k=2, so the resonator frequency is ω=2πk/N=π/2\omega=2\pi k/N=\pi/2. The Goertzel state is initialized by q[−2]=q[−1]=0q[-2]=q[-1]=0 and, because 2cos⁡ω=02\cos\omega=0, reduces toq[n]=x[n]−q[n−2],n=0,1,…,7.q[n]=x[n]-q[n-2],\qquad n=0,1,\ldots,7.Define the complex combinationG=q[7]−e−jωq[6].G=q[7]-e^{-j\omega}q[6].1. Compute the eight samples q[0],…,q[7]q[0],\ldots,q[7] and prove that they are
(1,2,2,2,−2,−2,2,2)(1,2,2,2,-2,-2,2,2).

2. Evaluate GG and prove G=2+2jG=2+2j. Using the already-known DFT value
X[2]=−2+2jX[2]=-2+2j from the eight-point transform, prove the phase identitiesG=ej(N−1)ωX[2]=e−jωX[2]G=e^{j(N-1)\omega}X[2]=e^{-j\omega}X[2]and therefore X[2]=ejωGX[2]=e^{j\omega}G.

3. Compare ∣G∣|G| with ∣X[2]∣|X[2]| and compare arg⁡G\arg G with arg⁡X[2]\arg X[2].
Conclude that omitting the phase factor ejωe^{j\omega} keeps the magnitude of the bin and destroys the phase.

4. Audit both sentences: (i) “the general Goertzel recurrence keeps the
middle term 2cos⁡ω q[n−1]2\cos\omega\,q[n-1] even though ω=π/2\omega=\pi/2, or the state sequence is just xx itself”; (ii) “GG already equals X[2]X[2], so no phase correction is required.”

Do not replace the calculation by any of the six stated Digital Signal Processing seed exercises.

Hint

Hint

With q[−2]=q[−1]=0q[-2]=q[-1]=0 the recurrence q[n]=x[n]−q[n−2]q[n]=x[n]-q[n-2] produces 1,2,3−1,4−2,0−2,0−2,0−(−2),0−(−2)1,2,3-1,4-2,0-2,0-2,0-(-2),0-(-2).

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