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

Zhao Chen 0004

dblp:93/3669-4 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-8217-7103ORCID · verified

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 · 67% Integrated circuit design · 33%

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

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › approximate and stochastic computing › stochastic computing
bit-stream generation
0.412019
Simultaneous Area and Latency Optimization for Stochastic Circuits by D Flip-Flop Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Integrated circuit design
digital circuit design
0.412019
Simultaneous Area and Latency Optimization for Stochastic Circuits by D Flip-Flop Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Emerging computing paradigms › approximate and stochastic computing
stochastic computing
0.412019
Simultaneous Area and Latency Optimization for Stochastic Circuits by D Flip-Flop Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019

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

d flip-flop insertion · 0.4
YearPublicationVenuePosition
2019 Simultaneous Area and Latency Optimization for Stochastic Circuits by D Flip-Flop Insertion
abstract
Stochastic computing (SC) is an unconventional computing technique using digital circuits. It performs arithmetic computation on stochastic bit streams (SBSs), which encode real values through the ratios of ones in the streams. Despite its advantages such as simple arithmetic units and strong error tolerance, SC faces two big challenges: 1) long computation latency and 2) large hardware overhead to generate independent SBSs. A recent work proposes to insert D flip-flops (DFFs) into the stochastic circuit to reduce the overhead to generate SBSs. In this paper, observing that DFFs can also be exploited to reduce circuit delay, we propose a novel method to insert DFFs into a stochastic circuit to simultaneously reduce the computation latency of the circuit and the overhead of generating SBSs, thus addressing both challenges at the same time. Experimental results showed that compared to the state-of-the-art method in optimizing stochastic circuits with DFF insertion, our method can reduce the computation latency by 14.3% and the number of DFFs by 48.1%.
Zhijing Li 0002, Zhao Chen 0004, Weikang Qian
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2