• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2012 International Symposium on Information Theory and its Applications. >An Adaptive Conditional Zero-Forcing decoder with full-diversity, least complexity and essentially-ML performance for STBCs
【24h】

An Adaptive Conditional Zero-Forcing decoder with full-diversity, least complexity and essentially-ML performance for STBCs

机译：适用于STBC的全分集，最低复杂度和本质上具有ML性能的自适应条件迫零解码器

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

摘要

A low complexity decoding technique with an essentially-ML performance for the Golden code and the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard & Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs) — the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity under Rayleigh fading, and we give sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the 3 and 4 antenna Perfect codes, the 3 antenna Threaded Algebraic Space-Time code and the 4 antenna rate 2 code of Srinath & Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm outperform all known codes in terms of both decoding complexity and error performance for Nt ≤ 4 transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. The proposed decoders for all the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity.
机译：Sirianunpiboon，Howard和Calderbank引入了一种低复杂度的解码技术，它对Golden码和3天线Perfect码具有本质上的ML性能。尽管没有给出解码器的理论分析，但仿真表明该解码技术几乎具有最大似然（ML）性能。受此技术的启发，本文介绍了两种新的用于时空分组码（STBC）的低复杂度解码器-自适应条件迫零（ACZF）解码器和具有连续干扰消除功能的ACZF解码器（ACZF-SIC），作为特殊情况，包括Sirianunpiboon等人的解码技术。我们证明了ACZF和ACZF-SIC解码器都能够在瑞利衰落下实现全分集，并且我们为STBC提供了充分的条件以使这些解码器具有全分集。然后我们证明，黄金码，3和4天线完美码，3天线螺纹代数时空码和Srinath和Rajan的4天线速率2码都是完全分集的ACZF / ACZF-SIC，严格来说可解码比它们的ML解码器少仿真表明，对于所有这五个码，所提出的解码方法与ML解码的执行效果相同。这些STBC连同提出的解码算法在N t ≤4个发射天线的解码复杂度和错误性能方面均胜过所有已知代码。我们进一步为全分集ACZF / ACZF-SIC解码的复杂度提供了一个下限。上面列出的所有五个代码的建议解码器均达到了该下限，因此在最小化ACZF / ACZF-SIC解码复杂度方面是最佳的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号