基于吠陀数学的二进制乘法的广义递归算法
A Generalized Recursive Algorithm for Binary Multiplication based on Vedic Mathematics
摘要：
通过递归应用吠陀数学中的《尼希拉姆经》，提出了一种适用于数字平台的基2数制环境下的广义乘法算法。统计分析已进行的基础上的递归配置文件作为一个功能的较小的被乘数的数量。该算法是有效的较小的被乘数以及，不同于大多数的渐近快速算法。此外，我们的算法的硬件实现的基本框图，建议利用并行性和加速算法在多处理器环境中的实施。
英文摘要：
A generalized algorithm for multiplication is proposed through recursive application of the Nikhilam Sutra from Vedic Mathematics, operating in radix - 2 number system environment suitable for digital platforms. Statistical analysis has been carried out based on the number of recursions profile as a function of the smaller multiplicand. The proposed algorithm is efficient for smaller multiplicands as well, unlike most of the asymptotically fast algorithms. Further, a basic block schematic of Hardware Implementation of our algorithm is suggested to exploit parallelism and speed up the implementation of the algorithm in a multiprocessor environment.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
