首页> 外文会议>Asilomar Conference on Signals, Systems and Computers >Construction of minimal sets for capacity-approaching variable-length constrained sequence codes
【24h】

Construction of minimal sets for capacity-approaching variable-length constrained sequence codes

机译:用于容量接近可变长度约束序列代码的最小集合的结构

获取原文

摘要

A novel approach to design capacity-approaching variable-length constrained sequence codes has recently been developed. A critical step in this design process is the construction of minimal sets based on a finite state machine description of the encoders. In this paper we propose three generalized criteria to select the state that will result in construction of the minimal set with the best achievable code rate. Both complete and incomplete minimal sets are considered when developing criteria to select the appropriate state. We construct constrained sequence codes to demonstrate the effectiveness of the proposed construction criteria.
机译:最近开发了一种设计能力接近可变长度约束序列代码的新方法。该设计过程中的一个关键步骤是基于编码器的有限状态机描述的最小集合的结构。在本文中,我们提出了三个普遍标准来选择将导致最小集合的施工具有最佳可实现的代码率。在开发标准以选择适当的状态时,考虑完整和不完整的最小集。我们构建受约束的序列码以证明所提出的施工标准的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号