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

Noel R. Strader

dblp:43/1517 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Systems, architecture and hardware · 4 · 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
Integrated circuit design · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › digital circuit design
arithmetic circuit design
0.011982
A Canonical Bit-Sequential Multiplier · IEEE Trans. Computers 1982
Integrated circuit design › digital circuit design › arithmetic circuit design › multiplier design
bit-sequential multiplier
0.011982
A Canonical Bit-Sequential Multiplier · IEEE Trans. Computers 1982
Integrated circuit design
digital circuit design
0.011982
A Canonical Bit-Sequential Multiplier · IEEE Trans. Computers 1982
Integrated circuit design
VLSI design
0.011982
A Canonical Bit-Sequential Multiplier · IEEE Trans. Computers 1982

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

carry-save addition · 0.0
YearPublicationVenuePosition
1996 Commercial Design Verification: Methodology and Tools
abstract
Commercial design verification is a complex activity involving many abstraction levels (such as architectural, register transfer, gate, switch, circuit, fabrication), many different aspects of design (such as timing, speed, functional, power, reliability and manufacturability) and many different design styles (such as ASIC, full custom, semi-custom, memory, cores, and asynchronous). We present a representative design flow and methodology that is common to many commercial integrated circuit design environments and that concentrates on functional validation using informal verification (e.g., simulation, emulation and ATPG) and formal verification (e.g., logic checking and sequential verification).
Carl Pixley, Noel R. Strader, William C. Bruce, Matt Kaufmann, Kurt Shultz, Michael Burns, Jainendra Kumar, Jun Yuan 0007, Janet Nguyen
ITC2
1995 Emulation verification of the Motorola 68060
abstract
Large-scale hardware logic emulation using software configurable hardware provides a new means to significantly improve verification of complex integrated circuits such as today's advanced microprocessors. The essence of hardware logic emulation is the provision of a hardware prototype of the circuit being designed. Such a hardware prototype can execute both pseudo-random verification vectors and software application programs up to six orders-of-magnitude faster than conventional software logic simulators. Trillions of verification vectors can be run on the emulation model for verification in only a few weeks compared to the prior best practice of running only billions of verification vectors in many months. Application of hardware logic emulation requires a sound design methodology with an HDL model (RTL or at least gate-level), an unlimited source of vectors or software applications intended to exercise the design in a target system.
Jainendra Kumar, Noel R. Strader, Jeff Freeman
ICCD2
1983 Microelectronic architectures and devices for signal and symbol processing
Ralph K. Cavin III, Noel R. Strader
Integr.2
1982 A Canonical Bit-Sequential Multiplier
abstract
A serial multiplier suitable for VLSI implementation is discussed. The multiplier accepts binary operands supplied in a serial fashion, least significant bits first. The multiplier uses a canonical cell which allows calculation of a 2k length product with only k identical cells. These cells utilize the carry-save addition technique to provide a delay which exhibits only a first-order dependence on the number of bits in the product. The internal logic for generating the inputs to the carry-save adders is given. This cell directly accepts the bit-serial inputs and generates a bit-serial output. Longer binary operands can be multiplied by simply cascading identical cells without change to existing cells. A given multiplier can process shorter operands in correspondingly shorter times. Applicability of this technique to VLSI implementation of the basic multiply/add operation useful in signal processing algorithms is described.
Noel R. Strader, V. Thomas Rhyne
IEEE Trans. Computers1