Improving the Karatsuba-Ofman multiplication algorithm for special applications
In this thesis, we study the Karatsuba-Ofman Algorithm (KOA), which is a recursive multi-precision multiplication method, and improve it for certain special applications. This thesis is in two parts. In the first part, we derive an efficient algorithm from the KOA to multiply the operands having a p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1957/32684 |