2.13  Exercises

f
2.1.

A segment of an ECG signal $x[n]$ with six samples $[-1,0.6,0.5,1,2.5,2]$ must be encoded using a 3-point DCT (i. e., using two frames with three samples each). Find the DCT coefficients of these two vectors. Then, reconstruct an approximation of the two vectors assuming that only the first coefficient can be used while the other two are discarded (assumed to be zero). Confirm Eq. (2.24) calculating the norms of both error vectors ${\mathbf{\text{e}}}_t$ and ${\mathbf{\text{e}}}_f$.

f
2.2.

A segment of an ECG signal with four samples $[0.5,1,2.5,2]$ must be encoded using a 2-point DCT (i. e., using two frames with two samples each). The coefficients at the DCT domain must be quantized with 4 bits per frame, with the first coefficient (DC) being quantized with 3 bits and the other one with 1 bit. Both quantizers have a step of $\mathrm{\Delta }=0.5$ and their first output level is $0.25$. a) What is the decoded signal (after coding and decoding)? b) What is the mean squared-error? c) What is the SNR in dB? d) What is the bit rate in bps assuming $F_s=150$ Hz? e) What is the bit rate and SNR if the second coefficient is discarded (no bits are allocated for it and its value is assumed to be zero during decoding)?

f
2.3.

Consider that a block of pixels $\mathbf{\text{C}}=\left[\begin{array}{ccc}\hfill 120\hfill & \hfill 140\hfill & \hfill 139\hfill \\ \hfill 124\hfill & \hfill 220\hfill & \hfill 120\hfill \\ \hfill 114\hfill & \hfill 130\hfill & \hfill 122\hfill \end{array}\right]$ was extracted from an image. Calculate the bi-dimensional DCT and DFT first processing each row and organizing the result of this intermediate step as a matrix $\mathbf{\text{T}}$, then apply the transforms to each column of $\mathbf{\text{T}}$ to generate the final matrix. Follow this procedure to obtain a matrix with the DCT coefficients and then repeat it to obtain the DFT coefficients.

f
2.4.

Design a DCT-based image coding system that is capable of handling 24 bits/pixel color images and 8 bits/pixel black and white (B&W, also called gray) images, all with a size of 512 $\times$ 512 pixels. The system should operate using: a) 3 bits/pixel, b) 1 bit/pixel or c) 0.25 bit/pixel. For the three cases, provide the average peak SNR (PSNR), i. e., the SNR when assuming the “signal” in the numerator is an image with all pixels at the peak value of 255 and the denominator is the mean squared-error. The test sequence should be the colorful and B&W versions of the images Lenna, Peppers, Baboon, Splash and Tiffany, available in folder “Miscellaneous” from [ url2us2]. Do not download B&W versions of the five mentioned images, but make the conversion from color to B&W yourself and describe the conversion method you used. Hence, the test set will have 5 images. You can use as many images you want to compose your training set (distinct from the test set images). Provide the source code and a short report of your results that includes the average PSNR.

f
2.5.

Use the Gram-Schmidt procedure to find an orthonormal basis to represent the vectors in the set $C=\{[0,0,1],[0,1,0],[0,0,8],[0,5,0],[4,1,2],[0,0,3]\}$. Show also that any vector in $C$ can be written as a linear combination of the obtained basis vectors.

f
2.6.

KLT (or PCA) is the optimal linear transform for coding. But one needs to remember that PCA assumes the signal is zero mean. This exercise uses this fact to exemplify the importance of following the assumed model (in this case, that the signal is zero mean). Design a coding system for the data x below.

1N=100; %number of vectors 
2K=4;   %vector dimension 
3line=1:N*K; %straight line 
4noisePower=2; %noise power in Watts 
5temp=transpose(reshape(line,K,N)); %block signal 
6x=temp + sqrt(noisePower) * randn(size(temp)); %add (AWGN) noise 
7z=transpose(x); plot(z(:)) %prepare for plot

Because PCA / KLT does not model the mean, in practice, one needs to extract the mean from the data and later recover it for final reconstruction. And, eventually, one also normalizes the variances to be equal to one. This normalization is called in statistics to “z-transform” the data, but this term should not be confused with the Z transform.

f
2.7.

Generate $N=10,000$ samples from a bidimensional Gaussian $f_{{\mathbf{\text{X}}}_1,{\mathbf{\text{X}}}_2}(x_1,x_2)$ with mean $\widehat{\mu }={(30,-20)}^T$ and covariance matrix $\mathbf{\text{C}}=\left[\begin{array}{cc}\hfill 10\hfill & \hfill 0.99\hfill \\ \hfill 0.99\hfill & \hfill 40\hfill \end{array}\right]$. Obtain two transforms: ${\mathbf{\text{A}}}_g$ using Gram-Schmidt orthonormalization and ${\mathbf{\text{A}}}_p$ using PCA. You can remove means if useful. Using each transform, project the data into the new space and compute the variance of the coefficients in each dimension. Which transform you expect to lead to smaller variances of the transformed vectors?

f
2.8.

Following a scheme similar to the one presented in Application 2.3 - ECG Coding, compare the performance of KLT and DCT using a test set of at least 50 ECT records from the MIT-BIH Arrhythmia Database. Note that for performing any preparation / training you should use a training set, disjoint of the test set. Otherwise your results can be biased by the fact that you already knew what should be coded.

f
2.9.

Calculate “manually” the DFT of the sequence $x[n]=[2,0,2,0]$. Then use the fft function in Matlab/Octave and compare the results.

f
2.10.

What are the forward $\mathbf{\text{A}}$ and inverse ${\mathbf{\text{A}}}^H$ matrices for a 3-point orthonormal DFT?

f
2.11.

Consider that $s[n]$ was obtained by sampling with $F_s=100$ kHz an analog and periodic signal $s(t)$. The sampling theorem was obeyed. The 8-DFT of $s[n]$ was calculated in Matlab/Octave with fft(s)/N and is shown in Figure 2.49. The value $N$ was chosen to be an exact multiple of the fundamental period of $s(t)$ such that the problem of spurious components illustrated in Figure 2.42 did not occur. a) What is the frequency of each component of $s(t)$? b) What is the resolution $\mathrm{\Delta }f$ in Hz of this DFT? c) Find a reasonable expression for $s(t)$.

f
2.12.

Given that $\mathbf{\text{X}}=[8,0,0,0]$ was obtained with a 4-point orthonormal DFT, find its inverse $\mathbf{\text{x}}$. For the same spectrum, assuming that $F_s=10$ Hz, to which frequencies correspond the elements of $\mathbf{\text{X}}$?

f
2.13.

Consider that a periodic $x(t)$ was sampled with $F_s=20$ Hz, obeying the sampling theorem. A 128-point FFT was calculated using Matlab/Octave and the output $\mathbf{\text{X}}$ was normalized by $N=128$. The only non-zero coefficients were $k=0,3$ and 125, corresponding to the elements of $\mathbf{\text{X}}[1]=12$, $\mathbf{\text{X}}[4]=3+j4$ and $\mathbf{\text{X}}[126]=3-j4$, respectively. a) What is the frequency in Hz of the component with largest power of $x(t)$? b) what is the average (DC) value of $x(t)$? c) what is the spacing in Hz between neighboring elements of $\mathbf{\text{X}}$? d) what is the maximum frequency found in $x(t)$?

f
2.14.

Using the orthogonality condition of the basis functions derive the pair of Fourier series equations. To do that, recall how the inner product between complex signals is defined using the conjugate, and the normalization factor because the basis are not orthonormal.

f
2.15.

What are the Fourier series coefficients for the signal $x(t)=2+3\text{cos}<!--\; FUNCTION\; APPLICATION\; -->(2\pi 100t)+8\text{sin}<!--\; FUNCTION\; APPLICATION\; -->(2\pi 300t+\pi )+\text{cos}<!--\; FUNCTION\; APPLICATION\; -->(2\pi 50t-\pi )$?

f
2.16.

The bilateral Fourier series of a signal $x(t)$ with period $T_0=0.01$ s has non-zero coefficients $c_0=3$, $c_1=2e^{-j4}$, $c_4=5$, $c_{-1}=2e^{j4}$ and $c_{-4}=5$. What is the expression for $x(t)$?

f
2.17.

What is the Fourier transform of: a) $x(t)=\mathrm{\text{rect}}(t)$, b) $y(t)=4\mathrm{\text{rect}}(t-6)$ and c) $z(t)=5\mathrm{\text{rect}}((t-4)∕3)$?

f
2.18.

What is the Fourier transform of: a) $x(t)=\mathrm{\text{sinc}}(t)$, b) $y(t)=4\mathrm{\text{sinc}}(t-6)$ and c) $z(t)=5\mathrm{\text{sinc}}((t-4)∕3)$?

f
2.19.

Prove the expressions: a) for the DTFT of $x[n]=0.9^{n}u[n]+0.8^{n}u[n]$ and b) for its Z transform, indicating the ROC.

f
2.20.

Considering the range $\mathrm{\Omega }\in \left[-\pi ,\pi \right[$, the DTFT $H(e^{j\mathrm{\Omega }})$ of a signal is 1 when $-{\mathrm{\Omega }}_c\le \mathrm{\Omega }\le {\mathrm{\Omega }}_c$ and 0 otherwise (i. e., an ideal low-pass filter). Find its inverse DTFT $h[n]$ indicating all steps in this proof.

f
2.21.

Prove that $X(e^{j\mathrm{\Omega }})={\sum <!--\; FUNCTION\; APPLICATION\; -->}_{k=-\infty }^{\infty }2\mathit{\pi \delta }(\mathrm{\Omega }-{\mathrm{\Omega }}_0+2\mathit{\pi k})$ is the DTFT of $x[n]=e^{j{\mathrm{\Omega }}_{0}n}$ and indicate when the impulse sifting property is used. Using the result, carefully draw the graph of the real part of the DTFT of $y[n]=3+4e^{\mathit{j\pi n}}$ for the range $-3\pi \le \mathrm{\Omega }\le 3\pi$.

f
2.22.

Prove the cited properties of the Fourier tools for the case of the Fourier transform.

f
2.23.

Prove the cited Fourier pairs for the case of the DTFT.

f
2.24.

A right-sided signal has Laplace transform $X(s)=5∕(s^2+2s+10)$, with ROC $\sigma >-1$. Calculate: a) $X(s){|}_{s=2}$, b) the corresponding Fourier transform $X(\omega )$ if it exists and c) if $X(\omega )$ exists, $|X(\omega )|$ for $\omega =3$ rad/s.

f
2.25.

A signal $x(t)$ has Laplace transform $X(s)=(3s+2)∕((s-1)(s-3))$, with ROC $\sigma <1$. Find $x(t)$.

f
2.26.

A signal $x[n]$ has Z transform $X(z)=(5z^2+4z+3)∕((z-0.7)(z-0.8))$, with ROC $|z|>0.8$. Find $x[n]$.

f
2.27.

Find the Z transform and associated ROC of the signal $x[n]=-3^{n}u[-n-1]$. Does this signal have a DTFT?

f
2.28.

What is the Z transform $X(z)$ of the signal $x[n]=4\delta [n]+5\delta [n-11]$? What are the values of $X(z)$ for $z=0,-1$ and $z=8e^{\mathit{j\pi }}$? If the DTFT of $x[n]$ exists, what are its values for $\mathrm{\Omega }=0,\pi$ and $2\pi$ rad?