AppendixD

# AppendixD - Table 1 describes the algorithms used to...

This preview shows pages 1–2. Sign up to view the full content.

Table 1 describes the algorithms used to produce the non-user-defined patterns and a figure where example output can be found. D1 Table 1. Pattern Algorithms and Example Figures Pattern Output Sequence Example Figure Up Counter (in binary) Next_value = Previous_value + 1 10 Down Counter (in binary) Next_value = Previous_value – 1 10 Pseudo-Random Number Generator (Linear Feedback Shift Register) BIT = ((SEED 0x0001) ((SEED 0x0004) >> 2) ((SEED 0x0008) >> 3) ((SEED 0x0020) >> 5)) SEED = (SEED >> 1) (Bit1 << 15) *SEED and BIT are 16-bit values 11 Binary Coded Decimal Up Counter An incrementing sequence where every 4 bits represent 1 digit of a BCD number. 12 Gray Code Out = Data (Data >> 1) Data = Data + 1 13 Strobe Pattern Alternates between SEED and NOT(SEED) 14 Fibonacci Series Next_Out = Current_Out + Previous_Out. 15 Upwards (Left) Bit-Shifter Bits rotate left by one bit. 16 Downwards (Right) Bit-Shifter Bits rotate right by one bit 16 Up Counter Output:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/19/2010 for the course ECE 2040 taught by Professor Yili during the Spring '08 term at Georgia Tech.

### Page1 / 3

AppendixD - Table 1 describes the algorithms used to...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online