The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 1 Day Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016

Show transcribed image text 1. Consider the following LED light display for digits. a1, ..., a7 are the lighting edge for each edge. The digits 0~9 are represented as the following. Assume that we use 4 input bits as binary representation of 0~9. For example, 0000 for 0, 0001 for 1, ..., and 1001 for 9. We denote ?4, i3, i2, il for the bit 3, bit 2, bit 1, and bit 0, respectively. Generate truth tables for a1...a7 lighting edges given in put bits of i4, ?3, ?2, i1. Based on your truth table, generate the sum of product expression for a1...a7. Implement a PLA for the LED light display.
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll