空时分组码设计与复杂度降低的几何关系
Geometrical relations between space time block code designs and complexity reduction
摘要：
在这项工作中，空时分组码设计的相干信道和它的非相干对应之间的几何关系，利用得到一个模拟的信息论不等式$I(X;S)\le I((X,H);S)$的多样性。它提供了一个下界的非相干码的性能时，在相干的情况下使用。这又导致代码设计分解结果将相干代码设计分成两个复杂度降低的子任务。此外，还导出了高性能空时码设计的几何准则。
英文摘要：
In this work, the geometric relation between space time block code design for the coherent channel and its non-coherent counterpart is exploited to get an analogue of the information theoretic inequality $I(X;S)\le I((X,H);S)$ in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result splitting coherent code design into two complexity reduced sub tasks. Moreover a geometrical criterion for high performance space time code design is derived.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
