Equality Detector Lecture L6.1 Section 6.1. Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z 0 0 1 0 1 0 1 0 0 1 1 1.

Slides:

Advertisements

Similar presentations

2’s Complement 4-Bit Saturator

Advertisements

Modulo-N Counters Module M10.4 Section 7.2.

Encoders Module M9.3 Section 6.3. Encoders Priority Encoders TTL Encoders.

Demultiplexers Module M6.4 Section 6.4. Demultiplexers YIN 1 x 4 DeMUX d0d1 Y0 Y1 Y2 Y3 Y0 Y1 Y2 Y3 d1d0 0 0 YIN YIN YIN

Shift Registers Module M11.1 Section 7.3.

7-Segment Displays Lecture L6.1 Section 6.3. Turning on an LED.

Comparators Combinational Design.

Magnitude Comparator Lecture L6.4 Section 6.1.

Binary Counters Module M10.3 Section 7.2. Counters 3-Bit Up Counter 3-Bit Down Counter Up-Down Counter.

Digital to Analog (D/A) Converter Discussion D2.2.

7-Segment Displays Lecture L6.7 Section 6.5. Turning on an LED.

Binary-to-BCD Converter Lecture L6.2 Section 6.5 pp

Using State Machines as Control Circuits Lecture L9.4.

Multiplier Lecture L7.3 Section 10.4 (p.276) Section 7.3 (Handout)

Multiplexers Lecture L6.4 Section 6.4.

Subtractors Module M8.2 Section 6.2. Subtractors Half Subtractor Full Subtractor Adder/Subtractor - 1 Adder/Subtractor - 2.

Designing State Machines Lecture L9.2 Handout Section 9.2.

Arbitrary Waveforms Lecture L8.5 Section 7.2. CLK DQ !Q CLK DQ !Q CLK DQ !Q Q0Q0.D Q1 Q2 Q1.D Q2.D s s s s3 0 1.

Counters as State Machines Lecture L9.1 Handout Section 9.1.

Designing State Machines SQRT controller Lecture L9.2a Section 9.2.

Binary Counters Lecture L8.3 Section 8.2. Counters 3-Bit Up Counter 3-Bit Down Counter Up-Down Counter.

Shifter Lecture L7.4 Group HW #4 Section 10.3.

Modulo-N Counters Lecture L8.4 Section 7.2. Counters Modulo-5 Counter 3-Bit Down Counter with Load and Timeout Modulo-N Down Counter.

Introduction to Computer Engineering by Richard E. Haskell Number Systems Module M3.1 Sections

Codes and Code Converters

Code Converters Module M7.1 Section 6.5. Code Converters Binary-to-BCD Converters ABEL TRUTH_TABLE Command.

Arithmetic Logic Unit (ALU) Lecture L7.5 Section 7.5.

Pulse-Width Modulated DAC Lecture 11.3 Section 11.5.

Multiplexers Module M6.1 Section 6.4. Multiplexers A 4-to-1 MUX TTL Multiplexer A 2-to-1 MUX.

2’s Complement 4-Bit Saturator

Adders Lecture L7.1 Section 6.2 Section 10.4 (pp )

Shifters Lecture L7.4 Section 7.4. MODULE shift TITLE 'shifter' DECLARATIONS " INPUT PINS " D3..D0 PIN 11,7,6,5; D = [D3..D0]; s2..s0 PIN 3,2,1; S.

Flip-Flops Lecture L8.2 Section 8.1. Recall the !S-!R Latch !S !R Q !Q !S !R Q !Q X Y nand 1 0 Set 1 0.

Digital to Analog (D/A) Converter Discussion D2.2.

Decoders Module M9.1 Section 6.3. Decoders TTL Decoders.

Arithmetic Logic Unit (ALU) Lecture L9.3 Lab 10. ALU CB = carry_borrow flag Z = zero flag (Z = 1 if Y = 0)

Shift Registers Lecture L6.6 Section Bit Shift Register.

Section 2.6 Question 1. Section 2.6 Answer 1 Section 2.6 Question 2.

Equality Detector Lecture L6.3 Section 6.1. Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z

7-Segment Displays Module M7.2 Section 6.5. Turning on an LED Common Anode.

Equality Detector Module M5.1 Section 6.1. Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z

Flip-Flops Lecture L8.2 Section 7.1 – Book Sect. 8.1– Handout.

Multiplexers Lecture L6.6v Section 6.2. Multiplexers A Digital Switch A 2-to-1 MUX A 4-to-1 MUX A Quad 2-to-1 MUX The Verilog if…else Statement TTL Multiplexer.

ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.

Address Decoders Lecture L6.10 Section 6.3. MOUSE Layout PROM 2716 RAM 6810 MPU 6802 PIA 6821 Address Bus (16 lines) Data Bus (8 lines) To outside world.

50: $125,000 $64,000 $32,000 $16,000 $8,000 $4,000 $2,000 $1,000 $500 $300 $200 $100 Escribe a pregunta D. B. C. A.

Lecture 13 Problems (Mano)

EXAMPLE 1 Solve absolute value inequalities

Digital Design Lecture 10 Sequential Design. State Reduction Equivalent Circuits –Identical input sequence –Identical output sequence Equivalent States.

Lab 6 Module M8.3. EXPERIMENT 6: Adder/Subtractor PRE-LAB 1.Read and understand text Sec. 6.2, Adders and Subtractors, pages Using textbook.

Abdullah Said Alkalbani University of Buraimi

2’s Complement 4-Bit Saturator Discussion D2.8 Lab 2.

4.6 Model Direct Variation

Boolsk algebra. Logiske funktioner i Peel PEEL 18CV8 logic diagram.

Comparators Combinational Design. Comparators Equality and Magnitude Comparators –CSE 171 (Designed using CUPL) TTL Comparators Comparator Networks Cascading.

Digital Logic & Design Dr. Waseem Ikram Lecture No. 35.

Magnitude Comparator Module M5.2 Section 6.1.

Lecture 3: Linear Regression (with One Variable)

. - t !!l t. - 1f1f J - /\/\ - ' I __.

Counters as State Machines

Logic Design Review – 2 Basic Combinational Circuits

Shift Registers Lecture L8.6 Section 8.3.

.. '.. ' 'i.., \. J'.....,....., ,., ,,.. '"'". ' · · f.. -··-·· '.,.. \...,., '.··.. ! f.f.

Number Systems and Circuits for Addition

Exponential and Logarithmic Forms

Magnitude Comparator Lecture L6.2 Section 6.1.

Find the value of g. Find the value of h. 105° h g 75°

BETONLINEBETONLINE A·+A·+

COE 202 Introduction to Verilog

Advanced Encryption Standard (AES)

Presentation transcript:

Equality Detector Lecture L6.1 Section 6.1

Equality Detector XNOR X Y Z Z = !(X $ Y) X Y Z

4-Bit Equality Comparator A = [A3..A0]; B = [B3..B0]; C = [C3..C0];

Sets A = [A3..A0]; B = [B3..B0]; C = [C3..C0]; A represents [A3, A2, A1, A0] B represents [B3, B2, B1, B0] C represents [C3, C2, C1, C0]

MODULE eqcomp1 TITLE '4-BIT EQUALITY DETECTOR, R. Haskell, 9/21/02‘ DECLARATIONS " INPUT PINS " A3..A0 PIN 6, 7, 11, 5; A = [A3..A0]; B3..B0 PIN 72, 71, 66, 70; B = [B3..B0]; " OUTPUT PINS " A_EQ_B PIN 36; C3..C0 NODE; C = [C3..C0]; ABEL Program

EQUATIONS C = !(A $ B); A_EQ_B = C0 & C1 & C2 & C3; test_vectors ([A, B] -> [A_EQ_B]) [0, 0] -> [1]; [2, 5] -> [0]; [10, 12] -> [0]; [7, 8] -> [0]; [4, 2] -> [0]; [6, 6] -> [1]; [15, 15] -> [1]; END ABEL Program (cont.)

C = !(A $ B) C0 = !(A0 $ B0) C1 = !(A1 $ B1) C2 = !(A2 $ B2) C3 = !(A3 $ B3) EQUATIONS C = !(A $ B); A_EQ_B = C0 & C1 & C2 & C3;

Question Expand the following ABEL equation for F: A = [A2..A0]; B = [B2..B0]; F = [F2..F0]; F = !A & B;