首页> 外文会议>IEEE International Conference on Communications >Algebraic Relationship between Amicable Orthogonal Designs and Quasi-Orthogonal STBC with Minimum Decoding Complexity
【24h】

Algebraic Relationship between Amicable Orthogonal Designs and Quasi-Orthogonal STBC with Minimum Decoding Complexity

机译:具有最小解码复杂性的友易正交设计与准正交STBC之间的代数关系

获取原文

摘要

We show that there exists an interesting relationship between the algebraic constraints of Amicable Orthogonal Design (AOD) matrices and the dispersion matrices of Quasi-Orthogonal Space-Time Block Code with minimum decoding complexity (MDC-QOSTBC). This insight leads to a novel concept of "Preferred AOD Pair", and we show that MDC-QOSTBC can be constructed from two AODs that form a Preferred AOD Pair. With the Preferred AOD Pair concept, we are able to derive the lower bound on code rate of square MDC-QOSTBC, and show them to be 1 and 3/4 for four and eight transmit antennas respectively. We also present a systematic method to construct Preferred AOD Pair and use them to obtain new MDC-QOSTBCs.
机译:我们表明,具有最小解码复杂度(MDC-QOSTBC)的友易正交设计(AOD)矩阵的代数约束与准正交空间块码的分散矩阵之间存在有趣的关系。这种洞察力导致了“优选的AOD对”的新颖概念,我们表明MDC-QOSTBC可以由两种形成优选AOD对的AOD构造。利用优选的AOD对概念,我们能够得出正方形MDC-QOSTBC的代码率的下限,并分别向四和八个发射天线显示为1和3/4。我们还提出了一种系统的方法来构造优选的AOD对并使用它们来获得新的MDC-QOSTBC。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号