DON’T CARE CONDITIONS Functions that have unspecified output for some input combinations are called incompletely specified functions. Unspecified minterms.

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

ENEL111 Digital Electronics
The Verilog Hardware Description Language
Verilog Overview. University of Jordan Computer Engineering Department CPE 439: Computer Design Lab.
CPEN Digital System Design
Verilog Intro: Part 1.
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
16/04/20151 Hardware Descriptive Languages these notes are taken from Mano’s book It can represent: Truth Table Boolean Expression Diagrams of gates and.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapters 4 – Part3: Verilog – Part 1.
CSE 341 Verilog HDL An Introduction. Hardware Specification Languages Verilog  Similar syntax to C  Commonly used in  Industry (USA & Japan) VHDL 
ECE 331 – Digital System Design
Gate-Level Minimization

ECE 353 Computer Systems Lab I Verilog Hardware Description Language.
//HDL Example 3-3 // //Stimulus for simple circuit module stimcrct; reg A,B,C; wire x,y; circuit_with_delay swd(A,B,C,x,y);
Hardware Description Language HDL. 2 Hardware Description Language HDL  Describes circuits and systems in text. −As a software program.  Can be processed.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
O VERVIEW OF DIGITAL SYSTEMS Hardware Description Language 1.
Lecture 7 Verilog Additional references Structural constructs
COMP541 Combinational Logic - I
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Combinational Logic. Digital Circuits Introduction Logic circuits for digital systems may be combinational or sequential. A combinational circuit.
Gate-Level Minimization Chapter 3. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
Introduction Verilog is a HARDWARE DESCRIPTION LANGUAGE (HDL) A hardware description language is a language or means used to describe or model a digital.
CENG 241 Digital Design 1 Lecture 5 Amirali Baniasadi
Verilog HDL: A solution for Everybody By, Anil Kumar Ram Rakhyani
1 COMP541 Combinational Logic - I Montek Singh Jan 11, 2012.
CPEN Digital System Design
October 29, 2015 EASTERN MEDITERRANEAN UNIVERSITY1 Digital Logic Design I Gate-Level Minimization Mustafa Kemal Uyguroğlu.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
FPGA-Based System Design Copyright  2004 Prentice Hall PTR Logic Design Process n Functional/ Non-functional requirements n Mapping into an FPGA n Hardware.
3.Gate-Level Minimization
Digital Electronics Chapter 3 Gate-Level Minimization.
1 Lecture 12 More about Combinational Analysis and Design Procedures.
Introduction to ASIC flow and Verilog HDL
HDL Model Combinational circuits. module halfadder(s, cout, a, b); input a, b; output s, cout; xor g1(s, a, b); and g2(cout, a, b); endmodule.
Karnaugh Maps (K-Maps)
Multiplexers Section Topics Multiplexers – Definition – Examples – Verilog Modeling.
CHAPTER 5 Combinational Logic Analysis
ECE 331 – Digital System Design Basic Logic Operations, Boolean Expressions and Truth Tables, and Standard Logic Gates The slides included herein were.
LECTURE V TEST BENCHES. As your projects become more complex and multiple modules are employed, it will no longer be possible to simulate them as we did.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Lecture 07 Digital logic By Amr Al-Awamry. 4 variables K-Map.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Introduction to Verilog COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Hardware Description Languages: Verilog
FIGURE 3.1 Two-variable K-map
Logic Gates and Boolean Algebra
ECE 2110: Introduction to Digital Systems
ECE 3110: Introduction to Digital Systems
Lecture 7 Logistics Last lecture Today Homework 2 due today
Hardware Description Languages: Verilog
Topics The logic design process..
Hardware Descriptive Languages these notes are taken from Mano’s book
Overview Last lecture Today K-Maps Verilog Structural constructs
Hardware Description Language
Introduction to Verilog
Lecture 1.3 Hardware Description Languages (HDLs)
ECE 331 – Digital System Design
Overview Last lecture Today K-Maps Verilog Structural constructs
Digital Logic Design I Gate-Level Minimization
Hardware Descriptive Languages these notes are taken from Mano’s book
HDL Hardware Description Language
مدار منطقی به نام یگانه مهندس هستی مهدی قدیری
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Presentation transcript:

DON’T CARE CONDITIONS Functions that have unspecified output for some input combinations are called incompletely specified functions. Unspecified minterms of a functions are called ‘don’t care’ conditions. We simply don’t care whether the value of 0 or 1 is assigned to F for a particular minterm. Don’t care conditions are represented by X in the K-Map table. Don’t care conditions play a central role in the specification and optimization of logic circuits as they represent the degrees of freedom of transforming a network into a functionally equivalent one.

DON’T CARE CONDITIONS Example: Simplify the Boolean function

Implementing Logic Circuits with NAND Example: INVERT-OR NAND NAND-OR gates 2-level NAND gates

Multi-Level Gate Implementation

AND-OR-INVERT Gate Implementation

OR-AND-INVERT Gate Implementation

EXCLUSIVE-OR FUNCTION

Verilog Hardware Descriptive Language Verilog is language that describes the hardware of digital systems in textual form. It can be used to represent logic diagrams, Boolean expressions, and other more complex digital circuits. There are two applications of HDL processing: simulation and synthesis. Logic simulation: representation of the structure and behavior of a digital system. A simulator interprets the HDL code and produces an output that predicts the behavior of the hardware before it’s actually fabricated. Logic synthesis: process of deriving a list of components and their interconnections from the system model described in HDL. This process produces a database with instructions on how to fabricate a piece of hardware.

SynaptiCAD C:\SynaptiCad\Examples_Book\Book_Tutorials Or you can go directly to the VeriLogger Tutorial: Basic Verilog Simulation

//HDL Example 3-1 //Description of the simple circuit of Fig. 3-37 module smpl_circuit(A,B,C,x,y); input A,B,C; output x,y; wire e; and g1(e,A,B); not g2(y, C); or g3(x,e,y); endmodule port list

Circuit with delay in HDL //HDL Example 3-2 //--------------------------------- //Description of circuit with delay module circuit_with_delay (A,B,C,x,y); input A,B,C; output x,y; wire e; and #(30) g1(e,A,B); or #(20) g3(x,e,y); not #(10) g2(y,C); endmodule

Stimulus to a design: test bench //HDL Example 3-3 //---------------------- //Stimulus for simple circuit module stimcrct; reg A,B,C; wire x,y; circuit_with_delay cwd(A,B,C,x,y); initial begin A = 1'b0; B = 1'b0; C = 1'b0; #100 A = 1'b1; B = 1'b1; C = 1'b1; #100 $finish; end endmodule

Simulation Output

Boolean Algebra in HDL //HDL Example //------------------------------ //Circuit specified with Boolean equations module circuit_bln (x,y,A,B,C,D); input A,B,C,D; output x,y; assign x = A | (B & C) | (~B & D); assign y = (~B & C) | (B & ~C & ~D); endmodule