Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 23, 30]

Similar documents
COMBINATIONAL CIRCUITS

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Combinational circuits

Understanding Logic Design

Binary Adders: Half Adders and Full Adders

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

Boolean Algebra Part 1

Copyright Peter R. Rony All rights reserved.

5 Combinatorial Components. 5.0 Full adder. Full subtractor

BINARY CODED DECIMAL: B.C.D.

EE 261 Introduction to Logic Circuits. Module #2 Number Systems

CSE140: Components and Design Techniques for Digital Systems

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, The Binary Adder

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:

CSE140: Midterm 1 Solution and Rubric

Combinational Logic Design

Sistemas Digitais I LESI - 2º ano

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

DEPARTMENT OF INFORMATION TECHNLOGY

Counters and Decoders

Digital Design. Assoc. Prof. Dr. Berna Örs Yalçın

Two-level logic using NAND gates

Simplifying Logic Circuits with Karnaugh Maps

Upon completion of unit 1.1, students will be able to

ENGI 241 Experiment 5 Basic Logic Gates

Karnaugh Maps (K-map) Alternate representation of a truth table

Operating Manual Ver.1.1

Chapter 1: Digital Systems and Binary Numbers

RAM & ROM Based Digital Design. ECE 152A Winter 2012

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

Circuits and Boolean Expressions

List of Experiment. 8. To study and verify the BCD to Seven Segments DECODER.(IC-7447).

The string of digits in the binary number system represents the quantity

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

CH3 Boolean Algebra (cont d)

MATH 102 College Algebra


Gates, Circuits, and Boolean Algebra

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

2011, The McGraw-Hill Companies, Inc. Chapter 3

Course Requirements & Evaluation Methods

Two's Complement Adder/Subtractor Lab L03

DESIGN OF GATE NETWORKS

Lecture 4: Binary. CS442: Great Insights in Computer Science Michael L. Littman, Spring I-Before-E, Continued

CPEN Digital Logic Design Binary Systems

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

Let s put together a Manual Processor

Seven-Segment LED Displays

Number and codes in digital systems

2.0 Chapter Overview. 2.1 Boolean Algebra

Today s topics. Digital Computers. More on binary. Binary Digits (Bits)

Unit 3 Boolean Algebra (Continued)

Digital Electronics Detailed Outline

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

Introduction. The Quine-McCluskey Method Handout 5 January 21, CSEE E6861y Prof. Steven Nowick

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

NUMBER SYSTEMS. 1.1 Introduction

CHAPTER 3 Boolean Algebra and Digital Logic

Basic Logic Gates Richard E. Haskell

Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8

Online EFFECTIVE AS OF JANUARY 2013

Hexadecimal and Numeric Indicators. Technical Data

Guru Ghasidas Vishwavidyalaya, Bilaspur (C.G.) Institute of Technology. Electronics & Communication Engineering. B.

HCF4028B BCD TO DECIMAL DECODER

Chapter 7 Memory and Programmable Logic

COMPUTER SCIENCE. Paper 1 (THEORY)

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

LOGICOS SERIE Precios sujetos a variación. Ref. Part # Descripción Precio Foto Ref. Quad 2-Input NOR Buffered B Series Gate / PDIP-14

plc numbers Encoded values; BCD and ASCII Error detection; parity, gray code and checksums

THE BINARY NUMBER SYSTEM

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa

Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course

Standart TTL, Serie Art.Gruppe

Apprentice Telecommunications Technician Test (CTT) Study Guide

SOLUTIONS MANUAL DIGITAL DESIGN FOURTH EDITION M. MORRIS MANO California State University, Los Angeles MICHAEL D.

Digital Systems Laboratory

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Systems I: Computer Organization and Architecture

Figure 8-1 Four Possible Results of Adding Two Bits

LSN 2 Number Systems. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1

Gray Code Generator and Decoder by Carsten Kristiansen Napier University. November 2004

Chapter 2 Logic Gates and Introduction to Computer Architecture

Negative Integral Exponents. If x is nonzero, the reciprocal of x is written as 1 x. For example, the reciprocal of 23 is written as 2

(1) /30 (2) /30 (3) /40 TOTAL /100

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Logic Reference Guide

CSI 333 Lecture 1 Number Systems

Lab 1: Study of Gates & Flip-flops

ANALOG & DIGITAL ELECTRONICS

EE360: Digital Design I Course Syllabus

PART B QUESTIONS AND ANSWERS UNIT I

University of St. Thomas ENGR Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54

3.Basic Gate Combinations

BOOLEAN ALGEBRA & LOGIC GATES

Binary full adder. 2-bit ripple-carry adder. CSE 370 Spring 2006 Introduction to Digital Design Lecture 12: Adders

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576

Transcription:

Chapter 4: Combinational Logic Solutions to Problems: [, 5, 9, 2, 23, 3] Problem: 4- Consider the combinational circuit shown in Fig. P4-. (a) Derive the Boolean epressions for T through T 4. Evaluate the outputs of F and F 2 as a function of the four inputs. (b) List the truth table with 6 binar combinations of the four inputs variables. Then list the binar values for T through T 4 and outputs F and F 2 in the table. (c) Plot the output Boolean functions obtained in part (b) on maps and show that the simplified Boolean epressions are equivalent to the ones obtained in part (a). Solution: (a) The Boolean epressions for T through T 4. The outputs of F and F 2 as a function of the four inputs. T T 4 F T F B C T T A( D) A BD B C B D ( A A )( A BD ) B C B D A BD B C B D 2 2 3 D T T A B T D A BD ( A B) D A BD ( A B ) D 4 2 2 A AD A BD B C B D D A B 3 A T A B C A BD AD B D Page of

(b) The truth table with 6 binar combinations of the four inputs variables with the binar values for T through T 4 and outputs F and F 2 : A B C D T T 2 T 3 T 4 F F 2 (c) Plot of the output Boolean functions obtained in part (b) on maps Map for F : C The simplified epression from the CD map is: AB F A BC BD B D A B Map for F 2 : The simplified epression from the map is: F D A B 2 AB CD D C A B The simplified Boolean epressions are equivalent to the ones obtained in part (a). Problem: 4-5 D Page 2 of

Design a combinational circuit with three inputs,, and, and the three outputs, A, B, and C. when the binar input is,, 2, or 3, the binar output is one greater than the input. When the binar input is 4, 5, 6, or 7, the binar output is one less than the input. Solution: Design procedure:. Derive the truth table that defines the required relationship between inputs and outputs. X Y A B C 2. Obtain the simplified Boolean functions for each output as a function of the input variables. Map for output A: The simplified epression from the map is: A Map for output B: The simplified epression from the map is: B Map for output C: The simplified epression from the map is: C ' Page 3 of

3. Draw the logic diagram. A B C ' Or alternativel: Page 4 of

Problem: 4-9 A BCD-to-seven-segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in a displa indicator used for displaing the decimal digit in a familiar form. The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segments in the displa as shown in Fig. P4-9(a). The numeric displa chosen to represent the decimal digit is shown Fig. P4-9(b). Design the BCD-to-seven-segment decoder using a minimum number of gates. The si invalid combinations should result in a blank displa. Solution: Design procedure:. Derive the truth table that defines the required relationship between inputs and outputs. w a b c d e f g X X X 2. Epress the Boolean epressions for the outputs (a-g) in sum of minterms a(w,,,)= (,2,3,5,6,7,8,9) b(w,,,)= (,,2,3,4,7,8,9) c(w,,,)= (,,3,4,5,6,7,8,9) d(w,,,)= (,2,3,5,6,8,9) e(w,,,)= (,2,6,8) f(w,,,)= (,4,5,6,8,9) g(w,,,)= (2,3,4,5,6,8,9) Page 5 of

3. Draw the logic circuit. Two 3-to-8-line decoders with enable inputs have been connected to form a 4-to-6-line decoder. Together the generate all the minterms of the input variables. OR gates are to be used to implement each of the functions a-g. The inputs to each OR gate are selected from the decoder outputs according to the list of minterm of each function. The diagram below shows the circuit for output a, d and e. The same procedure should be followed to include the remaining functions and complete the logic circuit. Decoder S S 2 D D 8 D D D 2 D 3 e w S 3 ENB Decoder D 4 D 5 D 6 D 7 d a D 8 S D D 9 S 2 D 8 D D S 3 D 2 D 3 ENB D 4 D 5 Page 6 of

Problem: 4-2 (a) Design a half subtractor circuit with inputs and and outputs D and B. The circuit subtracts the bits - and places the difference in D and the borrow in B. (b) Design a full subtractor circuit with three inputs, and and two outputs D and B. The circuit subtracts the bits --, where is the input borrow, B is the output borrow and D is the difference. Solution (a) To design a half subtractor circuit with inputs and and outputs D and B. The circuit subtracts the bits - and places the difference in D and the borrow in B. Design procedure:. Derive the truth table that defines the required relationship between inputs and outputs. D B 2. Obtain the simplified Boolean functions for each output as a function of the input variables. D= + B= 3. Draw the logic diagram. Page 7 of

Solution (b) Design a full subtractor circuit with three inputs, and and two outputs D and B. The circuit subtracts the bits --, where is the input borrow, B is the output borrow and D is the difference. Design procedure:. Derive the truth table that defines the required relationship between inputs and outputs. D B 2. Obtain the simplified Boolean functions for each output as a function of the input variables. D= + + + B=+ + 3. Draw the logic diagram. Page 8 of

Or alternativel using 2 half subtractor and an OR gate: Problem: 4-23 Draw the logic diagram of a 2-to-4 line decoder using NOR gates onl. Include an enable input. Solution: Design procedure:. The truth table for the circuit. E A B D D D 2 D 3 X X D = EA B =(E +A+B) D 2 = EAB =(E +A +B) D = EA B =(E +A+B ) D 3 = EAB =(E +A +B ) A 2. The logic diagram D B D D 2 E D 3 Page 9 of

Problem: 4-3 Specif the truth table of an octal to binar priorit encoder. Provide an output V to indicate that at least one of the inputs is present. The input with the highest subscript number has the highest priorit. What will be the value of the four inputs if inputs D 5 and D 3 are at the same time? Solution: Below is the truth table of an Octal-to-Binar priorit encoder with an output V to indicate that at least one of the inputs is present. The input with the highest subscript number has the highest priorit. D D D 2 D 3 D 4 D 5 D 6 D 7 X Y Z V X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X The value of the four outputs if inputs D 5 and D 3 are at the same time will be X=, Y=, Z=, V=. Page of