1 / 8

Chapter 3

Chapter 3. Digital circuits. 3.1 Logic signals - Gates. Binary system : (binary bits or digits) - 0 & 1 - LOW & HIGH - N egated and A sserted. 3.1 Logic signals - Gates. Different devices used to represent binary bits 0 1 Pneumatic Logic low presure high

kaida
Download Presentation

Chapter 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 3 Digital circuits

  2. 3.1 Logic signals - Gates • Binary system : (binary bits or digits) - 0 & 1 - LOW & HIGH - Negated and Asserted.

  3. 3.1 Logic signals - Gates Different devices used to represent binary bits 0 1 Pneumatic Logic low presure high Relay Logic open closed Fiber Optics light on off Read Only CD no pit pit (See table 3.1 of book)

  4. X X Y Z F1 F2 1 0 0 0 0 1 2 0 0 1 1 1 3 0 1 0 0 1 4 0 1 1 0 1 5 1 0 0 0 1 6 1 0 1 0 1 7 1 1 0 1 0 8 1 1 1 1 0 F1 Logic Circuit Y F2 Z 3.2 How do we represent logic Black box view of logic circuit 3 inputs and 2 outputs N bits  2n different values Example N=3 : 23 = 8 Truth table Truth tables : it gives all combinaisons of input and corresponding Output values

  5. 3.3 Basic building blocks AND, OR, NOT

  6. 3.3 Basic building blocks …NAND, NOR NAND gate : combination of NOT and AND NOR gate : combination of NOT and OR Note that NAND produces the opposite results of AND NOR produces the opposite results of OR

  7. 3.4 Example: a logical circuit 1 2 F X Y Z X’ Y’ X.Y X’.Y’.Z 1 + 2 0 0 0 1 1 0 0 0 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0 1 1 1 1 0 0 1 0 1 1 2 F X Y Z X’ Y’ X.Y X’.Y’.Z 1 + 2 0 0 0 1 1 0 0 0 0 0 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0 1 1 1 1 0 0 1 0 1

  8. 3.4 Example : …. Truth table Logic diagrams

More Related