首页> 外文期刊>IEEE transactions on circuits and systems . I , Regular papers >Digit-Serial Versatile Multiplier Based on a Novel Block Recombination of the Modified Overlap-Free Karatsuba Algorithm
【24h】

Digit-Serial Versatile Multiplier Based on a Novel Block Recombination of the Modified Overlap-Free Karatsuba Algorithm

机译:基于改进的无重叠Karatsuba算法的新型块重组的数字串行通用乘数

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

摘要

Overlap-Free Karatsuba Algorithm (OFKA) combined with block recombination approach (OFKABR) can improve the complexity of the original OFKA to obtain efficient implementation of polynomial basis multiplication over finite field$GF(2^{m})$. In this paper, we have further proposed a modified OFKABR (MOFKABR) strategy to reduce the space and time complexities of the best-known method. The proposed strategy is also extended to obtain a low-complexity versatile multiplier, which is designed to support the generalized multiplication on a wider range of field size for$m_{1}leq mleq m_{lambda }$. Using the proposed MOFKABR approach, the proposed digit-serial versatile multiplier can achieve subquadratic space complexity when compared with the existing digit-serial versatile multipliers.
机译:无重叠Karatsuba算法(OFKA)与块重组方法(OFKABR)相结合可以提高原始OFKA的复杂度,从而在有限域上实现多项式基乘法的有效实现 n $ GF (2 ^ {m})$ n。在本文中,我们进一步提出了一种改进的OFKABR(MOFKABR)策略,以减少最著名方法的时空复杂性。拟议的策略也得到了扩展,以获得低复杂度的通用乘法器,该乘法器旨在在更宽的域大小范围上支持通用乘法,用于 n $ m_ {1} leq m leq m _ { lambda} $ n。与现有的数字串行通用乘法器相比,使用提出的MOFKABR方法,提出的数字串行通用乘法器可以实现二次空间复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号