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

Joanne DeGroat

dblp:06/5921 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

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

Systems, architecture and hardware · 2Computer networks · 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
2 papers
Electronic design automation · 54% Memory systems · 46%
Computer networks
1 paper
Routing and switching · 67% Internet architecture and protocols · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
hardware verification
0.012001
Teaching Future Verification Engineers: The Forgotten Side of Logic Design · DAC 2001
Electronic design automation › hardware verification and test › functional verification
logic verification
0.012001
Teaching Future Verification Engineers: The Forgotten Side of Logic Design · DAC 2001
Internet architecture and protocols › packet processing
packet classification
0.012000
A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds · INFOCOM 2000
Routing and switching
route caching
0.012000
A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds · INFOCOM 2000
Routing and switching
router architecture
0.012000
A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds · INFOCOM 2000
Memory systems
cache design
0.012000
A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds · INFOCOM 2000
Memory systems › cache › cache organization
set-associative cache
0.012000
A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds · INFOCOM 2000

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

near-LRU replacement · 0.1n-universal hashing · 0.1
YearPublicationVenuePosition
2007 A CMOS Variable Gain Front-end for a WCDMA Receiver
abstract
This paper describes a variable gain WCDMA front-end receiver based on a direct conversion architecture in 0.18-μm CMOS. The front-end comprises a low noise variable gain amplifier (LNA) and a mixer. The LNA provides a 50-Ω input impedance and utilizes a tuned load to provide high selectivity. The front-end achieves a voltage conversion gain of 29.3 dB in the high gain mode of the LNA within 1-dB compression point dBm (iCP1dB) of -21 dBm. The front-end acquires an NF of 4.4 dB with an input return loss, S11, of -12.4 dB. The front-end achieves an in-band IIP3 of -6.16 dBm. The integrated LNA and mixer consumes approximately 9.2 mA of current from a 1.8-V power supply.
Shaikh K. Alam, Joanne DeGroat
ISCAS2
2001 Teaching Future Verification Engineers: The Forgotten Side of Logic Design
abstract
This paper describes a senior/graduate level course in hardware logic verification being offered by The Ohio State University in cooperation with IBM. The need for the course is established through the growing importance of logic verification to users of custom logic designs. We discuss the short-term and long-term goals for the course, and describe the course content and format. The course relies heavily on lab projects to illustrate the main concepts. Three projects and a final project review are described.
Füsun Özgüner, Duane W. Marhefka, Joanne DeGroat, Bruce Wile, Jennifer Stofer, Lyle Hanrahan
DAC3
2000 A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds
abstract
Existing and emerging layer-4 switching technologies require packet classification to be performed on more than one header field, known as layer-4 lookup. Currently, the fastest general layer-8 lookup scheme delivers a throughput of 1 million lookups per second (MLPS), far off from 25/75 MLPS needed to support 50/150 Gbps layer-4 router. We propose the use of route caching to speed up layer-4 lookup, and design and implement a cache architecture for this purpose. We investigated the locality behavior of the Interent traffic (at layer-4) and propose a near-LRU algorithm that can best harness this behavior. In implementation, to best approximate fully-associative near-LRU using relatively inexpensive set-associative hardware, we invented a dynamic set-associative scheme that exploits the nice properties of N-universal hash functions. The cache architecture achieves a high and stable hit ratio above 90 percent and a fast throughput up to 75 MLPS at a reasonable cost.
Jun (Jim) Xu, Mukesh Singhal, Joanne DeGroat
INFOCOM3