首页> 外文期刊>Very Large Scale Integration (VLSI) Systems, IEEE Transactions on >A Low-Complexity Multiple Error Correcting Architecture Using Novel Cross Parity Codes Over GF src='/images/tex/29716.gif' alt='(2^{m})'>
【24h】

A Low-Complexity Multiple Error Correcting Architecture Using Novel Cross Parity Codes Over GF src='/images/tex/29716.gif' alt='(2^{m})'>

机译:在GF 上使用新颖的交叉奇偶校验码的低复杂度多错误纠正体系结构 src =“ / images / tex / 29716.gif” alt =“(2 ^ {m})”>

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

摘要

This paper presents a novel low-complexity cross parity code, with a wide range of multiple bit error correction capability at a lower overhead, for improving the reliability in circuits over GF. For an input circuit, the proposed scheme can correct multiple error combinations out of all the possible errors, which is superior to many existing approaches. From the mathematical and practical evaluations, the best case error correction is bit errors. Tests on 80-bit parallel and, for the first time, on 163-bit Federal Information Processing Standard/National Institute of Standards and Technology (FIPS/NIST) standard word-level Galois field (GF) multipliers, suggest that it requires only 106% and 170% area overheads, respectively, which is lower than the existing approaches, while error injection-based behavioral analysis demonstrates its wider error correction capability.
机译:本文提出了一种新颖的低复杂度交叉奇偶校验码,具有较低的开销下的多种多比特纠错能力,可提高GF电路的可靠性。对于输入电路,所提出的方案可以校正所有可能的误差中的多个误差组合,这优于许多现有方法。从数学和实践评估中,最佳情况下的纠错是位错误。在80位并行测试以及首次在163位联邦信息处理标准/美国国家标准与技术研究院(FIPS / NIST)标准字级Galois字段(GF)乘法器上进行的测试表明,它仅需要106 %和170%的区域开销分别低于现有方法,而基于错误注入的行为分析证明了其更广泛的错误纠正能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号