7 views

Uploaded by krinavtm

- dept_34_lv_3_14909.pdf
- In-Place Power Optimization for LUT-Based FPGAs
- Manual Iface
- MELJUN CORTES HANDOUTS_Combinational Logic (Part 1)
- EN1802 Lecture 7,May 2014
- Untitled
- Hamming Code PPT
- Logic
- Artificial Intelligence
- Hdl Implementation of Orthogonal Code Convolution
- Module
- RGPV Syllabus for 4th Sem Mechanical Branch - KopyKitab Resources
- Modbus Chapter 1
- bin_circ.pdf
- Us Art
- Structure Coverage Metrics
- 3 Easy Steps to Understand and Control Your RS232 Devices
- DOSPRN Manual
- Circuit Nanotechnology: QCA Adder Gate Layout Designs
- Chapter 01 Lec 01

You are on page 1of 9

PROBLEM 1. [10 POINTS] Construct truth tables for the following Boolean expressions, where the complement of a variable w is written as w. a) xyz + xyz + xyz

xyz + xyz + xyz Inputs Outputs x y z xyz 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 Inputs Outputs x y' z' xyz' 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 0 Inputs Outputs x' y z' xyz 1 0 1 0 1 0 0 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0

=

xyz 0 0 0 0 0 0 0 1 Inputs Outputs xyz' xyz xyz + xyz + xyz 0 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1

b) xz + xyz

xz + xyz x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 x'z 0 1 0 1 0 0 0 0 xyz 1 0 0 0 0 0 0 0 xz + xyz 1 1 0 1 0 0 0 0

PROBLEM 2 [10 POINTS] The truth table for Boolean function F is shown below. Write F in sum-of-products form.

x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 F 0 0 1 1 0 1 0 0 Minterm

x 0 0 0 0 1 1 1 1

y 0 0 1 1 0 0 1 1

z 0 1 0 1 0 1 0 1

x' y z x'yz 1 0 0 1 0 1 1 1 0 1 1 1 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 1 0 0 0 0

x y' z xy'z 0 1 0 0 1 1 0 0 0 0 0 1 1 1 0 1 1 1 1 0 0 1 0 1 0 0 0 0 0 1 0 0

PROBLEM 3 [10 POINTS] a) Null and Lobur, Chapter 3, exercise 29. Draw the combinational circuit that directly implements the following Boolean expression:

F (x, y, z) = xz + (xy + z)

b) Null and Lobur, Chapter 3, exercise 32. Find the truth table that describes the following circuit:

F (x, y, z) = (x + xy)

(xz)

x

0 0 0 0 1 1 1 1

y

0 0 1 1 0 0 1 1

0 1 0 1 0 1 0 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0

x'y

0 0 1 1 0 0 0 0

x + xy

0 0 1 1 1 1 1 1

xz

0 1 0 1 0 0 0 0

(x + xy) X OR (xz)

0 1 1 0 1 1 1 1

PROBLEM 4 [10 POINTS] Consider a data communications system that represents characters using ASCII with odd parity. Each 7-bit ASCII character is followed by a parity bit. Specify the resulting 8-bit code word for each of the characters in the following message that is to be transmitted: Hokies! (There are 7 characters in this message, including the exclamation mark.) 8- bit code word for each of the characters of Hokies! message using ASCII code with odd parity.

H o k i e s !

## ## ## ## ## ## ##

1 1 0 1 1 0 1

1 1 1 1 1 1 0

0 1 1 1 1 1 1

0 0 1 0 0 1 0

1 1 0 1 0 0 0

0 1 1 0 1 0 0

0 1 0 0 0 1 0

0 1 1 1 1 1 1

The parity bit is showed at the left for each character, the others 7 bits are from the ASCII table.

PROBLEM 5 [10 POINTS] Consider table 3.10 in Null and Lobur. Assume that the parity bit is a function of Boolean variables x, y, and z. Represent this function in the following ways: a) as a Boolean algebra expression; and

x

0 0 0 0 1 1 1 1

y

0 0 1 1 0 0 1 1

z

0 1 0 1 0 1 0 1

Parity Bit

1 0 0 1 0 1 1 0

xyz

Parity bit (x, y, z) = xyz + xyz + xyz + xyz b) as a combinational logic diagram (logic circuit).

PROBLEM 6 [10 POINTS] Null and Lobur, Chapter 3, exercise 51. Complete the truth table for the following sequential circuit.

TRUTH TABLE

x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 S 0 1 1 0 1 0 0 1 Q 0 0 0 1 0 1 1 1

Assume that the flip-flops are positive-edge triggered, and assume that they have all been reset to 0. Complete the following timing diagram for signals A, Q2, Q1, and Q0. (Initially, A has value 1 and Q2=Q1=Q0=0.)

SOLUTION

PROBLEM 8 [20 POINTS] In this problem, you are to design, simulate and test a simple combinational logic circuit using Logisim, a graphical tool for designing and simulating logic circuits. The tool can be downloaded as freeware from http://ozark.hendrix.edu/~burch/logisim/. The circuit that you should design is a 2-bit comparator. It takes two 2-bit values, A1A0 and B1B0, as inputs and has one output, X. The output should be equal to 1 if and only if the two 2-bit values are identical (e.g., if A1A0 = 01 and B1B0 = 01). Simulate your circuit using Logisim, testing for all combinations of inputs. Label all inputs and the output. Insert into your homework submission a picture of the circuit as drawn in Logisim. You can use the Export to GIF option to do that. (Please do not provide the picture as a separate file.)

(Recommended: Complete the tutorial provided with Logisim 2.7.1. The tutorial is under the Help menu in Logisim or at http://ozark.hendrix.edu/~burch/logisim/docs/2.7/en/html/guide/tutorial/. This is for your own education. This will not gain you extra credit.)

- dept_34_lv_3_14909.pdfUploaded byMinh Nam
- In-Place Power Optimization for LUT-Based FPGAsUploaded byKa Chara
- Manual IfaceUploaded bychelo_king
- MELJUN CORTES HANDOUTS_Combinational Logic (Part 1)Uploaded byMELJUN CORTES, MBA,MPA
- EN1802 Lecture 7,May 2014Uploaded byAruna Kumarasiri
- UntitledUploaded byJerome Onos
- Hamming Code PPTUploaded byDhairya Modi
- LogicUploaded byMarie Antoniette Lozada
- Artificial IntelligenceUploaded byLuckinsi Samuel
- Hdl Implementation of Orthogonal Code ConvolutionUploaded byOmkar Joshi
- ModuleUploaded bymohiuddin_vu
- RGPV Syllabus for 4th Sem Mechanical Branch - KopyKitab ResourcesUploaded byCrimsontyphoon11
- Modbus Chapter 1Uploaded byPankaj Mevada
- bin_circ.pdfUploaded byDavid Martin
- Us ArtUploaded byapi-3742890
- Structure Coverage MetricsUploaded byapi-3738458
- 3 Easy Steps to Understand and Control Your RS232 DevicesUploaded bywinkyi
- DOSPRN ManualUploaded byPaulo Cezar Aoki
- Circuit Nanotechnology: QCA Adder Gate Layout DesignsUploaded byInternational Organization of Scientific Research (IOSR)
- Chapter 01 Lec 01Uploaded byMariam Siddiqui
- Area MeasurementUploaded bygalati12345
- Switching Theory and Logic DesignUploaded byMoez Ul Hassan
- Morse CodeUploaded byVrushali Khatpe
- rfc764Uploaded byNickyNET
- ttm-000Uploaded bygroup_electric
- ASCII Code - The Extended ASCII TableUploaded byJavier Humberto Espinoza Flores
- Digital Lab ManualUploaded byKALAIMATHI
- Etc 255Uploaded byRaf Oquin
- ML320 Reference GuideUploaded byPatoRMT

- CON8567 Abushaban Exadata EM12cUploaded bygirgl
- SAP BW ConceptsUploaded byredsun97
- solrrecipesuberconf11-110714193431-phpapp01Uploaded byNeko Neki
- Winsem2012-13 Cp0535 30-Jan-2013 Rm01 Dwdm Model Quiz PaperUploaded bythelionphoenix
- HY57V561620Uploaded bySaleem Beg
- NABARD DA Computer Knowledge Question PapersUploaded bynaresh1272
- NetAppandVMwarevSphereStorageBestPracticesJUL10.pdfUploaded bySant.santi
- manual_cog_612_new.pdfUploaded byVictor Chowdhury
- ITPSunsetUploaded bysamanthafcooper_2753
- Final Ecom Lab ManualUploaded bySujeetpatil
- MySQL-NetBeans_Creating a Simple Web Application_Tutorial.pdfUploaded byRhoby Syadani
- IT_05106_DBMSUploaded bysjognipa
- Introduction to Database Administrator.pptUploaded byFastest Motegi
- 9781788291118-Ibm Spss Modeler EssentialsUploaded byrajeshisn
- LITERATURE SURVEY ON WIRELESS COMMUNICATION NETWORK.http://iaetsdjaras.org/Uploaded byiaetsdiaetsd
- Reasoning Test.docxUploaded bymca_java
- [FREE]Braindump2go 70-243 Dumps 61-70Uploaded bybraindump2govce
- a tables and frame guide for htmlUploaded byJohn808
- PreTest.docUploaded byRaymund Bonde
- The Function Pointer Tutorials - SyntaxUploaded byhkchalki
- Network+ TablesUploaded byJohn Tanga Bulak
- 155650 Lab Grading Rubric 2.1Uploaded byNikmohamad Ridzwan
- Copia de E4 Lab PT OutlineUploaded bynandoll
- TMP3100_420_AJUploaded byDanielAli
- Garmin IMG (.img) File FormatUploaded byJ. Albert Bowden II
- CC2530 ZNP Interface SpecificationUploaded byNguyễn Huynh
- ACN SyllabusUploaded byसुरेन्द्र वशिष्ठ
- lab the online world bookUploaded byapi-316099106
- Windows Azure - Alexis Castanares Ver 3.0Uploaded byrcmoncada
- Azure Infrastructure Quick Start LinkedUploaded byNavanath