Ya, I know bigger and better things were done with Redstone, but they weren't done by me :biggrin.gif: I thought up everything by myself except the subtractor, which I looked up (only Half Subtractor though) after hours of failed attempts.
I'm curious about the binary to decimal converter.
Do you just have it check for every possible combination of 1's and 0's from 1 to 30?
I am also working on a computer, but all i've got so far is 4 bytes (8 bits each)
I don't use levers to control input, each can be set by button presses or clock pulses (adding 1 to the value with each pulse)
no addition or subtraction yet, though i've got an idea of how i'm going to multiply.
the problem is that the output is still binary, but i'd hate to have to build 50 story buildings to test for each number
Ya, it does check every possibility, and for 4 bytes that will make a huge building. As far as I'm aware, that's the only way for Binary to Decimal, although I think that for the other way around there is an easier way (although that has no real use for you...)
no addition or subtraction yet, though i've got an idea of how i'm going to multiply.
the problem is that the output is still binary, but i'd hate to have to build 50 story buildings to test for each number
Hmm... Isn't multiplication derived from adding?
Anyways, I've got a non-wiki idea that.. subtractors are the easiest! All I have to do is connect each corresponding decimal to each other w/a XOR. In binary calculations, that seems to be the essence of subtraction... though it can't get negative values.
Exmp. 1111 - 1011
Compare the 2^0 decimals. 1=1, therefore output 0. Repeat.
This gets 0100, which is correct!
Also, I think simple adders can be made by linking the corresponding decimals (2^0 first) with parallel ANds and XORs.
Anyways, I've got a non-wiki idea that.. subtractors are the easiest! All I have to do is connect each corresponding decimal to each other w/a XOR. In binary calculations, that seems to be the essence of subtraction... though it can't get negative values.
Exmp. 1111 - 1011
Compare the 2^0 decimals. 1=1, therefore output 0. Repeat.
This gets 0100, which is correct!
Also, I think simple adders can be made by linking the corresponding decimals (2^0 first) with parallel ANds and XORs.
Multiplication is derived from addition, but using electronics that would require looped circuits, big adders and memory. There is a simpler way, there's a video somewhere on youtube that explains it perfectly. About addition, what would you do if you have 1000-0101? You need a "borrow", which is the more complicated part. For negative values, you have to recognize which input is bigger, make it the subtractee (or whatever you call the number that is being subtracted from), and add a "-" sign if it was the second cumber inputed.
I'm curious about the binary to decimal converter.
Do you just have it check for every possible combination of 1's and 0's from 1 to 30?
For a small number of bits, a decoder should work fine. I've been using Logic Friday to figure out similar things.
Simply create a truth table where the inputs correspond to the binary numbers, and the outputs correspond to the segments. Tell it to output to inverters (torches), OR gates (wires and repeaters), and NOR gates (torches). Optimize for die area.
Nice display :smile.gif:.
Rollback Post to RevisionRollBack
When all is said and done, Will you have said more than you have done?
I'm curious about the binary to decimal converter.
Do you just have it check for every possible combination of 1's and 0's from 1 to 30?
For a small number of bits, a decoder should work fine. I've been using Logic Friday to figure out similar things.
Simply create a truth table where the inputs correspond to the binary numbers, and the outputs correspond to the segments. Tell it to output to inverters (torches), OR gates (wires and repeaters), and NOR gates (torches). Optimize for die area.
Nice display :smile.gif:.
Since he's going for 4 bytes, I think a decoder will be huge as well :tongue.gif:
Ya, I know bigger and better things were done with Redstone, but they weren't done by me :biggrin.gif: I thought up everything by myself except the subtractor, which I looked up (only Half Subtractor though) after hours of failed attempts.
Do you just have it check for every possible combination of 1's and 0's from 1 to 30?
I am also working on a computer, but all i've got so far is 4 bytes (8 bits each)
I don't use levers to control input, each can be set by button presses or clock pulses (adding 1 to the value with each pulse)
no addition or subtraction yet, though i've got an idea of how i'm going to multiply.
the problem is that the output is still binary, but i'd hate to have to build 50 story buildings to test for each number
Ya, it does check every possibility, and for 4 bytes that will make a huge building. As far as I'm aware, that's the only way for Binary to Decimal, although I think that for the other way around there is an easier way (although that has no real use for you...)
Hmm... Isn't multiplication derived from adding?
Anyways, I've got a non-wiki idea that.. subtractors are the easiest! All I have to do is connect each corresponding decimal to each other w/a XOR. In binary calculations, that seems to be the essence of subtraction... though it can't get negative values.
Exmp. 1111 - 1011
Compare the 2^0 decimals. 1=1, therefore output 0. Repeat.
This gets 0100, which is correct!
Also, I think simple adders can be made by linking the corresponding decimals (2^0 first) with parallel ANds and XORs.
Multiplication is derived from addition, but using electronics that would require looped circuits, big adders and memory. There is a simpler way, there's a video somewhere on youtube that explains it perfectly. About addition, what would you do if you have 1000-0101? You need a "borrow", which is the more complicated part. For negative values, you have to recognize which input is bigger, make it the subtractee (or whatever you call the number that is being subtracted from), and add a "-" sign if it was the second cumber inputed.
-
View User Profile
-
View Posts
-
Send Message
Curse PremiumFor a small number of bits, a decoder should work fine. I've been using Logic Friday to figure out similar things.
Simply create a truth table where the inputs correspond to the binary numbers, and the outputs correspond to the segments. Tell it to output to inverters (torches), OR gates (wires and repeaters), and NOR gates (torches). Optimize for die area.
Nice display :smile.gif:.
Since he's going for 4 bytes, I think a decoder will be huge as well :tongue.gif:
Also, thanks about the display :biggrin.gif: