scispace - formally typeset
P

Peter A. Beerel

Researcher at University of Southern California

Publications -  236
Citations -  3784

Peter A. Beerel is an academic researcher from University of Southern California. The author has contributed to research in topics: Asynchronous communication & Computer science. The author has an hindex of 30, co-authored 208 publications receiving 3403 citations. Previous affiliations of Peter A. Beerel include Intel & University of California, San Diego.

Papers
More filters
Journal ArticleDOI

Ultra-low power pass-transistor-logic-based delay line design for sub-threshold applications

TL;DR: A pass-transistor-logic-based programmable delay line (DL) circuit is presented that is designed specifically for sub-threshold operation and has similar resiliency to variations across Monte Carlo simulations.
Posted Content

Deep-n-Cheap: An Automated Search Framework for Low Complexity Deep Learning

TL;DR: This work shows the superiority of a greedy strategy and justifies the choice of Bayesian optimization as the primary search methodology over random / grid search, and introduces the technique of 'search transfer', which demonstrates the generalization capabilities of the models found by the framework to multiple datasets.
Proceedings ArticleDOI

Area optimization of resilient designs guided by a mixed integer geometric program

TL;DR: A gate-sizing based mixed integer geometric programming framework to analytically model and optimize paths during resynthesis guided by the mathematical model versus a previously published naive brute-force approach is proposed.
Proceedings ArticleDOI

qCDC: Metastability-Resilient Synchronization FIFO for SFQ Logic

TL;DR: This paper shows that naive SFQ clock domain crossing (CDC) first-in-first-out buffers (FIFOs) are vulnerable to delay increases, motivating the need for more robust CDC FIFOs, and proposes a novel 1-bit metastability-resilient SFQCDC FIFO that delivers over a 1000 reduction in logical error rate at 30 GHz.
Proceedings ArticleDOI

RTL verification of timed asynchronous and heterogeneous systems using symbolic model checking

TL;DR: This paper formalizes the verification problem and demonstrates how time-discretization, abstraction, and non-determinism can lead to a system model comprised of communicating finite state machines composed synchronously.