for double the number you could look into using 4 bits per digit of a base 10 number, so a 3 digit number would have 3 groups of 4 bits. (you could link these bits to a book/lectern if you really wanted to) you can convert the 4 bit binary equivelants to pure binary, right shift them, then do the same again of converting the binary back into 4bit-binary-equivelant. (I've done this before inorder to take a binary number and display it on a screen)
If you have (technically) 256 possible numbers, this would make 256 * 3 groups * 4 bits, no? That doesn't seem very efficient for this, right? Or am I misunderstanding your implementation?
@@DutchTristan if you have 256 possible numbers you start with 3 lectern numbered 0-9, Convert the number of each lectern to 4 bits Then you can convert the 12 bit binary decimal to 8 bits of pure binary. You then right shift. And reverse the process (back to 3*4bits) then you can take those 3*4 bits and put them into a 7segment display if you really want to
So comparitor strength > Binary Coded Decimal > binary > right shift > binary coded decimal?> 7 segment display? Here is a good video of bcd to binary. There is also a video on the same channel of binary to bcd ruclips.net/video/P2tZUfoDkno/видео.htmlsi=ryUTXH2zdJ6rpJ-G
@Ellamental21 ohh, I see! Not sure how to transfer the 12 bit BCD to standard Binary, but that does seem like a useful idea for displaying purposes :) I'll look into it!
The idea for this series is genius! Really great video, I thank you guys!
Thank you so much :) I'm excited to keep this going!!
for double the number you could look into using 4 bits per digit of a base 10 number, so a 3 digit number would have 3 groups of 4 bits. (you could link these bits to a book/lectern if you really wanted to)
you can convert the 4 bit binary equivelants to pure binary, right shift them, then do the same again of converting the binary back into 4bit-binary-equivelant.
(I've done this before inorder to take a binary number and display it on a screen)
If you have (technically) 256 possible numbers, this would make 256 * 3 groups * 4 bits, no? That doesn't seem very efficient for this, right? Or am I misunderstanding your implementation?
@@DutchTristan if you have 256 possible numbers you start with 3 lectern numbered 0-9,
Convert the number of each lectern to 4 bits
Then you can convert the 12 bit binary decimal to 8 bits of pure binary.
You then right shift.
And reverse the process (back to 3*4bits) then you can take those 3*4 bits and put them into a 7segment display if you really want to
So comparitor strength > Binary Coded Decimal > binary > right shift > binary coded decimal?> 7 segment display?
Here is a good video of bcd to binary. There is also a video on the same channel of binary to bcd
ruclips.net/video/P2tZUfoDkno/видео.htmlsi=ryUTXH2zdJ6rpJ-G
@Ellamental21 ohh, I see! Not sure how to transfer the 12 bit BCD to standard Binary, but that does seem like a useful idea for displaying purposes :)
I'll look into it!
you basically do it 1 digit at a time, add the first digit, multiply by 10, add the next digit, repeat until finished
compulsory "first" comment
Congratulations on being first 😂😂
maths :(