Presentation is loading. Please wait.

Presentation is loading. Please wait.

Digitale techniek Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology.

Published byFranciscus ten Hart Modified over 5 years ago

Similar presentations

Presentation on theme: "Digitale techniek Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology."— Presentation transcript:

1 Digitale techniek Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

2 Logische niveaus logica: Hoog => ‘1’ => true
Laag => ‘0’ => false A Inverter NOT A Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

3 Booleaanse algebra Functies:
OR-functie: f(a,b) is true als a=1 en/of b=1; notatie f = a + b AND-functie: f(a,b) is true als a=1 en b=1; notatie f = a.b NOT-functie: f(a) is true als a = 0 en false als a = 1; notatie f = a Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

4 rekenregels OR AND NOT a + b = f a . b = f a = f a b f 0 0 0 0 1 1
a b f a f 0 1 1 0 waarheidstabel Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

5 Elementaire poortschakelingen
Naam notatie waarheidstabel symbolen Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

6 Samengestelde poortschakelingen
Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

7 Eigenschappen en theorema’s
commutatieve eigenschappen a + b = b + a a . b = b . a absorptietheorema's a + a . b = a a . (a + b) = a theorema’s van De Morgan (a + b) = a . b (a . b) = a + b associatieve eigenschappen a + (b + c) = (a + b) + c a . (b . c) = (a . b) . c distributieve eigenschappen a + b . c = (a + b) . (a + c) a . (b + c) = a . b + a . c Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

8 Poorten combineren (a . b) + c = f combinatorische schakelingen H
Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

9 Don’t care-condities Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

10 Tijdvolgorde diagrammen
Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

11 Probleem bij combinatorische logica
propagation delay glitches Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

12 Geheugenelementen a b c d 0 0 0 1 0 0 1 0 0 1 1 0 1 0 0 1 1 1 0 0 set
set re-set race condition flipflop met NOR gates SR-flipflop Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

13 SR-flip flop met NAND-gates
Q S R Q Q re-set set Q R Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

14 Flipflop met stuursignaal (Latch)
E is Enable S R E Q D Q E S R Q set reset Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

15 Master-slave SR-FF S Q R negative edge triggered FF
CK negative edge triggered FF probleem blijft S R => 1 1 Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

16 JK-FF J Q K Bij J K => 1 1 toggle CK
Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

17 Synchroon werken met de klok (clock)
edge triggered Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

18 Tijddiagram; negative edge triggered
Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

19 D-FlipFlop Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

20 Monostabiele multivibrator
gevaarlijke schakeling! R C Q T T Q t t is afhankelijk van R en C Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

21 bestudeer paragraaf 4.1 t/m 4.10 opgaven 1 t/m 5 van paragraaf 4.15
Doen bestudeer paragraaf 4.1 t/m 4.10 opgaven 1 t/m 5 van paragraaf 4.15 practicum Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology

Download ppt "Digitale techniek Hogeschool van Utrecht / Institute for Computer, Communication and Media Technology."

Similar presentations

Q R Flip Flops ATS 電子部製作 S Q For a NOR gate, the output would be logic 1 only when both the inputs are 0 : AB 0 0 0 1 10 F 1 0 0 011 A B F.

Q R Flip Flops ATS 電子部製作 S Q For a NOR gate, the output would be logic 1 only when both the inputs are 0 : AB F A B F.
Module 5 – Sequential Logic Design with VHDL

Module 5 – Sequential Logic Design with VHDL
Sequential Digital Circuits Dr. Costas Kyriacou and Dr. Konstantinos Tatas.

Sequential Digital Circuits Dr. Costas Kyriacou and Dr. Konstantinos Tatas.
1 Lecture 14 Memory storage elements  Latches  Flip-flops State Diagrams.

1 Lecture 14 Memory storage elements  Latches  Flip-flops State Diagrams.
Edge Triggered Flip Flops (extended slides). Level-Sensitive Flip-Flop Level-sensitive flip-flop (also called a latch) Q changes whenever clock is high.

Edge Triggered Flip Flops (extended slides). Level-Sensitive Flip-Flop Level-sensitive flip-flop (also called a latch) Q changes whenever clock is high.
Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.

Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR1 Sequential Circuit Latch & Flip-flop.

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR1 Sequential Circuit Latch & Flip-flop.
Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.

Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.
Sequential circuits The digital circuits considered thus far have been combinational, where the outputs are entirely dependent on the current inputs. Although.

Sequential circuits The digital circuits considered thus far have been combinational, where the outputs are entirely dependent on the current inputs. Although.
Lecture 6 CES 522 Latches and Flip-Flops Jack Ou, Ph.D.

Lecture 6 CES 522 Latches and Flip-Flops Jack Ou, Ph.D.
ECE 3130 – Digital Electronics and Design Lab 5 Latches and Flip-Flops Fall 2012 Allan Guan.

ECE 3130 – Digital Electronics and Design Lab 5 Latches and Flip-Flops Fall 2012 Allan Guan.
A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.

A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.

Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.
Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.

Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.
Flip Flops. Clock Signal Sequential logic circuits have memory Output is a function of input and present state Sequential circuits are synchronized by.

Flip Flops. Clock Signal Sequential logic circuits have memory Output is a function of input and present state Sequential circuits are synchronized by.
Lecture #23 Page 1 ECE 4110– Sequential Logic Design Lecture #23 Agenda 1.Latches and Flip-Flops Review Announcements 1.HW #11assigned.

Lecture #23 Page 1 ECE 4110– Sequential Logic Design Lecture #23 Agenda 1.Latches and Flip-Flops Review Announcements 1.HW #11assigned.
Latch Flip flop.

Latch Flip flop.
1 Sequential Circuit Latch & Flip-flop. 2 Contents Introduction Memory Element Latch  SR latch  D latch Flip-flop  SR flip-flop  D flip-flop  JK.

1 Sequential Circuit Latch & Flip-flop. 2 Contents Introduction Memory Element Latch  SR latch  D latch Flip-flop  SR flip-flop  D flip-flop  JK.
Flip_Flops  Logic circuits are classified ito two groups  1. The combinational logic circuits,using the basic gates AND,OR and NOT.  2. Sequential.

Flip_Flops  Logic circuits are classified ito two groups  1. The combinational logic circuits,using the basic gates AND,OR and NOT.  2. Sequential.
Flip-Flops and Registers

Flip-Flops and Registers

Similar presentations

Ads by Google