This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lab 2 Report: Binary to 7segment LED Decoder Student Information: Jonathan Sooter jbsooter@gmail.com Partner: Corey Davis Lab Purpose: The purpose of this lab was to create a module that takes 4 binary inputs and outputting their hexadecimal representation on a 7segment LED display. It was also designed to help familiarize us with the 7segment LED display and reenforce what we've learned about boolean algebra. Implementation Details: The prelab assignment was to create a truth table and corresponding Boolean equations implementing the desired functionality of the binary to 7segment LED Decoder so the first thing I did was generate this truth table: O I 3 I 2 I 1 I A B C D E F G 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 3 1 1 1 1 1 1 1 4 1 1 1 1 1 5 1 1 1 1 1 1 1 6 1 1 1 1 1 1 1 1 7 1 1 1 1 1 1 8 1 1 1 1 1 1 1 1 9 1 1 1 1 1 1 1 1 A 1 1 1 1 1 1 1 1 b 1 1 1 1 1 1 1 1 C 1 1 1 1 1 1 d 1 1 1 1 1 1 1 1 E 1 1 1 1 1 1 1 1 F 1 1 1 1 1 1 1 1 After the truth table was completed I wrote the equation for each segment A through G as the sumofminterms. This resulted in 6 very long equations that follow: A = I3'I2'I1'I0' + I3'I2'I1I0' + I3'I2'I1I0 + I3'I2I1'I0 + I3'I2I1I0' + I3'I2I1I0 + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0' + I3I2I1'I0' + I3I2I1I0' + I3I2I1I0 B = I3'I2'I1'I0' + I3'I2'I1'I0 + I3'I2'I1I0' + I3'I2'I1I0 + I3'I2I1'I0' + I3'I2I1I0 + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0' + I3I2I1'I0' C = I3'I2'I1'I0' + I3'I2'I1'I0 + I3'I2'I1I0 + I3'I2I1'I0' + I3'I2I1'I0 + I3'I2I1I0' + I3'I2I1I0 + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0' + I3I2'I1I0 + I3I2I1'I0 D = I3'I2'I1'I0' + I3'I2'I1I0' + I3'I2'I1I0 + I3'I2I1'I0 + I3'I2I1I0' + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0 + I3I2I1'I0' + I3I2I1'I0 + I3I2I1I0' E = I3'I2'I1'I0' + I3'I2'I1I0' + I3'I2I1I0' + I3I2'I1'I0' + I3I2'I1I0' + I3I2'I1I0 + I3I2I1'I0' + I3I2I1'I0 + I3I2I1I0' + I3I2I1I0 F = I3'I2'I1'I0' + I3'I2I1'I0' + I3'I2I1'I0 + I3'I2I1I0' + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0' + I3I2'I1I0 + I3I2I1'I0' + I3I2I1I0' + I3I2I1I0 G = I3'I2'I1I0' + I3'I2'I1I0 + I3'I2I1'I0' + I3'I2I1'I0 + I3'I2I1I0' + I3I2'I1'I0' + I3I2'I1'I0 + I3I2'I1I0' + I3I2'I1I0 + I3I2I1'I0 + I3I2I1I0' + I3I2I1I0 These 7 equations would give the desired functionality that the lab is looking for but I don't like having those giant equations so I started to simplify the equations using the properties of Boolean algebra. I ended up with these, equivalent and much shorter, 7 equations: A = I3'(I2I0 + I1) + I3(I2'I1' + I0') + I2I1 + I2'I0' B = I0'(I3'I1' + I2') + I0(I3 ^ I1) + I3'I2' C = (I3 ^ I2) + I1'I0 + I3'(I0 + I1') D = I0'(I3I2 + I3'I1 + I2'I1') + I0(I2 ^ I1) + I3I1' E = I3(I2 + I1) + I0'(I1 + I2')...
View Full
Document
 Spring '08
 Strickland

Click to edit the document details