...
首页> 外文期刊>IEEE Transactions on Information Theory >Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference
【24h】

Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference

机译:估计符号间干扰信道上网格编码的距离谱和性能范围

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

摘要

A general class of trellis codes whose generating trellis can be labeled by a set of linear labels is defined. It is shown that for these codes there exist conditions on the signal mapping that make it possible to calculate the distance spectrum with respect to a distance measure (e.g., Euclidean distance) assuming an arbitrary correct sequence. This class of new codes contains most known trellis codes. It is then shown that this approach can be extended to calculate the distance spectra of certain trellis codes on intersymbol interference channels, e.g., Ungerboeck 8-PSK trellis codes. Examples of the distance spectra and union bounds on the bit-error probability for channels with and without intersymbol interference are evaluated. A comparison to simulation results is used to demonstrate the tightness of the bounds.
机译:定义了网格的一般类别,其生成的网格可以由一组线性标签来标记。示出了对于这些代码,在信号映射上存在条件,该条件使得可以相对于假设任意正确序列的距离量度(例如,欧几里得距离)来计算距离谱。此类新代码包含最著名的网格代码。然后表明,该方法可以扩展以计算符号间干扰信道上某些网格码的距离谱,例如,Ungerboeck 8-PSK网格码。对有和没有符号间干扰的信道的距离谱和误码概率的并界的例子进行了评估。与仿真结果的比较用于证明边界的紧密度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号