首页> 外文期刊>IEEE Transactions on Information Theory >On higher order permutors for serially concatenated convolutional codes
【24h】

On higher order permutors for serially concatenated convolutional codes

机译:关于级联卷积码的高阶置换子

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

摘要

A new parameter set for designing permutors is introduced. It is called the set of higher order separations and can be considered as a generalization of the well-known symbol separation (spreading factor). The respective permutor is called a higher order permutor and we show how such a permutor can be constructed. For a second-order permutor in a serially concatenated convolutional encoding scheme we give a lower bound on the minimum distance of the resulting overall code. The integers that determine the sufficiently large separations, i.e., the smallest separations for which the distance properties can be guaranteed, are derived from the active distances of the convolutional component encoders. Additionally, a growth rate of the minimum distance like O((d/sub free//sup o/)/sup /spl lfloor//spl rho//2/spl rfloor/+1/) is proved for serially concatenated convolutional encoders with permutors having large separations of order /spl rho/.
机译:介绍了用于设计置换器的新参数集。它被称为高阶分隔集,可以看作是众所周知的符号分隔(扩展因子)的概括。各自的置换器称为高阶置换器,我们展示了如何构建这种置换器。对于串行级联卷积编码方案中的二阶置换子,我们给出了所得整体代码的最小距离的下限。从卷积分量编码器的有效距离导出确定足够大的间隔的整数,即可以保证距离特性的最小间隔。此外,对于串联级联卷积编码器,证明了最小距离的增长率,如O((d / sub free // sup o /)/ sup / spl lfloor // spl rho // 2 / spl rfloor / + 1 /)排列顺序大/ spl rho /的置换子。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号