...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Improved bit-stuffing bounds on two-dimensional constraints
【24h】

Improved bit-stuffing bounds on two-dimensional constraints

机译：改进了二维约束上的位填充边界

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We derive lower bounds on the capacity of certain two-dimensional (2-D) constraints by considering bounds on the entropy of measures induced by bit-stuffing encoders. A more detailed analysis of a previously proposed bit-stuffing encoder for (d,/spl infin/)-runlength-limited (RLL) constraints on the square lattice yields improved lower bounds on the capacity for all d /spl ges/ 2. This encoding approach is extended to (d,/spl infin/)-RLL constraints on the hexagonal lattice, and a similar analysis yields lower bounds on the capacity for d /spl ges/ 2. For the hexagonal (1,/spl infin/)-RLL constraint, the exact coding ratio of the bit-stuffing encoder is calculated and is shown to be within 0.5% of the (known) capacity. Finally, a lower bound is presented on the coding ratio of a bit-stuffing encoder for the constraint on the square lattice where each bit is equal to at least one of its four closest neighbors, thereby providing a lower bound on the capacity of this constraint.
机译：通过考虑位填充编码器引起的度量熵的边界，我们得出了某些二维（2-D）约束的容量的下界。对先前建议的位填充编码器进行更详细的分析，以解决方格上的（d，/ spl infin /）-游程长度限制（RLL）约束，从而改善了所有d / spl ges / 2的容量下限。编码方法扩展到六边形格子上的（d，/ spl infin /）-RLL约束，并且类似的分析得出d / spl ges / 2的容量下限。对于六边形（1，/ spl infin /） -RLL约束，计算出位填充编码器的精确编码率，并显示在（已知）容量的0.5％之内。最后，在位填充编码器的编码率上给出一个下限，以约束方格，其中每个位均等于其四个最近邻居中的至少一个，从而为该约束的容量提供下限。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号