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

Patrick Williams

dblp:42/958 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0006-1902-2455ORCID · corroborated

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

Systems, architecture and hardware · 2 · 1 since 2021Software engineering, systems software and programming languages · 1 · 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
Hardware accelerators and domain-specific architectures · 35% Energy-efficient computing · 35% Electronic design automation · 30%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
in-sensor computing
0.712023
LeCA: In-Sensor Learned Compressive Acquisition for Efficient Machine Vision on the Edge · ISCA 2023
Electronic design automation › timing analysis › statistical timing analysis
statistical static timing analysis
0.412020
Statistical Timing Analysis considering Multiple-Input Switching · DAC 2020
Image and video coding
image compression
0.212023
LeCA: In-Sensor Learned Compressive Acquisition for Efficient Machine Vision on the Edge · ISCA 2023
Image and video coding
neural compression
0.212023
LeCA: In-Sensor Learned Compressive Acquisition for Efficient Machine Vision on the Edge · ISCA 2023
Electronic design automation › timing analysis › delay modeling
gate delay modeling
0.112020
Statistical Timing Analysis considering Multiple-Input Switching · DAC 2020

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

joint learning · 1.3autoencoder · 1.3analog-domain processing · 1.3convolution · 0.4chain ruling · 0.4SSTA · 0.4
YearPublicationVenuePosition
2023 LeCA: In-Sensor Learned Compressive Acquisition for Efficient Machine Vision on the Edge
abstract
With the rapid advances of deep learning-based computer vision (CV) technology, digital images are increasingly consumed, not by humans, but by downstream CV algorithms. However, capturing high-fidelity and high-resolution images is energy-intensive. It not only dominates the energy consumption of the sensor itself (i.e. in low-power edge devices), but also contributes to significant memory burdens and performance bottlenecks in the later storage, processing, and communication stages. In this paper, we systematically explore a new paradigm of in-sensor processing, termed "learned compressive acquisition" (LeCA). Targeting machine vision applications on the edge, the LeCA framework exploits the joint learning of a sensor autoencoder structure with the downstream CV algorithms to effectively compress the original image into low-dimensional features with adaptive bit depth. We employ column-parallel analog-domain processing directly inside the image sensor to perform the compressive encoding of the raw image, resulting in meaningful hardware savings, and energy efficiency improvements. Evaluated within a modern machine vision processing pipeline, LeCA achieves 4×, 6×, and 8× compression ratios prior to any digital compression, with minimal accuracy loss of 0.97%, 0.98%, and 2.01% on ImageNet, outperforming existing methods. Compared with the conventional full-resolution image sensor and the state-of-the-art compressive sensing sensor, our LeCA sensor is 6.3× and 2.2× more energy-efficient while reaching a 2× higher compression ratio.
Tianrui Ma, Adith Boloor, Xiangxing Yang, Weidong Cao 0001, Patrick Williams, Nan Sun 0001, Ayan Chakrabarti, Xuan Zhang 0001
ISCA5
2020 Statistical Timing Analysis considering Multiple-Input Switching
abstract
Traditional statistical static timing analysis (SSTA) using available single-input switching (SIS) based gate delay libraries either ignore timing impact from multiple-input switching (MIS) or use single-corner (deterministic) models for MIS consideration. This paper presents a method for modeling the impact of MIS on statistical timing accurately using concepts of convolution and chain ruling. Experimental results in a commercial SSTA framework demonstrate negligible run-time overheads of modeling MIS while accurately exposing timing slack optimism in an SIS based flow of up to 17 pico-seconds on designs mapped to a 14 nanometer technology library. Prediction of timing critical paths due to MIS show excellent correlation to silicon hardware. Comparisons with prior work illustrate the accuracy improvements of the presented work.
Debjit Sinha, Vasant Rao, Chaitanya Peddawad, Michael H. Wood, Jeffrey G. Hemmett, Suriya Skariah, Patrick Williams
DAC7