PDF Archive

Easily share your PDF documents with your contacts, on the Web and Social Networks.

Share a file Manage my documents Convert Recover PDF Search Help Contact



Lect 1 Ch6 Oct 2015 .pdf



Original filename: Lect 1 Ch6 Oct 2015.pdf
Title: Slide 1
Author: David Buchla;k. amin

This PDF 1.5 document has been generated by Microsoft® PowerPoint® 2013, and has been sent on pdf-archive.com on 05/11/2015 at 22:41, from IP address 41.37.x.x. The current document download page has been viewed 266 times.
File size: 1.2 MB (46 pages).
Privacy: public file




Download original PDF file









Document preview


2 ‫تصميم منطقي‬
Logic Design II
By
A. Prof. Khalid M. Amin

Course Contents

1.
2.
3.
4.
5.

3

Introduction and revision
Latches, Flip-Flops, and Timers
Shift Registers
Counters
Data Storage (Memory)

Floyd, Digital Fundamentals, 10th ed

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved

Some Important Points

• Course Marks:
– 10 Midterm
– 10 Practical final exam
– 20 (Quizzes, Attendance, Experiments,
Reports)
– 60 Final

4

Floyd, Digital Fundamentals, 10th ed

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved

Some Important Points

• Experiments & tutorials
• Required Hardware List

5

Floyd, Digital Fundamentals, 10th ed

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved

Lecture 1: Revision

6

Summary
Half-Adder
Basic rules of binary addition are performed by a
half adder, which has two binary inputs (A and B)
and two binary outputs (Carry out and Sum).
The inputs and outputs can be summarized on a
truth table.

Inputs Outputs
A
0
0
1
1

B
0
1
0
1

Cout
0
0
0
1

S
0
1
1
0

The logic symbol and equivalent circuit are:
A

S

S

S
A

B

Cout

7 Floyd, Digital Fundamentals, 10th ed

B

Cout

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved

Summary
Full-Adder

Inputs

By contrast, a full adder has three binary
inputs (A, B, and Carry in) and two binary
outputs (Carry out and Sum). The truth table
summarizes the operation.
A full-adder can be constructed from two
half adders as shown:
A

A

S

S

A

S

S

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

Outputs
Cin
0
1
0
1
0
1
0
1

Cout
0
0
0
1
0
1
1
1

S
0
1
1
0
1
0
0
1

Sum
S

B

B

Cout

B

A

Cout

B
Cin

Cin
Cout

8 Floyd, Digital Fundamentals, 10th ed

S

Cout

Symbol

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved

9

Floyd, Digital Fundamentals, 10th ed

© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved


Related documents


ch 7 oct 2015 part 1
lect 1 ch6 oct 2015
government
assembly language for x86
lect6
a


Related keywords