The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.

Slides:

Advertisements

Similar presentations

ADDER, HALF ADDER & FULL ADDER

Advertisements

Full Adder Display. Topics A 1 bit adder with LED display Ripple Adder Signed/Unsigned Subtraction Hardware Implementation of 4-bit adder.

1 Counter with Parallel Load Up-counter that can be loaded with external value –Designed using 2x1 mux – ld input selects incremented value or external.

Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.

1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.

Parallel Adder Recap To add two n-bit numbers together, n full-adders should be cascaded. Each full-adder represents a column in the long addition. The.

1 Chapter 13 Artificial Life: Learning through Emergent Behavior.

CSE-221 Digital Logic Design (DLD)

Information Processing Session 5B Binary Arithmetic Slide

Section 10.3 Logic Gates.

The Analytical Engine Hardware. The Logic Machine Computers were originally wired to perform a specific task. The vision was a machine that could perform.

Indian Institute of Technology Hyderabad BOOLEAN ALGEBRA SOLVER Made by- Ajay Brahmakshatriya ( CS12B1004 ) Richik Jaiswal ( CS12B1032 )

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

In a not gate, if the input is on(1) the output is off (0) and vice versa.

Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.

 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.

Bits and Data Storage. Basic Hardware Units of a Computer.

Variations of Conway’s Game of Life Eswar Kondapavuluri.

XOR, XNOR, and Binary Adders

Binary Addition CSC 103 September 17, 2007.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.

CS 101 – Sept. 16 Finish color representation –RGB √ –CMY –HSB –Indexed color Chapter 4 – how computers think –Begin with basic building blocks.

MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.

CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.

Computer Architecture I: Digital Design Dr. Robert D. Kent Logic Design Medium Scale Integration and Programmable Logic Devices Part I.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

Digital Logic Computer Organization 1 © McQuain Logic Design Goal:to become literate in most common concepts and terminology of digital.

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

The Game of Life A simulation of "life". From simple rules, complex behavior arises Rules –A cell that is alive and has fewer than two live neighbors dies.

LANGUAGE AND TOOLS GURU S UHAN CANARAN PROJECT MANAGER A NDREAS NILSSON SYSTEM ARCHITECT A KSHAT SIKARWAR SYSTEM INTEGRATOR E RIC SCHMIDT TESTER AND VALIDATOR.

Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.

Playing God: The Engineering of Functional Designs in the Game of Life Liban Mohamed Computer Systems Research Lab

Rich French 3/2/13 Advisor: Kristina Striegnitz.  A cell is “born” if it is surrounded by 2 neighbors  A cell “survives” if it is surrounded by 2 or.

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.

1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.

Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.

A Variation on Conway’s Game of Life Winston Lee EPS 109.

1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:

1 GCSE Computing Binary Logic. GCSE Computing 2 Candidates should be able to understand and produce simple logic diagrams using the operations NOT, AND,

Ben Aksoy Ray Navarette Daniel Tashjian Geoffrey Wong 1.

CO5023 Introduction to Digital Circuits. What do we know so far? How to represent numbers (integers and floating point) in binary How to convert between.

Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.

AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.

ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.

How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B

US Demonstrate knowledge of the practical applications of logic circuits.

Computer Hardware & Operation Northern College Diploma Philip Bird.

Combinational Circuits

Digital Electronics Multiplexer

Multiplier Design [Adapted from Rabaey’s Digital Integrated Circuits, Second Edition, ©2003 J. Rabaey, A. Chandrakasan, B. Nikolic]

Computer Fundamentals

Digital Electronics Multiplexer

Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.

XOR, XNOR, and Binary Adders

Reading: Hambley Chapters

How Boolean logic is implemented

XOR, XNOR, & Binary Adders

29-Nov-18 Counters Chapter 5 (Sections ).

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN

Number Systems and Circuits for Addition

XOR, XNOR, and Binary Adders

Combinational Circuits

Digital Logic Department of CNET Chapter-6

Digital Logic Department of CNET Chapter-6

XOR Function Logic Symbol  Description  Truth Table 

XOR, XNOR, and Binary Adders

CS334: Logisim program lab6

Digital Electronics and Logic Design

Presentation transcript:

The Northern Lights: Demonstrations

Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the scope of what can be displayed is limited only by the creativity of the users. We have prepared demonstrations of two potential programs.

Conway’s Game of Life Conway’s game of life is a simple cellular automaton, which can be easily visualized in a system like the Lights. Each cell in a grid is either alive or dead (on or off, in our case). If a cell has two or less live neighbors, it is always dead, if it has three, it is unchanged, and if four or more neighbors are alive, it is becomes alive. When the grid is seeded with a few live cells, complex patterns emerge by following these rules.

Video: Life (if video does not play, load the file life.avi)

Interactivity The game of Life is an example of a program that can be run either automatically or interactively: people walking on the grid can cause cells to live or die, or the system itself can randomly seed live cells.

The Ripple-Carry Adder Another use of the Lights is visualization of data or processes. In this case, we have created a demonstration of a basic logic circuit: a ripple carry adder. This program is a practical learning tool, and serves to bring the usually invisible processes that information technology is built upon to the human scale.

Ripple-Carry Adder: Technical Details Cells on the far right of the grid are user-controlled inputs, cells on the left are outputs. Numbers are represented in binary, with the least-significant bits at the bottom of the frame. The adder takes two 3-bit numbers (on the top and bottom), and determines their 4-bit sum. Red colors indicate wires carrying zeros, and blue colors ones. Yellow cells are XOR gates, and magenta cells are AND gates. In the video, the adder is first set to show 0+0=0, then inputs are adjusted to show 0+2=2 (or =0010), then 2+2=4 ( =0100), then 2+6=8 ( =1000).

(if video does not play, load the file adder.avi) Video: Ripple Carry Adder Input B Input A 2 1