Abstract | ||
---|---|---|
In this paper, we present multioperand radix-2 online addition using different data representations (signed-digit, two's complement, and carry-save), in particular cases in which operands with different representations are added. We use the previously defined online full adder (olFA) as a component to build different multioperand online architectures. To merge data with different representations, an inner conversion of data is performed, eliminating any conversion stage and penalty time. We propose a technique to build multioperand trees efficiently and give six practical rules to deal with different kinds of data in the same adder. For addition of a stream of data, we determine the minimum number of separation cycles required to isolate two successive computations and propose a novel hardware technique that eliminates completely the separation cycles, resulting in the maximum throughput possible. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/TC.2011.97 | IEEE Trans. Computers |
Keywords | Field | DocType |
multiformat streaming online addition,multioperand tree,different multioperand online architecture,conversion stage,inner conversion,radix-2 online addition,online full adder,different kind,different data representation,different representation,separation cycle,radix-2 multioperand,encoding,data structures,adders,throughput,computer architecture,logic gates,hardware,logic gate,data representation | Data structure,Logic gate,Adder,Computer science,Operand,Parallel computing,Radix,Throughput,Encoding (memory),Computation | Journal |
Volume | Issue | ISSN |
61 | 6 | 0018-9340 |
Citations | PageRank | References |
2 | 0.39 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Julio Villalba | 1 | 219 | 23.56 |
Tomás Lang | 2 | 417 | 73.70 |
Javier Hormigo | 3 | 113 | 19.45 |