首页> 中文期刊>中国电子科技:英文版 >Fault-Tolerant Bit-Parallel Multiplier for Polynomial Basis of GF(2^m)

Fault-Tolerant Bit-Parallel Multiplier for Polynomial Basis of GF(2^m)

     

摘要

Novel fault-tolerant architectures forbit-parallel polynomial basis multiplier over GF(2m),which can correct the erroneous outputs using linearcode, are presented. A parity prediction circuit based onthe code generator polynomial that leads lower space overhead has been designed. For bit-parallel architectures, the space overhead is about 11%.Moreover, there is only marginal time overhead due toincorporation of error-correction capability thatamounts to 3.5% in case of the bit-parallel multiplier.Unlike the existing concurrent error correction (CEC)multipliers or triple modular redundancy (TMR)techniques for single error correction, the proposed architectures have multiple error-correcting capabilities.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号