跳到主要内容

京都大学 情報学研究科 知能情報学専攻 2025年8月実施 専門科目 S-4

Author

itsuitsuki

Description (English)

In the questions below, ()(\cdot)^*, ()T(\cdot)^{\mathrm{T}}, and E[]E[\cdot] denote the complex conjugate, the transpose, and the expectation, respectively. R\mathbb{R} and Z\mathbb{Z} denote the set of all real numbers and the set of all integers, respectively.

Q.1

Let x(n)x(n) be a discrete-time signal with the index of nZn \in \mathbb{Z}, and define the zz-transform of x(n)x(n) as

X(z)=n=x(n)zn,()X(z) = \sum_{n=-\infty}^{\infty} x(n)z^{-n}, \quad\quad (*)

where zz is a complex variable. Moreover, define the region of convergence of the zz-transform X(z)X(z) as a set of zz such that the series in the right-hand side of Eq. ()(*) is absolutely convergent. Answer the following questions.

(1) Derive the zz-transform and its region of convergence of a discrete-time signal

x1(n)={ann00n<0,x_1(n) = \begin{cases} a^n & n \geq 0 \\ 0 & n < 0 \end{cases},

where aRa \in \mathbb{R} and a0=1a^0 = 1.

(2) Derive the discrete-time signal x2(n)x_2(n), whose zz-transform is given by

X2(z)=1(114z1)(112z1),X_2(z) = \frac{1}{\left(1 - \frac{1}{4}z^{-1}\right) \left(1 - \frac{1}{2}z^{-1}\right)},

where the region of convergence is 14<z<12\frac{1}{4} < |z| < \frac{1}{2}.

(3) Assume that the zz-transform and its region of convergence of a discrete-time signal x3(n)x_3(n) are given by X3(z)X_3(z) and R3\mathcal{R}_3, respectively. Express the zz-transform of a discrete-time signal x3(nk)x_3^*(n - k) for some kZk \in \mathbb{Z} using X3(z)X_3(z). Moreover, answer whether the region of convergence of the zz-transform of x3(nk)x_3^*(n - k) is identical to R3\mathcal{R}_3 or not with reasons.

Q.2

Consider a filter of NN taps, whose output signal with the index of nZn \in \mathbb{Z} is given by

y(n)=xT(n)h,y(n) = \boldsymbol{x}^{\mathrm{T}}(n)\boldsymbol{h},

where

x(n)=[x(n) x(n1)  x(nN+1)]TRN,h=[h(0) h(1)  h(N1)]TRN\boldsymbol{x}(n) = [x(n) \ x(n - 1) \ \dots \ x(n - N + 1)]^{\mathrm{T}} \in \mathbb{R}^N,\\ \boldsymbol{h} = [h(0) \ h(1) \ \dots \ h(N - 1)]^{\mathrm{T}} \in \mathbb{R}^N

are the input signal vector and the filter coefficient vector, respectively. Let the input signal x(n)x(n) and the desired signal d(n)d(n) be real-valued wide-sense stationary discrete-time random processes. We assume that E[x(n)xT(n)]E[\boldsymbol{x}(n)\boldsymbol{x}^{\mathrm{T}}(n)], E[d(n)x(n)]E[d(n)\boldsymbol{x}(n)], and E[d2(n)]E[d^2(n)] can be expressed as R=E[x(n)xT(n)]\boldsymbol{R} = E[\boldsymbol{x}(n)\boldsymbol{x}^{\mathrm{T}}(n)], p=E[d(n)x(n)]\boldsymbol{p} = E[d(n)\boldsymbol{x}(n)], and σ2=E[d2(n)]\sigma^2 = E[d^2(n)], respectively.

Moreover, we define the mean-squared error between y(n)y(n) and d(n)d(n) as

J(h)=E[{d(n)y(n)}2].J(\boldsymbol{h}) = E \left[ \{d(n) - y(n)\}^2 \right].

Answer the following questions.

(1) Express J(h)J(\boldsymbol{h}) using R,p,σ2\boldsymbol{R}, \boldsymbol{p}, \sigma^2, and h\boldsymbol{h}.

(2) Derive the equation that the filter coefficient vector h\boldsymbol{h} satisfies to minimize J(h)J(\boldsymbol{h}) (Wiener-Hopf equation).