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

Hai Mo

dblp:33/111 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0003-7073-6320ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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
2 papers
Emerging computing paradigms · 62% Hardware accelerators and domain-specific architectures · 30% Hardware reliability and fault tolerance · 8%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate computing
approximate multiplier
0.812024
Learning the Error Features of Approximate Multipliers for Neural Network Applications · IEEE Trans. Computers 2024
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
0.812024
Learning the Error Features of Approximate Multipliers for Neural Network Applications · IEEE Trans. Computers 2024
Emerging computing paradigms
approximate computing
0.722024
Approximate Arithmetic Circuits: A Survey, Characterization, and Recent Applications · Proc. IEEE 2020
Learning the Error Features of Approximate Multipliers for Neural Network Applications · IEEE Trans. Computers 2024
Emerging computing paradigms › approximate computing › approximate circuit design
approximate arithmetic circuits
0.412020
Approximate Arithmetic Circuits: A Survey, Characterization, and Recent Applications · Proc. IEEE 2020
Hardware reliability and fault tolerance › error resilience
error-tolerant computing
0.212024
Learning the Error Features of Approximate Multipliers for Neural Network Applications · IEEE Trans. Computers 2024
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.112020
Approximate Arithmetic Circuits: A Survey, Characterization, and Recent Applications · Proc. IEEE 2020

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

error analysis · 0.9circuit characterization · 0.9regression · 0.8dropout feature ranking · 0.8classification · 0.8
YearPublicationVenuePosition
2024 Learning the Error Features of Approximate Multipliers for Neural Network Applications
abstract
Approximate multipliers (AMs) have widely been investigated to pursue high-performance and energy-efficient hardware designs for error-tolerant applications, such as neural networks (NNs). The computing accuracy of an AM has been evaluated by using statistical error features; however, it is difficult to estimate the quality of a specific application using AMs. Thus, it is a great challenge to select or design appropriate AMs for an accuracy-constrained application. This paper proposes an application-oriented error evaluation framework for AMs with the aim of exploring the correlation between statistical error features of AMs and the accuracy degradation in AM-based NN applications. Specifically, based on the Dropout Feature Ranking technique, statistical error features of AMs are extensively studied and ranked by their importance to the accuracy of AM-based NN applications. The three most informative features are obtained to construct error models to predict the accuracy loss of AM-based NN applications. The constructed classification models show a probability higher than 96% for correctly classifying the AMs into three categories in accordance with the induced accuracy loss in AM-based NN applications. Furthermore, regression models can predict the accuracy of NN applications using an AM with a deviation as low as 6%. These results show that the proposed error evaluation framework can guide an efficient selection of AMs for NN applications by using just several AM error features, instead of running time-consuming and complicated hardware simulation. The obtained statistical error features can also provide a guidance for the design or generation of application-oriented AMs. Moreover, the proposed framework is applicable for quickly analyzing and selecting other approximate circuits for error-tolerant applications.
Hai Mo, Yong Wu 0009, Honglan Jiang, Zining Ma, Fabrizio Lombardi, Jie Han 0001, Leibo Liu
IEEE Trans. Computers1
2023 Approximate Processing Element Design and Analysis for the Implementation of CNN Accelerators
Honglan Jiang, Hai Mo, Jie Han 0001, Leibo Liu, Zhigang Mao
J. Comput. Sci. Technol.3
2020 Approximate Arithmetic Circuits: A Survey, Characterization, and Recent Applications
abstract
Approximate computing has emerged as a new paradigm for high-performance and energy-efficient design of circuits and systems. For the many approximate arithmetic circuits proposed, it has become critical to understand a design or approximation technique for a specific application to improve performance and energy efficiency with a minimal loss in accuracy. This article aims to provide a comprehensive survey and a comparative evaluation of recently developed approximate arithmetic circuits under different design constraints. Specifically, approximate adders, multipliers, and dividers are synthesized and characterized under optimizations for performance and area. The error and circuit characteristics are then generalized for different classes of designs. The applications of these circuits in image processing and deep neural networks indicate that the circuits with lower error rates or error biases perform better in simple computations, such as the sum of products, whereas more complex accumulative computations that involve multiple matrix multiplications and convolutions are vulnerable to single-sided errors that lead to a large error bias in the computed result. Such complex computations are more sensitive to errors in addition than those in multiplication, so a larger approximation can be tolerated in multipliers than in adders. The use of approximate arithmetic circuits can improve the quality of image processing and deep learning in addition to the benefits in performance and power consumption for these applications.
Honglan Jiang, Francisco J. H. Santiago, Hai Mo, Leibo Liu, Jie Han 0001
Proc. IEEE3