Synthesis of parallel adders from if-decision diagrams
Addition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder architectures, and to developing advanced adder implementation technologies. Decision diagrams are a promising...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Belarusian National Technical University
2020-08-01
|
| Series: | Sistemnyj Analiz i Prikladnaâ Informatika |
| Subjects: | |
| Online Access: | https://sapi.bntu.by/jour/article/view/473 |
| _version_ | 1797873699501637632 |
|---|---|
| author | A. A. Prihozhy |
| author_facet | A. A. Prihozhy |
| author_sort | A. A. Prihozhy |
| collection | DOAJ |
| description | Addition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder architectures, and to developing advanced adder implementation technologies. Decision diagrams are a promising approach to the efficient many-bit adder design. Since traditional binary decision diagrams does not match perfectly with the task of modelling adder architectures, other types of diagram were proposed. If-decision diagrams provide a parallel many-bit adder model with the time complexity of Ο(log2n) and area complexity of Ο(n×log2n). The paper propose a technique, which produces adder diagrams with such properties by systematically cutting the diagram’s longest paths. The if-diagram based adders are competitive to the known efficient Brent-Kung adder and its numerous modifications. We propose a blocked structure of the parallel if-diagram-based adders, and introduce an adder table representation, which is capable of systematic producing if-diagram of any bit-width. The representation supports an efficient mapping of the adder diagrams to VHDL-modules at structural and dataflow levels. The paper also shows how to perform the adder space exploration depending on the circuit fan-out. FPGA-based synthesis results and case-study comparisons of the if-diagram-based adders to the Brent-Kung and majority-invertor gate adders show that the new adder architecture leads to faster and smaller digital circuits. |
| first_indexed | 2024-04-10T01:20:20Z |
| format | Article |
| id | doaj.art-1fec6a67de1841e5a37e430bf65984d6 |
| institution | Directory Open Access Journal |
| issn | 2309-4923 2414-0481 |
| language | English |
| last_indexed | 2024-04-10T01:20:20Z |
| publishDate | 2020-08-01 |
| publisher | Belarusian National Technical University |
| record_format | Article |
| series | Sistemnyj Analiz i Prikladnaâ Informatika |
| spelling | doaj.art-1fec6a67de1841e5a37e430bf65984d62023-03-13T09:47:41ZengBelarusian National Technical UniversitySistemnyj Analiz i Prikladnaâ Informatika2309-49232414-04812020-08-0102617010.21122/2309-4923-2020-2-61-70357Synthesis of parallel adders from if-decision diagramsA. A. Prihozhy0Белорусский национальный технический университетAddition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder architectures, and to developing advanced adder implementation technologies. Decision diagrams are a promising approach to the efficient many-bit adder design. Since traditional binary decision diagrams does not match perfectly with the task of modelling adder architectures, other types of diagram were proposed. If-decision diagrams provide a parallel many-bit adder model with the time complexity of Ο(log2n) and area complexity of Ο(n×log2n). The paper propose a technique, which produces adder diagrams with such properties by systematically cutting the diagram’s longest paths. The if-diagram based adders are competitive to the known efficient Brent-Kung adder and its numerous modifications. We propose a blocked structure of the parallel if-diagram-based adders, and introduce an adder table representation, which is capable of systematic producing if-diagram of any bit-width. The representation supports an efficient mapping of the adder diagrams to VHDL-modules at structural and dataflow levels. The paper also shows how to perform the adder space exploration depending on the circuit fan-out. FPGA-based synthesis results and case-study comparisons of the if-diagram-based adders to the Brent-Kung and majority-invertor gate adders show that the new adder architecture leads to faster and smaller digital circuits.https://sapi.bntu.by/jour/article/view/473много-битовые сумматорыдиаграммы решенийвременная задержкаплощадьvhdlfpgaпространство распараллеливания |
| spellingShingle | A. A. Prihozhy Synthesis of parallel adders from if-decision diagrams Sistemnyj Analiz i Prikladnaâ Informatika много-битовые сумматоры диаграммы решений временная задержка площадь vhdl fpga пространство распараллеливания |
| title | Synthesis of parallel adders from if-decision diagrams |
| title_full | Synthesis of parallel adders from if-decision diagrams |
| title_fullStr | Synthesis of parallel adders from if-decision diagrams |
| title_full_unstemmed | Synthesis of parallel adders from if-decision diagrams |
| title_short | Synthesis of parallel adders from if-decision diagrams |
| title_sort | synthesis of parallel adders from if decision diagrams |
| topic | много-битовые сумматоры диаграммы решений временная задержка площадь vhdl fpga пространство распараллеливания |
| url | https://sapi.bntu.by/jour/article/view/473 |
| work_keys_str_mv | AT aaprihozhy synthesisofparalleladdersfromifdecisiondiagrams |