There is 1 Byte of data but only 127 letters? (2^0 + 2^1 + ... + 2^7 = 255), this happens because the last bit that could display 2^7 is used to display even/odd parity of the following 7 bits. Example: [0] 0 1 0 1 1 0 1 (4 x 1 -> even) and [1] 1 0 1 0 1 0 0 (3 x 1 -> odd) for odd parity. Same with the even one: [1] 0 1 1 1 0 1 0
This is the old way of checking if the message the computer receives is correct or wrong. Nowadays we use CRC :)
Not bad. Need a video on the binary side of things along with bit wise operators such as OR, XOR, AND, etc... and how they compare to the binary representation.
Thanks. Great Video
MrMobinga 1 month ago
A little wiseass shit:
There is 1 Byte of data but only 127 letters? (2^0 + 2^1 + ... + 2^7 = 255), this happens because the last bit that could display 2^7 is used to display even/odd parity of the following 7 bits. Example: [0] 0 1 0 1 1 0 1 (4 x 1 -> even) and [1] 1 0 1 0 1 0 0 (3 x 1 -> odd) for odd parity. Same with the even one: [1] 0 1 1 1 0 1 0
This is the old way of checking if the message the computer receives is correct or wrong. Nowadays we use CRC :)
1aMattes 3 months ago
Yeah thanks for your tutorials but it would be nice to have new intro music . . .
arthurmee 4 months ago
By the way, the intro is pretty lame by now, you should make a new one.
Grkgermn333 4 months ago 6
Finally a new video! Awesome!
Grkgermn333 4 months ago 8
Not bad. Need a video on the binary side of things along with bit wise operators such as OR, XOR, AND, etc... and how they compare to the binary representation.
abystus 4 months ago
where is part 1
webmastertool 4 months ago
@webmastertool /watch?v=UmSelKbP4sc
was uploaded december 09 :P
Voodude666B 4 months ago