跳到主要内容

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

Author

itsuitsuki

Description

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).

题目描述

以下 ()(\cdot)^*()T(\cdot)^{\mathrm T}E[]E[\cdot] 分别表示复共轭、转置和期望;R\mathbb RZ\mathbb Z 分别表示实数集与整数集。

  1. x(n)x(n) 为下标 nZn\in\mathbb Z 的离散时间信号,其 zz 变换定义为

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

    其中 zz 是复变量。X(z)X(z) 的收敛域定义为使式 ()(*) 右端级数绝对收敛的所有 zz 构成的集合。

    (1)求离散时间信号

    x1(n)={an(n0),0(n<0),x_1(n)= \begin{cases} a^n & (n\geq0),\\ 0 & (n<0), \end{cases}

    zz 变换及其收敛域,其中 aRa\in\mathbb Ra0=1a^0=1

    (2)已知

    X2(z)=1(114z1)(112z1)X_2(z)= \frac{1} {\left(1-\frac14z^{-1}\right) \left(1-\frac12z^{-1}\right)}

    的收敛域为

    14<z<12,\frac14<|z|<\frac12,

    求其对应的离散时间信号 x2(n)x_2(n)

    (3)设离散时间信号 x3(n)x_3(n)zz 变换及其收敛域分别为 X3(z)X_3(z)R3\mathcal R_3。对任意 kZk\in\mathbb Z,用 X3(z)X_3(z) 表示 x3(nk)x_3^*(n-k)zz 变换;并说明该变换的收敛域是否与 R3\mathcal R_3 相同及其理由。

  2. 考虑一个 NN 抽头滤波器,其输出为

    y(n)=xT(n)h,nZ,y(n)=\boldsymbol{x}^{\mathrm T}(n)\boldsymbol h,\qquad n\in\mathbb Z,

    其中输入信号向量和滤波器系数向量分别为

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

    设输入信号 x(n)x(n) 与期望信号 d(n)d(n) 是实值广义平稳离散时间随机过程,并记

    R=E[x(n)xT(n)],p=E[d(n)x(n)],σ2=E[d2(n)].\boldsymbol R =E[\boldsymbol{x}(n)\boldsymbol{x}^{\mathrm T}(n)],\qquad \boldsymbol p =E[d(n)\boldsymbol{x}(n)],\qquad \sigma^2=E[d^2(n)].

    输出 y(n)y(n) 与期望信号 d(n)d(n) 之间的均方误差定义为

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

    (1)用 R,p,σ2,h\boldsymbol R,\boldsymbol p,\sigma^2,\boldsymbol h 表示 J(h)J(\boldsymbol h)

    (2)推导使 J(h)J(\boldsymbol h) 最小的滤波器系数向量 h\boldsymbol h 所满足的方程,即 Wiener–Hopf 方程。

考点

  • 双边 zz 变换与收敛域:根据右边、左边序列形式确定有理变换对应的环形收敛域。
  • 移位与共轭性质:推导时间移位、复共轭对 zz 变换表达式和收敛域的影响。
  • Wiener 滤波:展开均方误差的二次型并对系数向量求梯度。
  • Wiener–Hopf 方程:利用输入自相关矩阵和互相关向量刻画最小均方误差解。