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

Xiangxuan Ge

dblp:198/0686 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—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 · 77% Integrated circuit design · 23%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate computing › approximate circuit design › approximate arithmetic circuits
approximate adder
0.412019
An Efficient Method for Calculating the Error Statistics of Block-Based Approximate Adders · IEEE Trans. Computers 2019
Emerging computing paradigms
approximate computing
0.412019
An Efficient Method for Calculating the Error Statistics of Block-Based Approximate Adders · IEEE Trans. Computers 2019
Integrated circuit design › digital circuit design › arithmetic circuit design
adder design
0.112019
An Efficient Method for Calculating the Error Statistics of Block-Based Approximate Adders · IEEE Trans. Computers 2019
Integrated circuit design › digital circuit design
arithmetic circuit design
0.112019
An Efficient Method for Calculating the Error Statistics of Block-Based Approximate Adders · IEEE Trans. Computers 2019

Methods — techniques the papers use, named apart from their topics

error distribution analysis · 0.4
YearPublicationVenuePosition
2019 An Efficient Method for Calculating the Error Statistics of Block-Based Approximate Adders
abstract
Adders are key building blocks of many error-tolerant applications. Recently, a number of approximate adders were proposed. Many of them are block-based approximate adders. For approximate circuits, besides normal metrics such as area and delay, the other important design metrics are the various error statistics, such as error rate (ER), mean error distance (MED), and mean square error (MSE). Given the popularity of block-based approximate adders, in this work, we propose an efficient method to obtain their error statistics. We first show how to calculate the ER. Then, we demonstrate an approach to get the error distribution, which can be used to calculate other metrics, such as MED and MSE. Our method is applicable to an arbitrary block-based approximate adder. It is accurate for the uniformly distributed inputs. Experimental results also demonstrated that it produces error metrics close to the accurate ones for various types of non-uniform input distributions. Compared to the state-of-the-art algorithm for obtaining the error distributions of block-based approximate adders, for the uniform input distribution, our method improves the runtime by up to$4.8\times 10^4$times with the same accuracy; for non-uniform input distributions, it achieves a speed-up of up to 400 times with very similar accuracy.
You Li 0008, Xiangxuan Ge, Yuan Gao 0012, Weikang Qian
IEEE Trans. Computers3