...
首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Art of constructing low-complexity encoders/decoders forconstrained block codes
【24h】

Art of constructing low-complexity encoders/decoders forconstrained block codes

机译:构造受限块码的低复杂度编码器/解码器的艺术

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

摘要

A rate p : q block encoder is a dataword-to-codeword assignmentnfrom 2p p-bit datawords to 2p q-bit codewords, andnthe corresponding block decoder is the inverse of the encoder. Whenndesigning block encoders/decoders for constrained systems, often, morenthan 2p codewords are available. In this paper, as our mainncontribution, we propose efficient heuristic computer algorithms toneliminate the excess codewords and to construct low hardware complexitynblock encoders/decoders. For (0,4/4) and (0,3/6) PRML constraints, blocknencoders/decoders generated using the proposed algorithms are comparablenin complexity to human-generated encoders/decoders, but arensignificantly simpler than lexicographical encoders/decoders
机译:比率p:q块编码器是从2p个p位数据字到2p个q位代码字的数据字到代码字分配,并且相应的块解码器是编码器的逆。当为受约束的系统设计块编码器/解码器时,通常有超过2p个码字可用。在本文中,作为我们的主要贡献,我们提出了有效的启发式计算机算法来对多余的码字进行音调消除,并构造出低硬件复杂度的块编码器/解码器。对于(0,4 / 4)和(0,3 / 6)PRML约束,使用拟议算法生成的块编码器/解码器的复杂度与人工生成的编码器/解码器相当,但比字典编码器/解码器简单得多

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号