Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sanjeev Sripadraj Murthy

dblp:221/2831 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 70% Reconfigurable computing and FPGAs · 30%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate computing › approximate circuit design
approximate arithmetic circuits
0.312018
SMApproxlib: library of FPGA-based approximate multipliers · DAC 2018
Emerging computing paradigms
approximate computing
0.312018
SMApproxlib: library of FPGA-based approximate multipliers · DAC 2018
Emerging computing paradigms › approximate computing
approximate multiplier
0.312018
SMApproxlib: library of FPGA-based approximate multipliers · DAC 2018
Reconfigurable computing and FPGAs
FPGA arithmetic
0.312018
SMApproxlib: library of FPGA-based approximate multipliers · DAC 2018
Reconfigurable computing and FPGAs
FPGA accelerator
0.112018
SMApproxlib: library of FPGA-based approximate multipliers · DAC 2018
YearPublicationVenuePosition
2018 SMApproxlib: library of FPGA-based approximate multipliers
abstract
The main focus of the existing approximate arithmetic circuits has been on ASIC-based designs. However, due to the architectural differences between ASICs and FPGAs, comparable performance gains cannot be achieved for FPGA-based systems by using the approximations defined, particularly for ASIC-based systems. This paper exploits the structure of the 6-input lookup tables and associated carry chains of modern FPGAs to define a methodology for designing approximate multipliers optimized for FPGA-based systems. Using our presented methodology, we present SMApproxLib, an open source library of approximate multipliers with different bit-widths, output accuracies and performance gains. Being the first open source library of FPGA-based approximate multipliers, SMAp-proxLib can serve as a benchmark for designing and comparing future FPGA-based approximate arithmetic circuits.
Salim Ullah, Sanjeev Sripadraj Murthy, Akash Kumar 0001
DAC2