首页> 外文会议>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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号