Name
Abstract | ||
|---|---|---|
Functional Units that are designed to receive inputs and produce outputs using a non-redundant format typically exhibit an inferior performance. In order to overcome this limitation, the carry-save and partial carry-save formats have been proposed. Both approaches are very suitable when implementing addition trees. Nevertheless, if there are multiplications in the datapath, the inputs to the multiplier must be reduced to a non-redundant form, to avoid applying the distributive property. In this paper we present a multiplier able to receive two numbers in partial carry-save format, and produce a result in partial carry-save format as well. This is done by modifying the Booth encoder and leveraging the generate and propagate group signals that are available because of the partial carry-save format. Hence, this can allow to fully implement datapaths without additional penalty cycles due to reductions to non-redundant forms. Experiments show that our proposed multiplier has 15% shorter delay with respect to a conventional Booth radix-4 multiplier. Moreover, when combining it with partial carry-save adders it is possible to reduce 36% execution time on average for several benchmarks, achieving a 32.7% reduction in the Energy Delay Product at the same time. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TC.2016.2529626 | IEEE Trans. Computers |
Keywords | Field | DocType |
Booth encoding,Multiplier,datapath synthesis,partial carry-save | Distributive property,Datapath,Adder,Computer science,Parallel computing,On the fly,Arithmetic,Multiplier (economics),Encoder,Benchmark (computing),Encoding (memory) | Journal |
Volume | Issue | ISSN |
PP | 99 | 0018-9340 |
Citations | PageRank | References |
3 | 0.40 | 31 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto A. Del Barrio | 1 | 78 | 14.49 |
| Roman Hermida | 2 | 104 | 8.19 |
| Seda Öǧrenci Memik | 3 | 488 | 42.57 |