Implement High-Performance Karatsuba Multiplier in High-Level Synthesis (HLS) for FPGA Based on Recursive Template
-
Updated
Jun 5, 2020 - Ada
Implement High-Performance Karatsuba Multiplier in High-Level Synthesis (HLS) for FPGA Based on Recursive Template
Divide and Conquer algorithm to multiply n-bit numbers in O(n^1.58).. This implementation works completely without using Python's "*"-operator; just "+", "-", bitwise operations and a lookup table.
karatsuba multiplication using C
Polynomial Multiplication using Karatsuba's Algorithm
Fast Multiplication algorithm for very long digit numbers.
Laboratorio de la asignatura Estructuras de Datos y Algoritmos (C++)
My Data-Structures and Algorithms codes for CSE 203 Course.
Get factorial of large no using karatsuba algorithm.
optimized karatsuba polynomial multiplication
Karatsuba's Algorithm implemented in C++
Polynomial multiplication algorithm written in C++, with time complexity of O(N^log3) = O(N^1.585)
Multiplication and exponentiation using Karatsuba Method
This project implements the Karatsuba algorithm and was developed for the Foundations of Algorithm Design and Analysis course at the PUC Minas university, in the 5th period.
To resolve multiply process reducing complexity with karatsuba algorithm
Fast Fibonacci numbers with arbitrary precision
C library developed to perform arithmetic operations on integers of arbitrary length and Karatsuba algorithm has been implemented for performing multiplication of integers
Single Header ANSI C mini libraries
My Khan-Axiom algorithm is placed against the Karatsuba, Schonhage and Toom-Cook algorithms in a performance test.
Add a description, image, and links to the karatsuba-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the karatsuba-algorithm topic, visit your repo's landing page and select "manage topics."