arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.05464eess.SP
收藏

使用随机调制的信道保护

Channel Protection using Random Modulation

Ali Ahmed, Humera Hameed

摘要:

本文表明,调制保护带限信号对卷积干扰。用已知的随机符号序列$r(t)$调制(逐点相乘)带宽限制为$B$ Hz的信号$s(t)$,以速率$Q$交替,并且将所得的\textit{spread spectrum}信号$s(t) \odot r(t)$与$M$抽头信道脉冲响应$h(t)$卷积,以产生观测信号$y(t)= (s(t)\odot r(t))\circledast h(t),$,其中$\odot$和$\circledast$分别表示逐点相乘和循环卷积.我们表明,$s(t)$和$h(t)$可以证明恢复使用一个简单的梯度下降方案交替的二进制波形$r(t)$的速率$Q \gtrsim B + M$(内对数因子和信号相干)和采样$y(t)$的速率$Q$。我们还提出了一套全面的相变来描述$Q$,$M$和$B$之间的权衡成功恢复。此外,我们在噪声下显示稳定的恢复结果。

英文摘要:

This paper shows that modulation protects a bandlimited signal against convolutive interference. A signal $s(t)$, bandlimited to $B$Hz, is modulated (pointwise multiplied) with a known random sign sequence $r(t)$, alternating at a rate $Q$, and the resultant \textit{spread spectrum} signal $s(t) \odot r(t)$ is convolved against an $M$-tap channel impulse response $h(t)$ to yield the observed signal $y(t)= (s(t)\odot r(t))\circledast h(t),$ where $\odot$ and $\circledast$ denote pointwise multiplication, and circular convolution, respectively. We show that both $s(t)$, and $h(t)$ can be provably recovered using a simple gradient descent scheme by alternating the binary waveform $r(t)$ at a rate $Q \gtrsim B + M$(to within log factors and a signal coherences) and sampling $y(t)$ at a rate $Q$. We also present a comprehensive set of phase transitions to depict the trade-off between $Q$, $M$, and $B$ for successful recovery. Moreover, we show stable recovery results under noise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑