2.4 Gray Code ReturnNext In a Gray code only one bit changes between each pair of successive code words. Gray code is a reflected code. It can be defined.

Slides:



Advertisements
Similar presentations
Joshua Eckroth The Plan 1.Review some functions. 2.Write more functions. 3.Consider the nature of recursion. 4.Look at the.
Advertisements

5.5 Encoders A encoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
5.4 Decoders A decoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
Limitations are  The number of inputs (n)  The number of outputs (m)  The number of product terms (p) 5.3 Combinational PLDs ReturnNext Programmable.
ReturnNext A circuit that compares two binary words and indicates whether they are equal is called a comparator. Some comparators interpret their input.
ReturnNext  Latch : a sequential device that watches all of its inputs continuously and changes its outputs at any time, independent of a clocking signal.
Recursion Lecture 18: Nov 18.
Parity Generator and Checker
ECE 331 – Digital System Design
8.4 Counters NextReturn Any clocked sequential circuit whose state diagram contains a single cycle is called a counter. The number of states in the cycle.
2.2 General Positional-Number-System Conversion
ReturnNext Random access memory (RAM) is the best known form of computer memory. RAM is considered "random access" because you can access any memory cell.
9.4 Monostable Multivibrator Introduction ReturnNext Characteristic Two work state: stable state 、 metastable state if triggered by external pulse.
2.3 Binary Codes for Decimal Numbers ReturnNext Code: A set of n-bit strings in which different bit strings represent different numbers or other things.
ICN’s The n-D hypercube (n-cube) contains 2^n nodes (processors).
ReturnNext  Half adder, adds two 1-bit operands x and y, producing a 2-bit sum. The low- order bit of the sum may be named HS (half sum), and the high-order.
5. Choose a flip-flop type for the state memory. ReturnNext 7.4 Clocked Synchronous State-Machine Design 1. Construct a state/output table corresponding.
Astable multivibrator is a kind of self-oscillation circuit. When power is applied It can generate rectangle pulse which has a certain frequency and amplitude.
2.1 Positional Number Systems ReturnNext Why do we discuss the number systems?  Digital systems only have two states. So digital circuits process binary.
 We can use an algebraic description of the circuit ’ s functional behavior in the analysis of a larger system that includes the circuit.  We can determine.
Finite Arithmetics of Integers FORTRAN codes: INTEGER*2INTEGER HTML HTML version.
5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y
Example: Given a 4-bit input combination N=N 3 N 2 N 1 N 0, this function produces a 1 output for N=1,2,3,5,7,11,13, and 0 otherwise.  According to the.
A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.
3.1 Logic Signals and Gates Logic Signals ReturnNext  Logic Value: Many physical quantities can be represented two possible numbers or logic values —
Recursion Lecture 17: Nov 11. Quiz int hello(int n) { if (n==0) return 0; else printf(“Hello World %d\n”,n); hello(n-1); } 1.What would the program do.
A hazard is said to exist when a circuit has the possibility of producing such a glitch. 4.4 Timing Hazards ReturnNext Because of circuit delays, the transient.
3. Flip-flops ReturnNext 8.1 Sequential-Circuit Documentation Standards As a whole, basic documentation standards include signal naming, logic symbols,
5.6 Three-State Devices ReturnNext Three-State Buffers The most basic three-state device is a three- state buffer, often called a three-state driver. Various.
Systems of Linear Equations Vocabulary. This is a System of Linear Equations.
RECURSIVE PATTERNS WRITE A START VALUE… THEN WRITE THE PATTERN USING THE WORDS NOW AND NEXT: NEXT = NOW _________.
Existing Range Encoding Schemes Presenter: Kai-Yang, Liu Date: 2011/11/23.
ASCII & Gray Codes.
Decoders.
ECE 3110: Introduction to Digital Systems Review #1 (Chapter 1,2)
Binary Codes. Binary Code A binary code is just an assignment of information to bit patterns.
UNIVERSAL COLLEGE OF ENGINEERING AND TECHNOLOGY PREPARED BY:- Chirag Parmar ( ) Kashish Soni ( ) Maitrey Bhatt( )
ECE 3110: Introduction to Digital Systems BCD, Gray, Character, Action/Event, Serial Data.
ECE 301 – Digital Electronics Unsigned and Signed Numbers, Binary Arithmetic of Signed Numbers, and Binary Codes (Lecture #2)
Summer 2012ETE Digital Electronics1 Binary Arithmetic of Signed Binary Numbers.
ECE 2110: Introduction to Digital Systems BCD, Gray, Character, Action/Event, Serial Data.
MA/CSSE 473 Day 14 Permutations wrap-up Subset generation (Horner’s method)
ECE 3110: Introduction to Digital Systems unsigned Multiplication/Division codes.
Mathematical Induction I Lecture 4: Sep 16. This Lecture Last time we have discussed different proof techniques. This time we will focus on probably the.
ECE 331 – Digital System Design Representation and Binary Arithmetic of Negative Numbers and Binary Codes (Lecture #10) The slides included herein were.
ECE 301 – Digital Electronics Representation of Negative Numbers, Binary Arithmetic of Negative Numbers, and Binary Codes (Lecture #11) The slides included.
Digital Design Basics Analog vs Digital Why we need digital? Reproducibility, economy, programmability… Digital Devices Gates, FFs Combinational, sequential.
Computer Science 101 More Devices: Arithmetic. From 1-Bit Equality to N-Bit Equality = A B A = B Two bit strings.
CSE20 Lecture 2: Number Systems: Binary Numbers and Gray Code CK Cheng 1.
Performance of Coherent M-ary Signaling ENSC 428 – Spring 2007.
Channel Capacity. Techniques to reduce errors in digital communication systems Automatic repeat request (ARC) Forward error correction (FEC) Channel.
9-2 Reflections Objective: To find reflection images of figures.
Recursion and Induction Themes –Recursion –Recurrence Definitions –Recursive Relations –Induction (prove properties of recursive programs and objects defined.
ECE 2110: Introduction to Digital Systems
Fundamental Digital Electronics (Fall 2014) Martino Poggio.
MA/CSSE 473 Day 19 Subset Generation. MA/CSSE 473 Day 19 HW 7 due today Exam 1 Thursday There will be significant time for your questions in tomorrow's.
Solving an Absolute-Value Inequality Recall that  x  is the distance between x and 0. If  x  8, then any number between  8 and 8 is a solution of.
CSE20 Lecture 2: Number Systems: Binary Numbers, Gray Code, and Negative Numbers CK Cheng 1.
ECE 2110: Introduction to Digital Systems
Functions Part I Recap.
Objective – To use tables to represent functions.
3B Reflections 9-2 in textbook
Find the Inverse and Graph the Functions
Binary Code  
محاسبات عددی و برنامه نویسی
Find the Inverse and Graph the Functions
Notes Over 11.5 Recursive Rules
Differentiation: Basic differentiation
Properties or Rules of Transformations
Write out the first five terms of the sequence:
Presentation transcript:

2.4 Gray Code ReturnNext In a Gray code only one bit changes between each pair of successive code words. Gray code is a reflected code. It can be defined recursively using the following rules: 1. A 1-bit Gray code has two code words, 0 and The first 2 n code words of an (n+1)-bit Gray code equal the code words of an n-bit gray code,written in order with a leading 0 appended.

3. The last 2 n code words of an (n+1)- bit Gray code equal the code words of an n-bit gray code, but written in reverse order with a leading 1 appended Example: For a 2-bit Gray code, n=1. 1-bit Gray code bit Gray code NextBackReturn 2.4 Gray Code

Example: For a 3-bit Gray code, n= bit Gray code BackReturn 3-bit Gray code Gray Code