Anda di halaman 1dari 41

Advanced Topics in Logic Design

Praveen Meduri

Lecture – 1 Introduction and Basics

Thanks to Jr. Charles H. Roth and Lizy K. John


Course Info
• Times: Refer to SacCT
• Location: Refer to SacCT
• Instructor
• Dr. Praveen Meduri
• praveen.meduri@csus.edu
• Labs: Using Nexys 4 DDR
• SacCT: Communication medium
What the heck is this class about?
• HDL Based Digital Design Using Reconfigurable Logic

• VHDL Coding

• Review Basic and intermediate Digital Building Blocks

• Use FPGA (Nexys 4 DDR Board from Xilinx) to implement out designs

• And from time to time, some Crazy Analogies . . .


Speaking of crazy analogies…
• Family guy!
Haven’t you heard?
• Samsung Galaxy S8 Snapdragon 835

• 10 nm FinFET

• 3 Billion transistors

• Emphasis on battery life and sustained


performance

• Amazing !!!
Valuable Skill 
• FPGA revolution has changed human lives

• Ubiquitous and integral part

• Image Processing, DSP, En/Decrypt algorithms,


financial analysis, and many more

• Very valuable skill – FPGA design


Xilinx, American technology company,
Supplier of programmable logic devices.
Invented the FPGAs
First fabless semiconductor company
Digital Design Fundamentals – Review
Combinational circuit basics
• Boolean algebra
• Operators, basic logic gates
• Complex gates
• Logic minimization
Sequential circuit basics
• Latches and flip-flops
• Finite state machines
• Design and implementation
Part – 1

Combinational Circuit Basics


Boolean Algebra
• Unity operators A0 A
A 1  A

• Complement A A 1
 A A  0
• Commutativity A B B A
A B  B A

• Associativity


• Distributive Law
Boolean Algebra
• Duality f ( A, B,1,0,,)  f ( A, B,0,1,,)
A A  A
1 A  1
A  AB  A
A  AB  A  B
• DeMorgan’s Theorem A  B  AB
A B  A  B
A A
A+B A•B
B B

A A
A•B A+B
B B
Operators, Basic Logic Gates
• AND A B A•B • NAND A B A•B
0 0 0 0 0 1
f (A,B)  A  B  A B 0 1 0
f ( A, B )  A  B  A  B 0 1 1
A 1 0 0 A 1 0 1
A•B A•B
B 1 1 1 B 1 1 0

• OR
A B A+B
f (A,B)  A  B  A B 0 0 0 • NOR
A B A+B
A
0 1 1 f (A,B)  A  B  A B
A+B 1 0 1 0 0 1
B
1 1 1 0 1 0
A
A+B 1 0 0
B
 1 1 0
• NOT
C  NOT ( A)  A'  A
Operators, Basic Logic Gates
Complex Logic Gates
Complex Logic Gates
CMOS Implementation of Logic Gates
CMOS Implementation of Logic Gates
What is this circuit?
a) Weak Inverter

b) Strong Inverter

c) Weak buffer

d) Strong buffer
Odd or Even Functions
Buffer
Buffer
Hi-Impedance Outputs
Hi-impedance Outputs continued…
3 – State Buffer
Transmission Gates
Circuit Example Using TG
Logic Minimization
K – Map Example
Logic Minimization
Part – 2

Sequential Circuit Basics


D-Latch
D Flip-Flop (DFF)
JK Flip-Flop (JKFF)
Summary

Anda mungkin juga menyukai