Appendix A Logic Circuits

49
Appendix A Logic Circuits

description

Appendix A Logic Circuits. Logic circuits. Operate on binary variables that assume one of two distinct values, usually called 0 and 1 Implement functions of logic variables Circuits have inputs and outputs Circuits are implemented using electronic logic gates. Standard logic gate - PowerPoint PPT Presentation

Transcript of Appendix A Logic Circuits

Page 1: Appendix A Logic Circuits

Appendix ALogic Circuits

Page 2: Appendix A Logic Circuits

Logic circuits

• Operate on binary variables that assume one of two distinct values, usually called 0 and 1

• Implement functions of logic variables

• Circuits have inputs and outputs

• Circuits are implemented using electronic logic gates

Page 3: Appendix A Logic Circuits

Standard logic gate symbols

Page 4: Appendix A Logic Circuits

Implementation of the XOR function using AND, OR, and NOT gates

Page 5: Appendix A Logic Circuits

Synthesis of logic functions

Synthesis is the process of designing and implementing a logic circuit defined by its functional specification.

The expression for f in the previous circuit is said to be in a sum-of-products form, because the OR and AND operations are sometimes called the sum and product functions.

Page 6: Appendix A Logic Circuits

Implementation of a logic function

Page 7: Appendix A Logic Circuits
Page 8: Appendix A Logic Circuits

Proving equivalence of expressions

Page 9: Appendix A Logic Circuits

Rules of binary logic

Page 10: Appendix A Logic Circuits

Minimization of logic expressions

As illustrated in the previous example, a logic function can be implemented with circuits of different complexities.

It is useful to minimize a logic expression to reduce the cost of the synthesized circuit.

Page 11: Appendix A Logic Circuits

Three-variable Karnaugh maps

Page 12: Appendix A Logic Circuits

Four-variableKarnaugh maps

Page 13: Appendix A Logic Circuits

Using don’t cares

Page 14: Appendix A Logic Circuits

NAND and NOR gates

Page 15: Appendix A Logic Circuits

Equivalence of NAND-NAND and AND-OR networks

Page 16: Appendix A Logic Circuits

Cascading of gates

Page 17: Appendix A Logic Circuits

Representation of logic values by voltage levels

Page 18: Appendix A Logic Circuits

Tri-state buffer

Page 19: Appendix A Logic Circuits

A basic latch implemented with NOR gates

Page 20: Appendix A Logic Circuits

Gated SR latch

Page 21: Appendix A Logic Circuits

Gated SR latch implemented with NAND gates

Page 22: Appendix A Logic Circuits

Gated D latch

Page 23: Appendix A Logic Circuits

Master-slave D flip-flop

Page 24: Appendix A Logic Circuits

A negative-edge-triggered D flip-flop

Page 25: Appendix A Logic Circuits

T flip-flop

Page 26: Appendix A Logic Circuits

JK flip-flop

Page 27: Appendix A Logic Circuits

Master-slave D flip-flop with Preset and Clear

Page 28: Appendix A Logic Circuits

Shift register

Page 29: Appendix A Logic Circuits

Parallel-access shift register

Page 30: Appendix A Logic Circuits

A 3-bit up-counter

Page 31: Appendix A Logic Circuits

A two-input to four-output decoder

Page 32: Appendix A Logic Circuits

A BCD-to-7-segmentdisplay decoder

Page 33: Appendix A Logic Circuits

A four-input multiplexer

Page 34: Appendix A Logic Circuits

Multiplexer implementation of a logic function

Page 35: Appendix A Logic Circuits

A block diagram for a PLD

Page 36: Appendix A Logic Circuits

Functional structure of a PLA

Page 37: Appendix A Logic Circuits

A simplified sketch of the previous PLA

Page 38: Appendix A Logic Circuits

An example of a PAL

Page 39: Appendix A Logic Circuits

Inclusion of a flip-flop in a PAL element

Page 40: Appendix A Logic Circuits

Organization of a CPLD

Page 41: Appendix A Logic Circuits

A conceptual block diagram of an FPGA

Page 42: Appendix A Logic Circuits

Sequential circuits

A logic circuit whose output is determined entirely by its present inputs is called a combinational circuit (e.g. decoders and multiplexers).

A logic circuit whose output depends on both the present inputs and the state of the circuit is called a sequential circuit (e.g. counters).

Page 43: Appendix A Logic Circuits

State diagram of a mod-4 up/down counterthat detects the count of 2

Page 44: Appendix A Logic Circuits

State table

Page 45: Appendix A Logic Circuits

State assignment table

Page 46: Appendix A Logic Circuits

The next-state expressions are:

The output expression is

Page 47: Appendix A Logic Circuits

Implementation of the up/down counter

Page 48: Appendix A Logic Circuits

Timing diagram for the designed counter

Page 49: Appendix A Logic Circuits

A formal model of a finite state machine