• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Analysis of signal decoding and carrier frequency recovery in practical MIMO communications.
【24h】

Analysis of signal decoding and carrier frequency recovery in practical MIMO communications.

机译：实际MIMO通信中的信号解码和载频恢复分析。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Build a wireless testbed on a comprehensive hardware platform not only enables us fast prototyping wireless communications but also helps us understand the potential benefits and problems that come with real hardware and cannot be identified with only theoretical research. This dissertation presents three research topics developed from building such a wireless testbed: transient carrier frequency offset (CFO), a joint CFO and SFO estimator, and computational complexity of sphere decoding with greedy ordering. %We present the design and implementation of a close-loop time-division duplex (TDD) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) wireless testbed on a hardware platform.;We consider the transient CFO observed on the wireless testbed working in TDD mode. We model the transient CFO as the response of an underdamped second order system. We propose a subspace based low complexity parametric estimation algorithm. Furthermore, a weighted subspace fitting (WSF) algorithm is derived to minimize the mean squared error of the estimated parameters. The performance of the proposed algorithms is compared to the traditional solutions as well as the Cramer-Rao lower bound (CRLB). It is also confirmed by the experimental results obtained from the wireless testbed.;The joint CFO and SFO estimator exploits the fact that the sampling clock and the local radio frequency are derived from a common reference frequency source. The proposed joint CFO and SFO estimator is capable of estimating CFO in a extended range without suffering from the phase ambiguity problem. CRLB of the estimated CFO is discussed and compared. The proposed algorithm is validated on the wireless testbed.;We further explore the computational complexity of the sphere decoding algorithm with the greedy ordering. The ordering of the channel matrix may have significant impact on the complexity of the sphere decoding. The computational complexity is studied based on the distance between a fixed pair of lattice points in k--dimensional space. We show that the distribution of the distance depends only on the first n -- k steps of ordering, and is independent from the remaining k steps of ordering. Then, we obtain the complexity of the k--dimensional sphere decoding by the partially sorted QR decomposition. The analytical results are verified with the numerical simulations.
机译：在全面的硬件平台上构建无线测试平台，不仅使我们能够快速建立无线通信的原型，而且还有助于我们了解实际硬件带来的潜在收益和问题，而这只能通过理论研究才能确定。本论文提出了从建立这样的无线测试平台中获得的三个研究主题：瞬态载波频率偏移（CFO），联合CFO和SFO估计器以及具有贪婪排序的球形解码的计算复杂性。我们介绍了在硬件平台上的闭环时分双工（TDD）多输入多输出正交频分复用（MIMO-OFDM）无线测试台的设计和实现。无线测试平台以TDD模式工作。我们将瞬态CFO建模为欠阻尼二阶系统的响应。我们提出了一种基于子空间的低复杂度参数估计算法。此外，导出了加权子空间拟合（WSF）算法以最小化估计参数的均方误差。将所提出算法的性能与传统解决方案以及Cramer-Rao下界（CRLB）进行了比较。从无线测试台获得的实验结果也证实了这一点。联合CFO和SFO估计器利用了这样的事实，即采样时钟和本地射频均来自一个公共参考频率源。拟议中的CFO和SFO联合估计器能够在扩展范围内估计CFO，而不会遭受相位模糊性问题的困扰。讨论并比较了估计的CFO的CRLB。所提出的算法在无线测试平台上得到了验证。我们进一步探索了具有贪婪排序的球形解码算法的计算复杂度。信道矩阵的排序可能会对球面解码的复杂性产生重大影响。基于k维空间中固定的一对晶格点之间的距离来研究计算复杂度。我们表明距离的分布仅取决于前n-k个排序步骤，并且与其余k个排序无关。然后，我们通过部分排序的QR分解获得k维球面解码的复杂度。数值模拟验证了分析结果。

著录项

  • 作者

    Yuan, Jin.;

  • 作者单位

    The University of Texas at Dallas.;

  • 授予单位 The University of Texas at Dallas.;
  • 学科 Electrical engineering.;Computer engineering.
  • 学位 Ph.D.
  • 年度 2014
  • 页码 127 p.
  • 总页数 127
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 康复医学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号