首页> 外文期刊>IEEE Transactions on Information Theory >Optimal constellation labeling for iteratively decoded bit-interleaved space-time coded Modulation
【24h】

Optimal constellation labeling for iteratively decoded bit-interleaved space-time coded Modulation

机译:迭代解码比特交织空时编码调制的最佳星座标记

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We consider the design of iteratively decoded bit-interleaved space-time coded modulation (BI-STCM) over fast Rayleigh-fading channels with N/sub t/ transmit and N/sub r/ receive antennas. We propose the design criterion to achieve the largest asymptotic coding gain inherited in the constellation labeling. In particular, for orthogonal space-time block codes, the labeling design criterion reduces to maximizing the (-N/sub t/N/sub r/)th power mean of the complete set of squared Euclidean distances associated with all "error-free feedback" events in the constellation. Based on this power mean criterion, we show that the labeling optimization problem falls into the category of quadratic assignment problems for constellations of any shape and with an arbitrary number of transmit and receive antennas. For a set of practical values of N/sub t/ and N/sub r/, we present optimal labeling maps for 8-PSK, 16-QAM, and 64-QAM constellations.
机译:我们考虑在具有N / sub t /发射天线和N / sub r /接收天线的快速瑞利衰落信道上设计迭代解码的比特交织的时空编码调制(BI-STCM)。我们提出了一种设计准则,以实现星座标记中继承的最大渐近编码增益。特别是,对于正交空时分组码,标记设计标准减少为最大化与所有“无误码”相关联的平方欧几里德距离的完整集合的第(-N / sub t / N / sub r /)次幂均值反馈”事件。基于该功率均值准则,我们表明,标签优化问题属于任何形状且具有任意数量的发射和接收天线的星座图的二次分配问题。对于N / sub t /和N / sub r /的一组实用值,我们给出了8-PSK,16-QAM和64-QAM星座图的最佳标记图。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号