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

David Fang

dblp:86/2441 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-author

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
Electronic design automation · 67% Reconfigurable computing and FPGAs · 33%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
asynchronous circuit synthesis
0.112005
Automated synthesis for asynchronous FPGAs · FPGA 2005
Reconfigurable computing and FPGAs › FPGA architecture
asynchronous FPGA
0.112005
Automated synthesis for asynchronous FPGAs · FPGA 2005
Electronic design automation
logic synthesis
0.112005
Automated synthesis for asynchronous FPGAs · FPGA 2005
YearPublicationVenuePosition
2005 A High-Performance Asynchronous FPGA: Test Results
abstract
We report test results from a prototype asynchronous FPGA (AFPGA) implemented in TSMC's 0.18 /spl mu/m CMOS process. The AFPGA uses SRAM-based configuration bits with pipelined logic blocks and switch boxes. Test results demonstrate a throughput of 674 MHz at 1.8 V.
David Fang, John Teifel, Rajit Manohar
FCCM1
2005 Automated synthesis for asynchronous FPGAs
abstract
We present an automatic logic synthesis method targeted for high-performance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-level descriptions of asynchronous circuits into fine-grain asynchronous process netlists suitable for an AFPGA. The resulting circuits are inherently pipelined, and can be physically mapped onto our AFPGA with standard partitioning and place-and-route algorithms. For a wide variety of benchmarks, our automatic synthesis method not only yields comparable logic densities and performance to those achieved by hand placement, but also attains a throughput close to the peak performance of the FPGA.
David Fang, John Teifel, Rajit Manohar
FPGA2