Dynamic-width reconfigurable parallel prefix circuits
| Autor: | Hatem M. El-Boghdadi |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Combinational logic
Discrete mathematics Adder High interest Computer science Parallel algorithm Directed graph Topology Theoretical Computer Science Prefix Hardware and Architecture Parallel prefix Hardware_INTEGRATEDCIRCUITS Algorithm Software Hardware_LOGICDESIGN Information Systems Electronic circuit |
| Zdroj: | CSE |
| ISSN: | 1573-0484 0920-8542 |
| DOI: | 10.1007/s11227-014-1270-2 |
| Popis: | Parallel prefix circuits have drawn high interest because of their importance in many applications such as fast adders. Most proposed parallel prefix circuits assume fixed width. The input size could be of the same width as the circuit or different than the width of the circuit. In this paper, we propose a class of reconfigurable parallel prefix circuits, $$\check{R}$$R?-circuits, that support different operational modes. The $$\check{R}$$R?-circuit can be reconfigured as one parallel prefix circuit of high width as well as several smaller width parallel prefix circuits that can operate on different prefix problems in parallel. In particular, an $$\check{R}$$R?-circuit, $$\check{R}(k(m))$$R?(k(m)), of width km with $$k$$k building blocks (slices) each of width $$m$$m, can be configured as a number of $$z$$z prefix circuits, $$z\le k$$z≤k, each of width $$b_{j}$$bj, such that $$\sum \nolimits _{j=1}^z {b_j } =km$$?j=1zbj=km. For a circuit $$CR_b \in \check{R}(k(m))$$CRb?R?(k(m)) of $$b$$b slices and width bm, we show how such circuit can be constructed. We derive a bound for the depth of $$CR_b $$CRb and show how $$CR_b $$CRb can handle input size $$n\ge bm$$n?bm. Then, we show the performance of $$\check{R}(k(m))$$R?(k(m)) and compare it with other fixed same-width prefix circuits. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|