Random Logic Implementation

10/2/98


Click here to start


Table of Contents

Random Logic Implementation

Regular Two-Level Logic

Complete Minterm Array

Memory Example

Memory Alternatives

Programmable Logic Array

PLAs

PLA Example

Another PLA Example

PLA Example

Programmable Array Logic (MMI PAL)

PALs

PALs vs. Discrete Logic

Limits of PALs

Regular Structure for Two-Level Combinational Logic

Multiplexer Logic

Multiplexer Logic (cont’d)

Multiplexer Logic (cont’d)

Multiplexers (cont’d)

Decoder Logic

Decoders/Demultiplexers (cont’d)

Decoders/Demultiplexers (cont’d)

Timing Behavior of Circuits

Timing Comparison of Alternative Implementations

Combinational Hazards

Kinds of Hazards

Hazards

Static Hazards

Hazard-Free Circuit

Detecting/Removing Static Hazards

Hazard-Free Logic

What About PLAs, PALs and ROMs?

Dynamic Hazards

Dynamic Hazard Example

Time Response in Combinational Networks

Case Study: N-bit Adder

Half Adder

Full Adder

Full Adder (cont'd)

Full and Half Adders

Adder/Subtractor

Ripple-Carry Adders

Ripple-Carry Adders (cont'd)

Carry-Lookahead Adders

Carry-Lookahead Adders (cont'd)

Carry-Lookahead and Parallel-Prefix

Carry-Lookahead Implementation

Carry-Lookahead Implementation (cont’d)

Carry-Lookahead Implementation (cont’d)

Carry-Lookahead Adder

Carry-Select Adder

Carry-Select Adder (cont’d)

Carry-Select Adder (cont'd)

Author: Carl Ebeling

Email: 567-webmaster@cs.washington.edu

Home Page: http://www.cs.washington.edu//education/courses/567/CurrentQtr