Question: In the Goertzel algorithm for computation of the discrete Fourier transform, X[k] is computed as X[k] = Yk[n], where yk[n] is the output of the
In the Goertzel algorithm for computation of the discrete Fourier transform, X[k] is computed as X[k] = Yk[n], where yk[n] is the output of the network shown in Figure. Consider the implementation of the Goertzel algorithm using fixed-point arithmetic with rounding. Assume that the register length is B bits plus the sign, and assume that the products are rounded before additions. Also, assume that round-off noise sources are independent.
(a) Assuming that x[n] is real, draw a flow graph of the linear ?noise model for the finite-precision computation of the real and imaginary parts of x[k]. Assume that multiplication by ? 1 produces no round-off noise.
(b) Compute the variance of the round-off noise t=in both the real part and the imaginary part of X[n].
![x[r] valr) 2cos](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2022/11/636a5080403ef_808636a508030827.jpg)
x[r] valr) 2cos
Step by Step Solution
3.42 Rating (161 Votes )
There are 3 Steps involved in it
a b We separate the system function Hz into tw... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
30-E-T-E-D-S-P (425).docx
120 KBs Word File
