combinational circuits
play

Combinational Circuits Jason Filippou CMSC250 @ UMCP 06-02-2016 - PowerPoint PPT Presentation

Mar 13, 2024 •176 likes •447 views

Combinational Circuits Jason Filippou CMSC250 @ UMCP 06-02-2016 Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 1 / 1 Outline Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 2 / 1 Hardware design levels Hardware design levels

  1. Combinational Circuits Jason Filippou CMSC250 @ UMCP 06-02-2016 Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 1 / 1

  2. Outline Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 2 / 1

  3. Hardware design levels Hardware design levels Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 3 / 1

  4. Hardware design levels Levels of abstraction for ICs S mall S cale I ntegration: ≈ 10 boolean gates M edium S cale I ntegration: > 10 , ≤ 100 L arge S cale I ntegration: Anywhere between 100 and 30 , 000. V ery L arge S cale I ntegration: Up to 150 , 000. V ery V ery L arge S cale I ntegration: > 150 , 000. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 4 / 1

  5. Hardware design levels Example schematic Figure 1: VLSI schematic for a professional USB interface for Macintosh PCs. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 5 / 1

  6. Hardware design levels SSI Consists of circuits that contain about 10 gates. 16-bit adders. Encoders / Decoders. MUX/DEMUX. ... All our examples will be at an SSI level. Logic Design is the branch of Computer Science that essentially analyzes the kinds of circuits and optimizations done at an SSI/MSI level. We do not have such a course in the curriculum, but you can expect to be exposed to it if you ever take 411. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 6 / 1

  7. Combinational Circuit Design Combinational Circuit Design Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 7 / 1

  8. Combinational Circuit Design Combinational vs Sequential circuits A combinational circuit is one where the output of a gate is never used as an input into it. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 8 / 1

  9. Combinational Circuit Design Combinational vs Sequential circuits A combinational circuit is one where the output of a gate is never used as an input into it. A sequential circuit is one where this constraint can be violated. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 8 / 1

  10. Combinational Circuit Design Combinational vs Sequential circuits A combinational circuit is one where the output of a gate is never used as an input into it. A sequential circuit is one where this constraint can be violated. Example: Flip-flops (yes, seriously). In this course, we will only touch upon combinational circuits. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 8 / 1

  11. Combinational Circuit Design Boolean Gates Boolean Gates Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 9 / 1

  12. Combinational Circuit Design Boolean Gates Analogy between logic and hardware Every binary or unary boolean operator ( ∧ , ∨ , ∼ ) is mapped to a gate. This includes the binary connectives ( ⇒ , ⇔ ) (why?) So, every propositional logic construct (“compound” or otherwise) can be mapped to a logically equivalent boolean circuit! Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 10 / 1

  13. Combinational Circuit Design Boolean Gates AND gate Figure 2: The ANSI symbol of an AND gate. Truth table corresponds to ∧ binary operator. (board) Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 11 / 1

  14. Combinational Circuit Design Boolean Gates OR gate Figure 3: The ANSI symbol of an OR gate. Truth table corresponds to ∨ binary operator. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 12 / 1

  15. Combinational Circuit Design Boolean Gates NOT gate (inverter) Figure 4: The ANSI symbol of a NOT gate. Truth table corresponds to ∼ unary operator. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 13 / 1

  16. Combinational Circuit Design Boolean Gates XOR gate Figure 5: ANSI symbol for a XOR gate. Truth table? (whiteboard) Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 14 / 1

  17. Combinational Circuit Design Boolean Gates XOR gate Can I implement a XOR gate using gates I know? Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 15 / 1

  18. Combinational Circuit Design Boolean Gates XOR gate Can I implement a XOR gate using gates I know? Homework � Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 15 / 1

  19. Combinational Circuit Design Boolean Gates NAND/NOR gates Figure 6: ANSI symbol for a NAND Figure 7: ANSI symbol for a NOR gate gate What’s the truth table for both of those? Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 16 / 1

  20. Combinational Circuit Design Boolean Gates NAND/NOR gates Figure 6: ANSI symbol for a NAND Figure 7: ANSI symbol for a NOR gate gate What’s the truth table for both of those? Sheffer stroke : ↑ (used for NAND operation) Quince arrow : ↓ (used for NOR operation) Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 16 / 1

  21. Combinational Circuit Design Boolean Gates NAND/NOR gates Figure 6: ANSI symbol for a NAND Figure 7: ANSI symbol for a NOR gate gate What’s the truth table for both of those? Sheffer stroke : ↑ (used for NAND operation) Quince arrow : ↓ (used for NOR operation) NAND gates are the cheapest gates to implement in modern hardware. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 16 / 1

  22. Combinational Circuit Design Complex circuits Complex circuits Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 17 / 1

  23. Combinational Circuit Design Complex circuits Examples Convert the following boolean expressions to their corresponding circuits: ( p ∧ q ∧ z ) ∨ ( ∼ r ) ( p ∨ q ) ∧ q Now, convert them into circuits that only use NAND gates! Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 18 / 1

  24. Combinational Circuit Design Complex circuits Simplifying circuits We can often use the axioms of boolean logic to simplify a circuit into one that uses a smaller number of gates. Then, we can convert that circuit into one that only uses NAND gates! Pipeline ( Important to remember! ): 1 Identify boolean expression implemented by the circuit (tip: scan the circuit from output to inputs). 2 Use axioms of boolean algebra to simplify expression in terms of boolean connectives used. 3 Use axioms of boolean algebra to translate the expression into one that only uses (possibly negated) conjunctions ( ∼ ( p ∧ ∼ q ∧ z ∧ ... ) . 4 Draw the corresponding circuit. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 19 / 1

  25. Combinational Circuit Design Complex circuits Examples Whiteboard... Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 20 / 1

  26. Combinational Circuit Design Complex circuits K-maps A much more efficient way to quickly simplify circuits is the Karnaugh map , or K-map for short. 1 Automatically converts any boolean expression to either a sum-of-product form (ORs of ANDs) or product-of-sums form (ANDs of ORs). We will not analyze them in this course, but you’re directed to the Wikipedia article for information. 1 Named such after Maurice Karnaugh. Jason Filippou (CMSC250 @ UMCP) Circuits 06-02-2016 21 / 1

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Sequential Circuits Combinational circuits : current input output Sequential circuit :

Sequential Circuits Combinational circuits : current input output Sequential circuit :

14:332:231 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 2013 Lecture #15: Sequential Circuits: Latches Sequential Circuits Combinational circuits : current input output Sequential

483 views • 15 slides
1. Basic combinational building blocks 2. Logic for arithmetic Common combinational circuits:

1. Basic combinational building blocks 2. Logic for arithmetic Common combinational circuits:

1. Basic combinational building blocks 2. Logic for arithmetic Common combinational circuits: encoders, decoders, multiplexers, adders, Arithmetic Logic Unit (printed together, separate sets of slides online) But first Recall: sum of

276 views • 13 slides
Lecture 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 1 Combinational

Lecture 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 1 Combinational

Lecture 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 1 Combinational logic -- Behavior can be specified as concurrent signal assignments -- These model concurrent operation of hardware elements entity Gates is port

639 views • 59 slides
IC220 Combinational Logic Slide Set #A2: Combinational and Multiplexors (mux)

IC220 Combinational Logic Slide Set #A2: Combinational and Multiplexors (mux)

Bigger Units of Combinational Logic Gates useful but fairly low level Easier to constructs circuits with higher-level building blocks instead: IC220 Combinational Logic Slide Set #A2: Combinational and Multiplexors (mux)

300 views • 6 slides
VHDL 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 Combinational logic

VHDL 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 Combinational logic

VHDL 2 Combinational Logic Circuits Reference: Roth/John Text: Chapter 2 Combinational logic -- Behavior can be specified as concurrent signal assignments -- These model concurrent operation of hardware elements entity Gates is port (a,

542 views • 20 slides
Sequential Circuits (2) Prof. Usagi Recap: Combinational v.s. sequential logic Combinational

Sequential Circuits (2) Prof. Usagi Recap: Combinational v.s. sequential logic Combinational

Sequential Circuits (2) Prof. Usagi Recap: Combinational v.s. sequential logic Combinational logic The output is a pure function of its current inputs The output doesnt change regardless how many times the logic is triggered

630 views • 51 slides
Combinational Logic M. Sachdev, Dept. of Electrical & Computer Engineering University of

Combinational Logic M. Sachdev, Dept. of Electrical & Computer Engineering University of

ECE 223 Digital Circuits and Systems Combinational Logic M. Sachdev, Dept. of Electrical & Computer Engineering University of Waterloo 1 Combinational Circuits consists of logic gates with outputs that are determined entirely by the

388 views • 18 slides
last week.... this week.... lecture 5 Sequential circuits 1 clock C combinational output

last week.... this week.... lecture 5 Sequential circuits 1 clock C combinational output

last week.... this week.... lecture 5 Sequential circuits 1 clock C combinational output input sequential - RS latch circuits input circuits output - D latch - flipflops (D) combinatorial circuits + memory - truth tables

69 views • 3 slides
lecture 4 Combinational logic 2 - ROM - arithmetic circuits - arithmetic logic unit (ALU)

lecture 4 Combinational logic 2 - ROM - arithmetic circuits - arithmetic logic unit (ALU)

lecture 4 Combinational logic 2 - ROM - arithmetic circuits - arithmetic logic unit (ALU) January 20, 2016 Last lecture: truth tables, logic gates & circuits Recall multiplexor (selector) if S Y = B else Y = A We will

356 views • 31 slides
CDA 4253/CIS 6930 FPGA System Design Modeling of Combinational Circuits Hao Zheng Dept of Comp

CDA 4253/CIS 6930 FPGA System Design Modeling of Combinational Circuits Hao Zheng Dept of Comp

CDA 4253/CIS 6930 FPGA System Design Modeling of Combinational Circuits Hao Zheng Dept of Comp Sci & Eng USF Reading P. Chu, FPGA Prototyping by VHDL Examples Chapter 3, RT-level combinational circuit Sections 3.1 - 3.2, 3.5 -

1.39k views • 99 slides
Hardware Design with VHDL Combinational Circuit Design ECE 443 Combinational Circuit Design This

Hardware Design with VHDL Combinational Circuit Design ECE 443 Combinational Circuit Design This

Hardware Design with VHDL Combinational Circuit Design ECE 443 Combinational Circuit Design This slide set covers Derivation of efficient HDL description Operator sharing Functionality sharing Layout-related circuits

672 views • 50 slides
Lecture 14: Sequential Circuits, FSM Todays topics: Sequential circuits Finite

Lecture 14: Sequential Circuits, FSM Todays topics: Sequential circuits Finite

Lecture 14: Sequential Circuits, FSM Todays topics: Sequential circuits Finite state machines 1 Sequential Circuits Until now, circuits were combinational when inputs change, the outputs change after a while (time = logic

435 views • 19 slides
Digital Circuits and Systems Combinational Design Decoders + Encoders Shankar Balachandran*

Digital Circuits and Systems Combinational Design Decoders + Encoders Shankar Balachandran*

Spring 2015 Week 3 Module 13 Digital Circuits and Systems Combinational Design Decoders + Encoders Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technology Madras *Currently a Visiting Professor at IIT Bombay

427 views • 13 slides
Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits

Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits

Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. April 26, 2020 Book Homepage: http://www.eng.tau.ac.il/~guy/Even-Medina 1

1.14k views • 60 slides
Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits

Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits

Digital Logic Design: a rigorous approach c Chapter 11: Foundations of combinational circuits Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. April 26, 2020 Book Homepage: http://www.eng.tau.ac.il/~guy/Even-Medina 1

883 views • 56 slides
CS356 Unit 12 Processor Hardware Organization Pipelining 12.2 From combinational to sequential

CS356 Unit 12 Processor Hardware Organization Pipelining 12.2 From combinational to sequential

12.1 CS356 Unit 12 Processor Hardware Organization Pipelining 12.2 From combinational to sequential logic BASIC HW 12.3 Logic Circuits Combinational Combinational Logic Logic Outputs Inputs Performs a specific function (Usually

709 views • 57 slides
Strategic Planning and Allocation of Resources Committee (SPARC) Thursday, August 27, 2020 2:10

Strategic Planning and Allocation of Resources Committee (SPARC) Thursday, August 27, 2020 2:10

Strategic Planning and Allocation of Resources Committee (SPARC) Thursday, August 27, 2020 2:10 p.m. Ag Agen enda Approve August 27, 2020 agenda Approve May 14, 2020 minutes Introduction and SPARC Charge Report on Final 20-21

538 views • 33 slides
Discrete Mathematics & Mathematical Reasoning Chapter 11: Trees Kousha Etessami U. of

Discrete Mathematics & Mathematical Reasoning Chapter 11: Trees Kousha Etessami U. of

Discrete Mathematics & Mathematical Reasoning Chapter 11: Trees Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 11) 1 / 13 A tree is a connected simple undirected graph with no

576 views • 16 slides
Late-stage C-H Arylation of Thiazolo[5,4- f ]quinazolin-9(8 H )-one Backbone: Synthesis of an

Late-stage C-H Arylation of Thiazolo[5,4- f ]quinazolin-9(8 H )-one Backbone: Synthesis of an

Late-stage C-H Arylation of Thiazolo[5,4- f ]quinazolin-9(8 H )-one Backbone: Synthesis of an Array of Potential Kinase Inhibitors Florence Couly 1 , Carole Dubouilh 1 , Laurent Meijer 2 , Corinne Fruit 1,* and Thierry Besson 1,* 1 Normandie Univ,

552 views • 17 slides
Forgiveness 101 Condoning poor behavior v F or getting what happened v Minimizing the injur

Forgiveness 101 Condoning poor behavior v F or getting what happened v Minimizing the injur

Heartland Mediators Association April 26-27, 2018 Forgiveness 101 Condoning poor behavior v F or getting what happened v Minimizing the injur y v v Dependent on r eligious belief or pr ac tic e v R ec onc iling 1 v Cr eating

433 views • 20 slides
Advertising block Open Lab Day MI/MMI: Monday, Dec. 1st, 6pm Amalienstr. 17 Open Lab

Advertising block Open Lab Day MI/MMI: Monday, Dec. 1st, 6pm Amalienstr. 17 Open Lab

Advertising block Open Lab Day MI/MMI: Monday, Dec. 1st, 6pm Amalienstr. 17 Open Lab Day LRZ: Tuesday, Dec. 16th, 6pm LRZ Garching Opening video: https://www.youtube.com/watch?v=oDAw7vW7H0c 10.09.2013

607 views • 38 slides
USING MACHINE LEARNING TO AUTOMATE CONTENT METADATA Gareth Seneque seneque@gmail.com

USING MACHINE LEARNING TO AUTOMATE CONTENT METADATA Gareth Seneque seneque@gmail.com

USING MACHINE LEARNING TO AUTOMATE CONTENT METADATA Gareth Seneque seneque@gmail.com @garethseneque https://search.abc.net.au THE PLAN! 1. What is the ABC/Search at the ABC 2. An overview of metadata the what/why 3. A platform: what

625 views • 27 slides
A statistical model to transform election poll proportions into representatives: The Spanish case

A statistical model to transform election poll proportions into representatives: The Spanish case

A statistical model to transform election poll proportions into representatives: The Spanish case Jose M. Pavia Elections and Public Opinion Research Group Universitat de Valencia 13-15 September 2013, Lancaster University Introduction Opinion

304 views • 26 slides
Update for the Policy Group Meeting EM rootstock club Felicidad Fernndez Fernndez East

Update for the Policy Group Meeting EM rootstock club Felicidad Fernndez Fernndez East

Update for the Policy Group Meeting EM rootstock club Felicidad Fernndez Fernndez East Malling Rootstock Club - update Update on pest and disease screening Update on Marker Assisted Selection test Discuss set up for next pear

650 views • 16 slides

More recommend