Difference between revisions of "Spike Prime - Self-correcting Codes"
From RoboWiki
m (→Measure, analyze, think) |
m (→Build) |
||
Line 13: | Line 13: | ||
Pictures: | Pictures: | ||
− | [[Image: | + | [[Image:self_correct2.jpg|robot that can write and read message and correct an error automatically|600px]] |
− | [[Image: | + | |
− | [[Image:self_correct3.jpg|robot that can write and read message and correct an error automatically| | + | [[Image:self_correct1.jpg|robot that can write and read message and correct an error automatically|720px]] |
− | [[Image:self_correct4.jpg|robot that can write and read message and correct an error automatically| | + | |
+ | [[Image:self_correct3.jpg|robot that can write and read message and correct an error automatically|480px]] | ||
+ | [[Image:self_correct4.jpg|robot that can write and read message and correct an error automatically|400px]] | ||
Building instructions: | Building instructions: | ||
Line 39: | Line 41: | ||
* calibration light sensor - D | * calibration light sensor - D | ||
* reading light sensor - C | * reading light sensor - C | ||
− | |||
== Programs == | == Programs == |
Revision as of 12:13, 16 July 2022
Let's begin
Self correcting codes...
Build
Model:
Pictures:
Building instructions:
Download building instructions:
Download stud.io model:
...description...
Connections:
- left motor - E
- right motor - F
- large motor - B
- calibration light sensor - D
- reading light sensor - C
Programs
Calibration and testiing:
Writing self-correcting code:
Reading self-correcting code:
Download:
...description...
Measure, analyze, think
- Make your own recording
- Perform experiments with your model and discuss in your group what has happened.
Explore and modify
- Think about how a message can be written so that even after flipping any little bit of it, the message could still be safely read without any disturbance.
- Three methods for students to discover:
- write every bit 3 times (message length = 3 x L)
- write every bit two times and add one extra bit - parity of ones in the message (message length = 2 x L + 1)
- write current parity after every single bit (message length = 2 x L)
- invent your own method, try to use as little bits as possible
Present
- How would you encode the message using tokens of only one color?
- How could a distance traveled between tokens placed be also used for encoding the message?
- How would the situation change, if one bit could be flipped in every 10 bits that we send instead of in the whole message?
- Prepare a short presentation for other groups. Tell others about your experiments with finding circle centers.
Additional resources
- Download: Circle - all media files