离散时间信号处理 Ch11:离散希尔伯特变换
最后更新时间:
文章总字数:
预计阅读时间:
上一篇:利用离散傅里叶变换的信号傅里叶分析本文是“离散时间信号处理”系列的第 11 章,主题为“离散希尔伯特变换”。
离散希尔伯特变换
因果序列傅里叶变换实部和虚部的充分性
任何序列都可以表示成一个偶序列和一个奇序列之和, 即
\[ x[n]=x_e[n]+x_o[n] \]其中
\[ x_e[n]=\frac{x[n]+x[-n]}{2} \]
\[ x_o[n]=\frac{x[n]-x[-n]}{2} \]若\(x[n]\)为因果的, 则可以从\(x_e[n]\)或\(x_o[n]\)中恢复\(x[n]\), 即
\[ x[n]=2x_e[n]u[n]-x_e[0]\delta[n] \]
\[ x[n]=2x_o[n]u[n]+x[0]\delta[n] \]
\(x[n]\)的傅里叶变换可表示为
\[ X(e^{j\omega})=X_R(e^{j\omega})+jX_I(e^{j\omega}) \]其中\(X_R(e^{j\omega})\)和\(X_I(e^{j\omega})\)分别是\(X(e^{j\omega})\)的实部和虚部, 根据傅里叶变换的对称性可得
序列 傅里叶变换 \(x(n)\) \(X(e^{j\omega})\) \(x_e(n)\) \(X_R(e^{j\omega})\) \(x_o(n)\) \(jX_I(e^{j\omega})\)
离散希尔伯特变换关系式
\[ X_I(e^{j\omega})=-\frac{1}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\cot\left(\frac{\omega-\theta}{2}\right)\mathrm{d}\theta \]
\[ X_R(e^{j\omega})=x[0]+\frac{1}{2\pi}\int_{-\pi}^{\pi}X_I(e^{j\theta})\cot\left(\frac{\omega-\theta}{2}\right)\mathrm{d}\theta \]
离散希尔伯特变换关系式的推导
令\(U(e^{j\omega})\)是单位阶跃序列\(u[n]\)的傅里叶变换, 可表示为
\[ \begin{aligned} U(e^{j\omega})&=\frac{1}{1-e^{-j\omega}}+\sum_{k=-\infty}^{\infty}\pi\delta(\omega-2\pi k)\\ &=\frac{e^{j\omega/2}}{e^{j\omega/2}-e^{-j\omega/2}}+\sum_{k=-\infty}^{\infty}\pi\delta(\omega-2\pi k)\\ &=\frac{\cos\dfrac{\omega}{2}+j\sin\dfrac{\omega}{2}}{2j\sin\dfrac{\omega}{2}}+\sum_{k=-\infty}^{\infty}\pi\delta(\omega-2\pi k)\\ &=\dfrac{1}{2}-\dfrac{j}{2}\cot\dfrac{\omega}{2}+\sum_{k=-\infty}^{\infty}\pi\delta(\omega-2\pi k)\\ \end{aligned} \]已知时域关系\(x[n]=2x_e[n]u[n]-x_e[0]\delta[n]\), 两边进行傅里叶变换得
\[ \begin{aligned} X(e^{j\omega})=&2\cdot\frac{1}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})U(e^{j(\omega-\theta)})\mathrm{d}\theta-x[0]\\ =&\frac{1}{\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\left[\dfrac{1}{2}-\dfrac{j}{2}\cot\left(\dfrac{\omega-\theta}{2}\right)+\sum_{k=-\infty}^{\infty}\pi\delta(\omega-\theta-2\pi k)\right]\mathrm{d}\theta-x[0]\\ =&\frac{1}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\mathrm{d}\theta-\dfrac{j}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\cot\left(\dfrac{\omega-\theta}{2}\right)\mathrm{d}\theta+\\ &\int_{-\pi}^{\pi}X_R(e^{j\theta})\sum_{k=-\infty}^{\infty}\delta(\omega-\theta-2\pi k)\mathrm{d}\theta-x[0] \end{aligned} \]注意到
\[ \frac{1}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\mathrm{d}\theta=x[n]\big|_{n=0}=x[0] \]
\[ \int_{-\pi}^{\pi}X_R(e^{j\theta})\sum_{k=-\infty}^{\infty}\delta(\omega-\theta-2\pi k)\mathrm{d}\theta=\int_{-\pi}^{\pi}X_R(e^{j\theta})\delta(\omega-\theta)\mathrm{d}\theta=X_R(e^{j\omega}) \]因此可以得到
\[ \begin{aligned} X(e^{j\omega})&=-\dfrac{j}{2\pi}\int_{-\pi}^{\pi}X_R(e^{j\theta})\cot\left(\dfrac{\omega-\theta}{2}\right)\mathrm{d}\theta+X_R(e^{j\omega})\\ &=X_R(e^{j\omega})+jX_I(e^{j\omega}) \end{aligned} \]由此推得离散希尔伯特变换关系式
\[ X_I(e^{j\omega})=-\dfrac{1}{2\pi}\displaystyle\int_{-\pi}^{\pi}X_R(e^{j\theta})\cot\left(\dfrac{\omega-\theta}{2}\right)\mathrm{d}\theta \]
有限长序列的充分性定理
考虑一个周期为\(N\)的周期序列\(\tilde{x}[n]\), 它与长度为\(N\)的有限长序列的关系为
\[ \tilde{x}[n]=x[((n))_N] \]\(\tilde{x}[n]\)在一个周期内可以表示成一个偶序列和一个奇序列之和, 即
\[ \tilde{x}[n]=\tilde{x}_e[n]+\tilde{x}_o[n],n=0,1,\cdots,(N-1) \]其中
\[ \tilde{x}_e[n]=\frac{\tilde{x}[n]+\tilde{x}[-n]}{2},n=0,1,\cdots,(N-1) \]
\[ \tilde{x}_o[n]=\frac{\tilde{x}[n]-\tilde{x}[-n]}{2},n=0,1,\cdots,(N-1) \]
定义“周期因果”序列: 当\(\dfrac{N}{2}<n<N\)时, \(\tilde{x}[n]=0\), 则\(\tilde{x}[n]\)在后半周期内为0.
周期因果序列\(\tilde{x}[n]\)可表示为
\[ \tilde{x}[n]= \begin{cases} 2\tilde{x}_e[n] & n=1,2,\cdots,\dfrac{N}{2}-1\\[8pt] \tilde{x}_e[n] & n=0,\dfrac{N}{2}\\[8pt] 0 & n=\dfrac{N}{2}+1,\cdots,N-1 \end{cases} \]
\[ \tilde{x}[n]= \begin{cases} 2\tilde{x}_o[n] & n=1,2,\cdots,\dfrac{N}{2}-1\\[8pt] 0 & n=\dfrac{N}{2}+1,\cdots,N-1 \end{cases} \]定义周期序列
\[ \tilde{u}_N[n]= \begin{cases} 2 & n=1,2,\cdots,\dfrac{N}{2}-1\\[8pt] 1 & n=0,\dfrac{N}{2}\\[8pt] 0 & n=\dfrac{N}{2}+1,\cdots,N-1 \end{cases} \]则当\(N\)为偶数时, \(\tilde{x}[n]\)可表示成
\[ \tilde{x}[n]=\tilde{x}_e[n]\tilde{u}_N[n] \]
\[ \tilde{x}[n]=\tilde{x}_o[n]\tilde{u}_N[n]+x[0]\tilde{\delta}[n]+x\left[\frac{N}{2}\right]\tilde{\delta}\left[n-\frac{N}{2}\right] \]其中\(\tilde{\delta}[n]\)是周期为\(N\)的周期单位脉冲序列.
周期因果序列DFS实部和虚部之间的关系
\[ j\tilde{X}_I[k]=\frac{1}{N}\sum_{m=0}^{N-1}\tilde{X}_R[m]\tilde{V}_N[k-m] \]
\[ \tilde{X}_R[k]=\frac{1}{N}\sum_{m=0}^{N-1}j\tilde{X}_I[m]\tilde{V}_N[k-m]+\tilde{x}[0]+(-1)^{k}\tilde{x}\left[\frac{N}{2}\right] \]
周期因果序列DFS实部和虚部关系的推导
令\(\tilde{U}_N[k]\)是序列\(\tilde{u}_N[n]\)的DFS, 可表示为
\[ \begin{aligned} \tilde{U}_N[k]&=\begin{cases} N & k=0\\[2pt] -j2\cot\dfrac{\pi k}{N} & k\text{为奇数}\\[2pt] 0 & k\text{为偶数} \end{cases}\\ &=\tilde{V}_N[k]+N\tilde{\delta}[k] \end{aligned} \]其中
\[ \tilde{V}_N[k]= \begin{cases} -j2\cot\dfrac{\pi k}{N} & k\text{为奇数}\\[2pt] 0 & k\text{为偶数} \end{cases} \]已知时域关系\(\tilde{x}[n]=\tilde{x}_e[n]\tilde{u}_N[n]\), 两边进行DFS得
\[ \begin{aligned} \tilde{X}[k]&=\tilde{X}_R[k]+j\tilde{X}_I[k]\\ &=\frac{1}{N}\sum_{m=0}^{N-1}\tilde{X}_R[m]\tilde{U}_N[k-m]\\ &=\tilde{X}_R[k]+\frac{1}{N}\sum_{m=0}^{N-1}\tilde{X}_R[m]\tilde{V}_N[k-m] \end{aligned} \]由此可以推得
\[ j\tilde{X}_I[k]=\frac{1}{N}\sum_{m=0}^{N-1}\tilde{X}_R[m]\tilde{V}_N[k-m] \]
幅度和相位间的关系
因果序列\(x[n]\)的复倒谱\(\hat{x}[n]\)满足
\[ \begin{aligned} x[n]&\stackrel{\mathcal{F}}{\leftrightarrow}X(e^{j\omega})=|X(e^{j\omega})|e^{j\arg[X(e^{j\omega})]}\\ \hat{x}[n]&\stackrel{\mathcal{F}}{\leftrightarrow}\hat{X}(e^{j\omega}) \end{aligned} \]其中
\[ \hat{X}(e^{j\omega})=\log[X(e^{j\omega})]=\log|X(e^{j\omega})|+j\arg[X(e^{j\omega})] \]若\(\hat{x}[n]\)是因果的, 则\(\hat{X}(e^{j\omega})\)的实部和虚部分别为\(\log|X(e^{j\omega})|\)和\(\arg[X(e^{j\omega})]\), 且满足
\[ \arg[X(e^{j\omega})]=-\frac{1}{2\pi}\int_{-\pi}^{\pi}\log|X(e^{j\theta})|\cot\left(\frac{\omega-\theta}{2}\right)\mathrm{d}\theta \]
\[ \log|X(e^{j\omega})|=\hat{x}[0]+\frac{1}{2\pi}\int_{-\pi}^{\pi}\arg[X(e^{j\theta})]\cot\left(\frac{\omega-\theta}{2}\right)\mathrm{d}\theta \]其中
\[ \hat{x}[0]=\frac{1}{2\pi}\int_{-\pi}^{\pi}\log|X(e^{j\omega})|\mathrm{d}\omega \]
复序列的希尔伯特变换关系
若\(x[n]\)表示某序列, 其傅里叶变换满足
\[ X(e^{j\omega})=0,-\pi\leq\omega<0 \]则\(x[n]\)必须是复数, 因为若\(x[n]\)为实数, 则\(X(e^{j\omega})\)必须是共轭对称的, 即\(X(e^{j\omega})=X^*(e^{-j\omega})\).
\(x[n]\)可表示为
\[ x[n]=x_r[n]+jx_i[n] \]若\(X_r(e^{j\omega})\)和\(X_i(e^{j\omega})\)分别表示实序列\(x_r[n]\)和\(x_i[n]\)的傅里叶变换, 则
\[ X(e^{j\omega})=X_r(e^{j\omega})+jX_i(e^{j\omega}) \]根据傅里叶变换的对称性可得
序列 傅里叶变换 \(x(n)\) \(X(e^{j\omega})\) \(x_r(n)\) \(X_r(e^{j\omega})\) \(jx_i(n)\) \(jX_i(e^{j\omega})\) 其中
\[ X_r(e^{j\omega})=\frac{X(e^{j\omega})+X^*(e^{-j\omega})}{2}=X_r^*(e^{-j\omega})\quad\text{(共轭对称)} \]
\[ jX_i(e^{j\omega})=\frac{X(e^{j\omega})-X^*(e^{-j\omega})}{2}=-jX_i^*(e^{-j\omega})\quad\text{(共轭反对称)} \]
\(X(e^{j\omega})\)可以由\(X_r(e^{j\omega})\)和\(X_i(e^{j\omega})\)完全恢复, 即
\[ X(e^{j\omega})= \begin{cases} 2X_r(e^{j\omega}) & 0<\omega<\pi\\ 0 & -\pi\leq\omega<0 \end{cases} \]
\[ X(e^{j\omega})= \begin{cases} 2jX_i(e^{j\omega}) & 0<\omega<\pi\\ 0 & -\pi\leq\omega<0 \end{cases} \]\(X_r(e^{j\omega})\)和\(X_i(e^{j\omega})\)之间的关系
\[ \begin{aligned} X_i(e^{j\omega})&=\begin{cases} -jX_r(e^{j\omega}) & 0<\omega<\pi\\ jX_r(e^{j\omega}) & -\pi\leq\omega<0 \end{cases}\\ &=H(e^{j\omega})X_r(e^{j\omega}) \end{aligned} \]
\[ X_r(e^{j\omega})=\frac{1}{H(e^{j\omega})}X_i(e^{j\omega})=-H(e^{j\omega})X_i(e^{j\omega}) \]其中\(H(e^{j\omega})\)为希尔伯特变换器的频率响应
\[ H(e^{j\omega})= \begin{cases} -j & 0<\omega<\pi\\ j & -\pi<\omega<0 \end{cases} \]对应的脉冲响应\(h[n]\)为
\[ h[n]= \begin{cases} \dfrac{2\sin^2\dfrac{\pi n}{2}}{\pi n} & n\neq0\\[2pt] 0 & n=0 \end{cases} \](1) 可以让\(x_r[n]\)通过一个频率响应为\(H(e^{j\omega})\)的系统得到\(x_i[n]\), 也可以由\(x_i[n]\)得到\(-x_r[n]\).
(2) 希尔伯特变换器的幅值为1, 对于\(0<\omega<\pi\)有\(-\dfrac{\pi}{2}\)的相位加权, 而对于\(-\pi<\omega<0\)有\(+\dfrac{\pi}{2}\)的相位加权, 因此也可以称为理想\(90^\circ\)移相器(在\(\omega=0\)有\(\pi\)的相位跳变\(\Rightarrow\)在\(z=1\)有奇数个零点).
(3) \(h[n]\)是一个奇对称序列, 因此如果使用FIR广义线性相位系统逼近希尔伯特变换器, 只能选择III类或IV类.其中III类FIR需要更少的计算量, 但IV类FIR在幅频特性上有更好的逼近.
IIR系统逼近的希尔伯特变换器(相位分裂器)
(1) \(H_1(e^{j\omega})\)和\(H_2(e^{j\omega})\)是两个相位响应相差\(90^\circ\)的全通系统.
(2) \(Y(e^{j\omega})\)和\(X(e^{j\omega})\)的幅值相等, 相位相差一个\(H_1(e^{j\omega})\)和\(H_2(e^{j\omega})\)的共同相位分量.
带通信号的表示
考虑复低通信号
\[ x[n]=x_r[n]+jx_i[n] \]其中\(x_i[n]\)是\(x_r[n]\)的希尔伯特变换, 且
\[ X(e^{j\omega})=0,-\pi\leq\omega<0 \]考虑序列
\[ \begin{aligned} s[n]&=x[n]e^{j\omega_cn}\\ &=(x_r[n]+jx_i[n])(\cos\omega_cn+j\sin\omega_cn)\\ &=x_r[n]\cos\omega_cn-x_i[n]\sin\omega_cn+jx_i[n]\cos\omega_cn+jx_r[n]\sin\omega_cn\\ &=s_r[n]+js_i[n] \end{aligned} \]由此可以得到
\[ s_r[n]=x_r[n]\cos\omega_cn-x_i[n]\sin\omega_cn \]
\[ s_i[n]=x_i[n]\cos\omega_cn+x_r[n]\sin\omega_cn \]
上一篇:利用离散傅里叶变换的信号傅里叶分析