July 2001
Intermediate to advanced
424 pages
11h 53m
English
Content preview from Asynchronous Circuit DesignBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Index
A
Absolute complement, 361
Absorbed, 167
Actions, 116
Adjacent, 87
Adverse example, 280
AFSM, 89
See also asynchronous finite state machine
Aliases, 42
Allowed sequences, 208
See also trace
Always operator, 297
timed, 303
AMULET, 323
Arbiter, 340
Arbitration, 340
See also synchronization
Arc, 86
Architecture, 25
Assert statement, 59
Asymmetric
choice nets, 108
confusion, 107
Asynchronous
circuit design
future?, 341
history, 322
handshake, 2
instruction-length decoder, 325
See also RAPPID
microprocessors, 323
AMULET, 323
Caltech, 323
pager, 324
timing, 2
Atomic gate, 225
implementation, 225
Attribute, 27
Autofailure, 309
manifestation, 308
Average-case
logic optimization, 327
performance analysis, 329
B
Base functions, 190
BCP algorithm, 134
See also covering problem
bounding, 137
branching, 138
example, 149
reduction, 135
termination, 137
Binary
decision diagram, 198
relations, 362
Binate covering problem, 133
Bipartite graph, 88
Blocks, 155
BM machines, 92
See also burst-mode
edge-labeling functions, 92
maximal set property, 92
state diagram, 92
unique entry point, 92
Boolean
matching, 191
matrix, 157
Bounded
delay, 14
gate and wire delay, 132
response time, 300
Bounding, 137
Branching, 138
Bridging fault model, 332
Buffer, 58
Bundled data, 61
Bundling constraint, 62
Burst-mode, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.