Switching & Logic Laboratory

Slides:



Advertisements
Similar presentations
Hybrid Infrared and Visible Light Projection for Location Tracking
Advertisements

Abdullah Said Alkalbani University of Buraimi
Date of Birth Design Problem
Looking Inside the Black Box
Mounting Installations SITRANS P for Differential Pressure
CSE 370 Sample Final Exam Questions. 1) Logic Minimization CD AB F = Σm(0,6,7,8,9,11,15) + d(1,13)
- 1 - Using an SMT Solver and Craig Interpolation to Detect and Remove Redundant Linear Constraints in Representations of Non-Convex Polyhedra Christoph.
Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
Processador 8 bits de dados e 16 bits de endereço ROM RAM I/O master slave constant mem : mem_type := ( -- load increment LDCi, 1, -- store it at 0x4000.
Principles & Applications
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Copyright © 2001 Nominum, Inc. IPv6 DNS Ashley Kitto Nominum, Inc.
Fast Algorithms for Finding Nearest Common Ancestors Dov Harel and Robert Endre Tarjan Fast Algorithms for Finding Nearest Common Ancestors SIAM J. COMPUT.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
15 October 2013Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
A Simple ALU Binary Logic.
ZMQS ZMQS
Algorithms for Geometric Covering and Piercing Problems Robert Fraser PhD defence Nov. 23, 2012.
Lab 8 : Multiplexer and Demultiplexer Systems:
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chien Lee VLDB 07 Approaching the Skyline in Z Order 1.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Report Card P Only 4 files are exported in SAMS, but there are at least 7 tables could be exported in WebSAMS. Report Card P contains 4 functions: Extract,
CS 105 Tour of the Black Holes of Computing
Lab 11 : Memory System Fundamentals :
Monika Gope Lecturer IICT, KUET
Minimum Weight Plastic Design For Steel-Frame Structures EN 131 Project By James Mahoney.
CS1104 – Computer Organization
ABC Technology Project
1 Interconnect and Packaging Lecture 3: Skin Effect Chung-Kuan Cheng UC San Diego.
Truth Tables & Logic Expressions
Vanderbilt Business Objects Users Group 1 Reporting Techniques & Formatting Beginning & Advanced.
Truth Tables and Boolean Algebra Benchmark Companies Inc PO Box Aurora CO
Digital Systems Introduction Binary Quantities and Variables
Logic Gates Flip-Flops Registers Adders
Pivot Tables Overview 1. What are Pivot Tables Pivot tables in Excel are a versatile reporting tool that makes it easy to extract information from large.
Computer Graphics 4: Viewing In 2D
Benchmark Series Microsoft Excel 2013 Level 2
Degree Distribution of XORed Fountain codes
Constant, Linear and Non-Linear Constant, Linear and Non-Linear
Chapter 4 The Von Neumann Model
Chapter 4 The Von Neumann Model
Toulouse Blagnac campaign test results By DSNA
Chapter 5 Microsoft Excel 2007 Window
Squares and Square Root WALK. Solve each problem REVIEW:
CS1022 Computer Programming & Principles
Splines IV – B-spline Curves
Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)
Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)
Addition 1’s to 20.
Random-Access Memory (RAM)
Princess Sumaya University
25 seconds left…...
Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.
Week 1.
We will resume in: 25 Minutes.
ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps
PSSA Preparation.
and M-ary Quadrature Amplitude Modulation (M-QAM)
1/15/2015 Slide # 1 Binary, Octal and Hex Numbers Copyright Thaddeus Konar Introduction to Binary, Octal and Hexadecimal Numbers Thaddeus Konar.
Distributed Computing 9. Sorting - a lower bound on bit complexity Shmuel Zaks ©
Chapter 6 Intermediate Code Generation
Internet Engineering Czesław Smutnicki Discrete Mathematics – Combinatorics.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Verilog Part 1 – Chapter.
Shannon Expansion Given Boolean expression F = w 2 ’ + w 1 ’w 3 ’ + w 1 w 3 Shannon Expansion of F on a variable, say w 2, is to write F as two parts:
Presentation transcript:

Switching & Logic Laboratory Truth Tables & PLACE Switching & Logic Laboratory

Overview Interface Truth Tables JED file

Pre Laboratory 1 Get out K-maps and equation Show K-maps and equations to laboratory assistant. If process not complete, leave laboratory at end of slides and complete at table in hall for 10 point penalty Else continue with task 1.

PEEL Interface System + 5 V D0 D1 D2 D3 DP SegG SegF SegE SegD SegC 7-Segment Display On Daughter Board + 5 V D0 D1 D2 D3 DP SegG SegF SegE SegD SegC SegB SegA V0 V1 V2 V3 Vector 1.0 PEEL On Daughter Board Clock “0” “1” myPEEL

Option 1 0 = on and 1 = off Input Output 0000 11111100 0001 01100000 0010 11011010 . . . 1111 00000000 1 = on and 0 = off

Option 2 0 = on and 1 = off Input Output 0000 00000011 0001 10011111 0010 00100101 . . . 1111 11111111 0 = on and 1 = off

Enter Truth Table Data TRUTH_TABLE FUNCTIONS ( I1 I0 -> O3 O2 O1 O0) 0 0 -> 0 1 1 0 0 1 -> 1 1 0 1 1 0 -> 0 0 0 1 1 1 -> 1 1 1 0 END;

Seven Segment Display Codes B C F E 0000 0001 0010 0011 0100 0101 0110 0111 1000 10010 1010 1011 1100 1101 1110 1111

Demonstrate WinPLACE and Truth Tables here.

Sequence Select 18CV8 device Title, Name, Date, and Description Label pins Allocate truth table header Enter table data Compiler truth table Simulate, check results, append vectors Program PEEL and verify design by exercising

Task 2 RED file contains reduced eaquation version of PSF file Equations SEGA.COM = !D0 & !D2 # D0 & !D1 & D3 # !D1 & !D2 & D3 # D1 & !D3 # D0 & D2 & !D3;

PEEL Column & Row Layout Column 0 to Column 35 Row 0 to Row7 Column 12, Row 4 PEELs used column and row notation for each fuse. Note fuse at each intersection.

Linear Array Layout of JED File 0 35 L0035 L0000 1 2 3 4 5 6 7 L0036 = 1*36+0 L0071 = 1*36+35 L0287 = 7*36+35 = 287

Col-Row to/from Linear Array Column & Row to Linear Array L = Row*36 + Column L = 17*36 + 21 = L0633 Linear Array to Coumn & Row Row = L/36 Column = L%36 Row = 633/36 = 17.5833 = 17 Colum = 633%36 = 0.5833*36 = 21

Pin 17 Linear Address Range 000000000011111111112222222222333333 012345678901234567890123456789012345 19 18 17 16 5 4 1 3 2 20 21 22 23 CLK D0 D1 D2 D3 SEGF 16*36+0 = L0576 23*36+35 = L0863

File format - Task 3 Comment Pins Fuses Default Note Location & Logic

File format - Task 3 1 = Blown 0 = Not Blown Pn Pn’ Result 1 1 1 N Output Pin 19* p1 p11 p2 p19 p3 p18 p4 p17 p5 p16 p6 p15 p7 p14 p8 p13 p9p12 Pn Pn’ Result 1 1 1 1 0 Pn’ 0 1 Pn 0 0 0 = PnPn’ 1 = Blown 0 = Not Blown p19 = !p2•p3•p4•p5 or DP = !D0•D1•D2•D3

Big Picture -- Task 4 Task 1 Task 4 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 1 1 0 0 SEGF = !D0 & !D1 & D2 & D3 # D0 & D1 & !D2 & D3 # !D0 & D1 & !D2 & D3 # D0 & !D1 & !D2 & D3 # !D0 & !D1 & !D2 & D3 # !D0 & D1 & D2 & !D3 # D0 & !D1 & D2 & !D3 # !D0 & !D1 & D2 & !D3 # !D0 & !D1 & !D2 & !D3; SEGG = D0 & !D1 & D2 & D3 # D0 & D1 & !D2 & D3 # !D0 & D1 & !D2 & D3 # D0 & !D1 & D2 & !D3 # !D0 & !D1 & D2 & !D3 # D0 & D1 & !D2 & !D3 # !D0 & D1 & !D2 & !D3; DP = !D0 & D1 & D2 & D3; SEGA= !D0 & !D1 & D2 & D3 # !D0 & D1 & !D2 & D3 # D0 & !D1 & !D2 & D3 # !D0 & !D1 & !D2 & D3 # D0 & D1 & D2 & !D3 # !D0 & D1 & D2 & !D3 # D0 & !D1 & D2 & !D3 # D0 & D1 & !D2 & !D3 # !D0 & D1 & !D2 & !D3 # !D0 & !D1 & !D2 & !D3; Task 4

Big Picture Continued .PSF Task 1 .RED .JED .PSF Task 4 BP-1400 TRUTH_TABLE SEVSEG D3 D2 D1 D0 SEGA SEGB SEGC SEGD SEGE SEGF DP 0 0 0 0 0 0 0 0 0 0 0 0 • • • • • SEGA = !D0&D1&D2&D3# • • • • • L0000 111010…11* .PSF Task 4 SEGA = !D0*D1*D2*D3+ • • • • • BP-1400