arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1208.4405cs.ITmath.ITmath.NTmath.RT
收藏

具有近似线性复杂度的时延-多普勒信道估计

Delay-Doppler Channel Estimation with Almost Linear Complexity

Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar Sayeed, Oded Schwartz

摘要:

无线通信中的一项基本任务是信道估计:计算信号从发射机传输到接收机时所经历的信道参数。在时延-多普勒信道中,一种广泛使用的方法是匹配滤波算法。它使用长度为N的伪随机序列,并且在发送器和接收器之间的非平凡相对速度的情况下,其计算复杂性为O(N^{2}log(N))。在本文中,我们介绍了一种新的方法设计的序列,允许更快的信道估计。使用组表示技术,我们构造序列,这使我们能够引入一个新的算法,称为标志的方法,显着提高了匹配滤波器算法。对于稀疏度为m的信道,标志方法在O(mNlog(N))操作中找到信道参数。讨论了标志方法在GPS、雷达系统和移动通信中的应用。

英文摘要:

A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N^{2}log(N)). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences, which enable us to introduce a new algorithm, called the flag method, that significantly improves the matched filter algorithm. The flag method finds the channel parameters in O(mNlog(N)) operations, for channel of sparsity m. We discuss applications of the flag method to GPS, radar system, and mobile communication as well.

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

↑