• retagged by
746 views
1 1 vote
Let $h[n]$ be a length – $7$ discrete-time finite impulse response filter, given by

$$h[0]=4, \quad h[1]=3,\quad h[2]=2,\quad h[3]=1,$$

$$\quad h[-1]=-3, \quad h[-2]=-2, \quad h[-3]=-1,$$

and $h[n]$ is zero for $|n|\geq4.$ A length – $3$ finite impulse response approximation $g[n]$ of $h[n]$ has to be obtained such that

$$E(h,g)=\int_{-\pi}^{\pi} \mid H(e^{j\omega})-G(e^{j\omega}) \mid^{2}d\omega$$

in minimized where $H(e^{j\omega})$ and $G(e^{j\omega})$ are the discrete-time Fourier transforms of $h[n]$ and $g[n],$ respectively. For the filter that minimizes $E(h,g),$ the value of $10g[-1]+g[1],$ rounded off to $2$ decimal places, is __________.

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
487
487 views
Arjun asked Feb 12, 2019
487 views
Let $H(z)$ be the $z-$ transform of a real-valued discrete-time signal $h[n].$ If $P(z) = H(z) H(\frac{1}{z})$ has a zero at $z= \frac{1}{2}+\frac{1}{2}j,$ and $P(z)$ has...
0 0 votes
0 0 answers
661
661 views
Arjun asked Feb 12, 2019
661 views
For an LTI system, the Bode plot for its gain is as illustrated in the figure shown. The number of system poles $N_{p}$ and the number of system zeros $N_{z}$ in the fre...
0 0 votes
0 0 answers
981
981 views
Arjun asked Feb 12, 2019
981 views
Consider a six-point decimation-in-time Fast Fourier Transform $(FFT)$ algorithm, for which the signal-flow graph corresponding to $X $ is shown in the figure. Let $W_{6}...
0 0 votes
0 0 answers
578
578 views
Arjun asked Feb 12, 2019
578 views
Let the state-space representation of an LTI system be $x(t)=A x(t)+B u(t), y(t)=Cx(t)+du(t)$ where $A,B,C$ are matrices, $d$ is a scalar, $u(t)$ is the input to the syst...

Add Synced Question

×