Part 2 - Design of Boolean Logics Gray code (GC) is a binary code that ensures that from one transition to another, there is only a single one-bit value that changes, as illustrated with the following Truth table. We aim to design a Ray code conversion system. Decimal 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 (F3 F₂ F₁ Fo) Gray code 0000 0001 0011 0010 0110 0111 0101 0100 1100 1101 1111 1110 1010 1011 1001 1000 For each GC output named F in (F3F₂ F₁ Fo) a. Write a simplified Boolean expression of each F output using K-maps b. Derive the product of sum canonical form of F then write F using maxterms using the same K-map c. Draw the gates diagram of F₂ using AND, OR and NOT gates (use only 2 inputs gates) d. Draw the gate diagram of F₁ using NANDS and be sure to apply all possible gate simplifications. Count the number of NANDS used to implement F₁ e. Implement F₁ using a 16 to 1 simple multiplexer f. Implement F₁ using 8 to 1 multiplexers g. Implement F₁ using a 4 to 16 simple decoder h. Implement F, using 3 to 8 with enable decoder

Introductory Circuit Analysis (13th Edition)
13th Edition
ISBN:9780133923605
Author:Robert L. Boylestad
Publisher:Robert L. Boylestad
Chapter1: Introduction
Section: Chapter Questions
Problem 1P: Visit your local library (at school or home) and describe the extent to which it provides literature...
icon
Related questions
Question

i don't know how to solve this 

Part 2 - Design of Boolean Logics
Gray code (GC) is a binary code that ensures that from one transition to another, there is only a
single one-bit value that changes, as illustrated with the following Truth table. We aim to design
a Ray code conversion system.
Decimal
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
(F3 F₂ F₁ F₁) Gray code
0000
0001
0011
0010
0110
0111
0101
0100
1100
1101
1111
1110
1010
1011
1001
1000
For each GC output named Fin (F3 F₂ F₁ Fo)
a. Write a simplified Boolean expression of each F output using K-maps
b. Derive the product of sum canonical form of F then write F using maxterms using the
same K-map
C. Draw the gates diagram of F₁ using AND, OR and NOT gates (use only 2 inputs gates)
d. Draw the gate diagram of F₁ using NANDS and be sure to apply all possible gate
simplifications. Count the number of NANDS used to implement F₁
e. Implement F₁ using a 16 to 1 simple multiplexer
f. Implement F₁ using 8 to 1 multiplexers
g. Implement F₁ using a 4 to 16 simple decoder
h. Implement F₁ using 3 to 8 with enable decoder
Transcribed Image Text:Part 2 - Design of Boolean Logics Gray code (GC) is a binary code that ensures that from one transition to another, there is only a single one-bit value that changes, as illustrated with the following Truth table. We aim to design a Ray code conversion system. Decimal 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 (F3 F₂ F₁ F₁) Gray code 0000 0001 0011 0010 0110 0111 0101 0100 1100 1101 1111 1110 1010 1011 1001 1000 For each GC output named Fin (F3 F₂ F₁ Fo) a. Write a simplified Boolean expression of each F output using K-maps b. Derive the product of sum canonical form of F then write F using maxterms using the same K-map C. Draw the gates diagram of F₁ using AND, OR and NOT gates (use only 2 inputs gates) d. Draw the gate diagram of F₁ using NANDS and be sure to apply all possible gate simplifications. Count the number of NANDS used to implement F₁ e. Implement F₁ using a 16 to 1 simple multiplexer f. Implement F₁ using 8 to 1 multiplexers g. Implement F₁ using a 4 to 16 simple decoder h. Implement F₁ using 3 to 8 with enable decoder
Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Logic Gate and Its Application
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, electrical-engineering and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Introductory Circuit Analysis (13th Edition)
Introductory Circuit Analysis (13th Edition)
Electrical Engineering
ISBN:
9780133923605
Author:
Robert L. Boylestad
Publisher:
PEARSON
Delmar's Standard Textbook Of Electricity
Delmar's Standard Textbook Of Electricity
Electrical Engineering
ISBN:
9781337900348
Author:
Stephen L. Herman
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Electrical Engineering
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
Fundamentals of Electric Circuits
Fundamentals of Electric Circuits
Electrical Engineering
ISBN:
9780078028229
Author:
Charles K Alexander, Matthew Sadiku
Publisher:
McGraw-Hill Education
Electric Circuits. (11th Edition)
Electric Circuits. (11th Edition)
Electrical Engineering
ISBN:
9780134746968
Author:
James W. Nilsson, Susan Riedel
Publisher:
PEARSON
Engineering Electromagnetics
Engineering Electromagnetics
Electrical Engineering
ISBN:
9780078028151
Author:
Hayt, William H. (william Hart), Jr, BUCK, John A.
Publisher:
Mcgraw-hill Education,