| ??? 02/11/07 20:29 Read: times |
#132555 - I don't get it Mike Responding to: ???'s previous message |
Mike Stegmaier said:
Contrary to what you all believe, I am continuing with it. Call me a cuckoo if you want, but at least I have guts.
Anyways, My code (which I have displayed above) has been assembled into the following bytes. 000010,000000,101011,000010,000000,110110,000010,000000,000000,000000,000000, 000000,000000,000000,000000,000000,000000,000000,000000,000010,000000,111011, 000010,000000,000000,000000,000000,000000,000000,000000,000000,000000,000000, 000000,000000,000000,000000,000000,000000,000000,000000,000000,000000,110101, 001000,000101,010000,000000,000000,110101,101000,000101,000000,111110,100101, 010000,110000,100011,110010,010000,000000,000000,110010. Each byte is given an address. The top left is address 0, the next 1, and so on. All sequential. Then I divide the above code, so that I work with one bit at a time. Which means the whole code gets processed 8 times. So basically, I had the computer generate 8 truth tables. According to the use of Quine Mcclusky method and Petricks method, I narrowed the logic down to this: Bit 0 Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 Bit 6 Bit 7 1-0011 0-0000 1-0011 10101- 1010-0 1010-0 10-011 0-1101 100-11 1010-0 10-011 1101-1 01--11 -1-011 1100-0 0111-1 100-11 --1011 0110-0 10-011 10-011 -00111 10101- 1-1011 0-0111 1-0111 01-111 0-0111 Bit 0 is the LSB and Bit 7 is the MSB. Think of each result as a narrowed down truth table. The hyphens in the result mean that the value can be either 0 or 1. Now I need to figure out how to really simplify this. The IC's I have on hand to do this are: 2 Quad 2-input OR gate 2 Quad 2-input NOR gate 2 Quad 2-input NAND gate 2 Quad 2-input AND gate 1 Quad 2-input Exclusive OR gate 2 Dual 4-input NAND gate 1 8-input NAND gate 6 inverters I'm leaning towards using Demorgans theorem, because the store didn't have any high speed AND gates more than 2 input. If I can utilize a 4-input NAND gate, my design will be simpler, but as it stands, I'll probably have to buy more AND gates. If anyone knows any other theorem that can simplify boolean algebra expressions, let me know. Hi Mike: I don't get it? In this post you refer to code above? Their's know source code in this post. You refer to code as 8 bit byte yet I only see 6 bit of code in your 64 byte example. Ok if 7 bits no parity you could show just 7 bits. But I only see 6 bits. Maybe because I am a tech I don't get it. I am no expert with boolean expressions but should't you work the logic out before you get the chips. I be honest with you, I would send you any chip or hardware if had it if you lived in USA. As I hate sending packages out of country. I might but I will have to think about it. Electronics has been my hobby for last 20yrs. And also my job. Best regards, Ralph Sac |
