• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Real-Time Intelligent Systems >Two New Fast and Efficient Hard Decision Decoders Based on Hash Techniques for Real Time Communication Systems
【24h】

Two New Fast and Efficient Hard Decision Decoders Based on Hash Techniques for Real Time Communication Systems

机译：基于实时通信系统散列技术的两个新的快速高效硬判决解码器

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Error correcting codes are used to ensure as maximum as possible the correction of errors due to the noisy perturbation of data transmitted in communication channels or stored in digital supports. The decoding of linear codes is in general a NP-Hard problem and many decoders are developed to detect and correct errors. The evaluation of the quality of a decoder is based on its performances in terms of Bit Error Rate and its temporal complexity. The hash table was previously used for alleviating the temporal complexity of the syndrome decoding algorithm. In this paper, we present two new fast and efficient decoding algorithms to decode linear block codes on binary channels. The main idea in the first decoder HSDec is based on a new efficient hash function that permits to find the error pattern directly from the syndrome of the received word. The storage position of each corrigible error pattern is equal to the decimal value of its syndrome and therefore the run time complexity is much reduced comparing to known low complexity decoders. The main disadvantage of HSDec is the spatial complexity, because it requires to previously storing all corrigible error patterns in memory. For reminding this problem, we propose a second decoder HWDec based also on hash, but it requires storing only the weight of each corrigible error pattern instead of the error pattern itself. The temporal complexity of HWDec is more than that of HSDec but its spatial complexity is less than that of HSDec. The simulation results of the proposed decoders over Additive White Gaussian Channel show that they guarantee at 100% the correction of all corrigible error patterns for some Quadratic Residue, BCH, Double Circulant and Quadratic Double Circulant codes (QDC). The proposed decoders are simple and suitable for software implementations and practice use in particular for transmission of Big Data and real time communication systems which requires rapidity of decoding and prefer codes of high rates.
机译：由于在通信信道中传输的数据的嘈杂扰动或存储在数字支持中，误差校正代码用于确保尽可能最大地校正错误。线性码的解码通常是NP - 硬问题，并且开发了许多解码器以检测和校正错误。对解码器的质量的评估基于其在误码率和时间复杂度方面的性能。哈希表以前用于减轻综合征解码算法的时间复杂性。在本文中，我们提出了两个新的快速高效解码算法来解码二进制信道上的线性块代码。第一解码器HSDEC中的主要思想基于新的高效哈希函数，允许直接从接收单词的综合征找到错误模式。每个违规误差模式的存储位置等于其综合症的小数值，因此与已知的低复杂性解码器相比，运行时间复杂程度大大降低。 HSDEC的主要缺点是空间复杂性，因为它需要先前存储在内存中的所有违规误差模式。为了提醒这个问题，我们还提出了一个基于哈希的第二个解码器HWDEC，但它需要仅存储每个违规误差模式的重量而不是错误模式本身。 HWDEC的时间复杂性大于HSDEC，但其空间复杂性小于HSDEC的空间复杂性。附加白色高斯频道提出的解码器的仿真结果表明，它们保证了根据一些二次残基，BCH，双循环和二次双循环码（QDC）的所有违规误差模式的校正。所提出的解码器简单，适用于软件实现和实践，特别用于传输大数据和实时通信系统，这需要快速解码和更喜欢高速率的代码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号