首页> 外文学位 >A parallel low-complexity MIMO detection algorithm using QR decomposition and Alamouti space-time code.
【24h】

A parallel low-complexity MIMO detection algorithm using QR decomposition and Alamouti space-time code.

机译:使用QR分解和Alamouti时空码的并行低复杂度MIMO检测算法。

获取原文
获取原文并翻译 | 示例

摘要

In this thesis we present a parallel N x N MIMO detection algorithm that is suitable for implementation on multi-core low-power processors. This algorithm has multiple versions which, depending on the SNR and target FER, allows for the complexity, performance and power consumption to be traded off on a packet-by-packet basis.;Despite the use of the capacity-lossy Alamouti code we show that the outage capacity and FER performance of the proposed algorithm at practical SNR levels below 20dB are comparable to, or sometimes outperform, those offered by spatial multiplexing algorithms such as MMSE-VBLAST. Furthermore, we show that our algorithm is more robust than MMSE-VBLAST in the presence of channel imperfections such as spatial correlation and channel estimation errors, two commonly encountered imperfections in practice. We also show that the complexity of our algorithm is equivalent to that of a lower complexity version of MMSE-VBLAST. Through FER comparisons with other well-known hybrid algorithms we also show that our algorithm achieves similar or better performance at a much lower complexity.;The features offered by the proposed algorithm that is: parallel architecture, good FER/capacity performance, robustness against channel imperfections make it an ideal candidate for use in 4G and beyond-4G wireless standards.;The proposed hybrid algorithm essentially consists of coding the transmit symbols in pairs using the Alamouti space-time block code. At the receiver, one or multiple QR decompositions are performed in parallel after which alternate successive interference cancellation, Alamouti decoding and coherent combining are performed. Iterative detection can also be performed should better error performance be required.
机译:在本文中,我们提出了一种适用于在多核低功耗处理器上实现的并行N x N MIMO检测算法。该算法具有多种版本,具体取决于SNR和目标FER,从而允许在逐个数据包的基础上权衡复杂性,性能和功耗。尽管我们使用了容量有损的Alamouti代码提出的算法在低于20dB的实际SNR级别时的中断容量和FER性能与MMSE-VBLAST等空间复用算法所提供的性能相当或有时甚至优于。此外,我们表明,在存在信道缺陷(例如空间相关性和信道估计错误)的情况下,我们的算法比MMSE-VBLAST更加健壮,这是实践中经常遇到的两个缺陷。我们还表明,我们算法的复杂度等同于较低复杂度版本的MMSE-VBLAST。通过FER与其他知名混合算法的比较,我们还表明我们的算法以更低的复杂度实现了相似或更好的性能;所提出的算法提供的功能是:并行体系结构,良好的FER /容量性能,针对信道的鲁棒性不完美的特性使其成为4G和4G以及更高无线标准中的理想候选者。所提出的混合算法主要包括使用Alamouti时空分组码成对编码发射符号。在接收机处,并行执行一个或多个QR分解,然后执行交替的连续干扰消除,Alamouti解码和相干合并。如果需要更好的错误性能,也可以执行迭代检测。

著录项

  • 作者

    Arar, Maher.;

  • 作者单位

    University of Ottawa (Canada).;

  • 授予单位 University of Ottawa (Canada).;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 164 p.
  • 总页数 164
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号