arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.03083cs.AR
收藏

布尔函数极小化剩余数制算法的硬件实现

Hardware realization of residue number system algorithms by Boolean functions minimization

Danila Gorodecky, Tiziano Villa

摘要:

剩余数系统(RNS)通过它们的模模来表示一组相对素数的数。本文提出了一种基于布尔极小化的模乘和模函数(X(mod P))的有效硬件实现方法。我们报告的实验显示,我们的方法与最先进的工业工具所获得的结果相比,性能优势高达30倍。

英文摘要:

Residue number systems (RNS) represent numbers by their remainders modulo a set of relatively prime numbers. This paper pro- poses an efficient hardware implementation of modular multiplication and of the modulo function (X(mod P)), based on Boolean minimiza- tion. We report experiments showing a performance advantage up to 30 times for our approach vs. the results obtained by state-of-art industrial tools.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑