A variable RADIX-2ralgorithm for single constant multiplication
| Autor: | Paulo Flores, A. K. Oudjida, José Monteiro, Ahmed Liacha, Farid Ferguene |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Multiplication algorithm
Adder Heuristic (computer science) 020208 electrical & electronic engineering 02 engineering and technology Matrix multiplication 020202 computer hardware & architecture 0202 electrical engineering electronic engineering information engineering Radix Algorithm design Multiplication Hardware_ARITHMETICANDLOGICSTRUCTURES Arithmetic Constant (mathematics) Algorithm Mathematics |
| Zdroj: | NEWCAS |
| DOI: | 10.1109/newcas.2017.8010156 |
| Popis: | In previous work, a fully predictable sub-linear runtime heuristic for the multiplication by a constant based on Radix-2r arithmetic using a fixed radix was developed, called RADIX-2r. In this paper, we introduce a new constant multiplication algorithm based also on Radix-2r arithmetic but considering a variable radix. The new version is named RADIX-2r-VAR. Using a variable radix allows to optimize the average number of additions in the constant multiplication since a larger search space is explored. The new RADIX-2r-VAR recoding requires an average of 4.4% and 2.2% less additions than RADIX-2r for 24 and 32 bits, respectively. The RADIX-2r-VAR algorithm is combined with RADIX-2r for more improvements of the average number of additions. An overall saving of 6.7% and 5.5% is obtained over RADIX-2r for 24 and 32 bits, respectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|