Presentation is loading. Please wait.

Presentation is loading. Please wait.

Approximate Quaternary Addition with the Fast Carry Chains of FPGAs

Published byАнжела Шишманова Modified over 6 years ago

Similar presentations

Presentation on theme: "Approximate Quaternary Addition with the Fast Carry Chains of FPGAs"— Presentation transcript:

1 Approximate Quaternary Addition with the Fast Carry Chains of FPGAs
Sina Boroumand1, Hadi P. Afshar, Philip Brisk2 1University of Tehran, IR 2University of California, Riverside, US

2 Approximate Quaternary Adder
This paper presents a synthesis and mapping technique that allows to add 4 numbers (rather than 3) using the fast carry chains of FPGAs. The adder would be approximate and can be exploited to build inexact multipliers. The approximate multipliers built by the proposed adder would be faster and smaller. Given an FPGA with a limited number of logic blocks, we would be able to fit more multipliers. The user can explore the adder tree design space to trade-off accuracy for reduced critical path delay and area. 21 March 2018 Approximate Quaternary Addition with the Fast Carry Chains of FPGAs

Download ppt "Approximate Quaternary Addition with the Fast Carry Chains of FPGAs"

Similar presentations

Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
When Data Management Systems Meet Approximate Hardware: Challenges and Opportunities Author: Bingsheng He (Nanyang Technological University, Singapore)

When Data Management Systems Meet Approximate Hardware: Challenges and Opportunities Author: Bingsheng He (Nanyang Technological University, Singapore)
Penn ESE534 Spring2014 -- DeHon 1 ESE534: Computer Organization Day 14: March 19, 2014 Compute 2: Cascades, ALUs, PLAs.

Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 14: March 19, 2014 Compute 2: Cascades, ALUs, PLAs.
Architectural Improvement for Field Programmable Counter Array: Enabling Efficient Synthesis of Fast Compressor Trees on FPGA Alessandro Cevrero 1,2 Panagiotis.

Architectural Improvement for Field Programmable Counter Array: Enabling Efficient Synthesis of Fast Compressor Trees on FPGA Alessandro Cevrero 1,2 Panagiotis.
Reducing the Pressure on Routing Resources of FPGAs with Generic Logic Chains Hadi P. Afshar Joint work with: Grace Zgheib, Philip Brisk and Paolo Ienne.

Reducing the Pressure on Routing Resources of FPGAs with Generic Logic Chains Hadi P. Afshar Joint work with: Grace Zgheib, Philip Brisk and Paolo Ienne.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.

ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
EECS 150 - Components and Design Techniques for Digital Systems Lec 18 – Arithmetic II (Multiplication) David Culler Electrical Engineering and Computer.

EECS Components and Design Techniques for Digital Systems Lec 18 – Arithmetic II (Multiplication) David Culler Electrical Engineering and Computer.
A High Performance Application Representation for Reconfigurable Systems Wenrui GongGang WangRyan Kastner Department of Electrical and Computer Engineering.

A High Performance Application Representation for Reconfigurable Systems Wenrui GongGang WangRyan Kastner Department of Electrical and Computer Engineering.
1 Design of a Parallel-Prefix Adder Architecture with Efficient Timing-Area Tradeoff Characteristic Sabyasachi Das University of Colorado, Boulder Sunil.

1 Design of a Parallel-Prefix Adder Architecture with Efficient Timing-Area Tradeoff Characteristic Sabyasachi Das University of Colorado, Boulder Sunil.
Digital Design – Optimizations and Tradeoffs

Digital Design – Optimizations and Tradeoffs
Adders.

Adders.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.

CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Multiplication and Division problems use the same numbers. These groups of numbers are called number or fact families 7 3 21 x ÷ They all fit together.

Multiplication and Division problems use the same numbers. These groups of numbers are called number or fact families x ÷ They all fit together.
Addition and Subtraction of Integers

Addition and Subtraction of Integers
Yehdhih Ould Mohammed Moctar1 Nithin George2 Hadi Parandeh-Afshar2

Yehdhih Ould Mohammed Moctar1 Nithin George2 Hadi Parandeh-Afshar2
Aug 20071 Shift Operations Source: David Harris. Aug 20072 Shifter Implementation Regular layout, can be compact, use transmission gates to avoid threshold.

Aug Shift Operations Source: David Harris. Aug Shifter Implementation Regular layout, can be compact, use transmission gates to avoid threshold.
Philip Brisk 2 Paolo Ienne 2 Hadi Parandeh-Afshar 1,2 1: University of Tehran, ECE Department 2: EPFL, School of Computer and Communication Sciences Efficient.

Philip Brisk 2 Paolo Ienne 2 Hadi Parandeh-Afshar 1,2 1: University of Tehran, ECE Department 2: EPFL, School of Computer and Communication Sciences Efficient.
Titan: Large and Complex Benchmarks in Academic CAD

Titan: Large and Complex Benchmarks in Academic CAD
COMPUTER SCIENCE &ENGINEERING Compiled code acceleration on FPGAs W. Najjar, B.Buyukkurt, Z.Guo, J. Villareal, J. Cortes, A. Mitra Computer Science & Engineering.

COMPUTER SCIENCE &ENGINEERING Compiled code acceleration on FPGAs W. Najjar, B.Buyukkurt, Z.Guo, J. Villareal, J. Cortes, A. Mitra Computer Science & Engineering.
Enhancing FPGA Performance for Arithmetic Circuits Philip Brisk 1 Ajay K. Verma 1 Paolo Ienne 1 Hadi Parandeh-Afshar 1,2 1 2 University of Tehran Department.

Enhancing FPGA Performance for Arithmetic Circuits Philip Brisk 1 Ajay K. Verma 1 Paolo Ienne 1 Hadi Parandeh-Afshar 1,2 1 2 University of Tehran Department.

Similar presentations

Ads by Google