Difference between revisions of "RCwiproc"
Jump to navigation
Jump to search
(New Article on CRC) |
(link for book on protocol design) |
||
| Line 25: | Line 25: | ||
*[http://www.linxtechnologies.com/documents/AN-00160.pdf Linx article on protocol design] | *[http://www.linxtechnologies.com/documents/AN-00160.pdf Linx article on protocol design] | ||
*[http://www.mathpages.com/home/kmath458.htm Paper on the Cylical Redundancy Check error checking algorithm (CRC)] | *[http://www.mathpages.com/home/kmath458.htm Paper on the Cylical Redundancy Check error checking algorithm (CRC)] | ||
| + | *[http://spinroot.com/spin/Doc/Book91.html Enitre book on protocol design, a bit dated though like 1990 dated] | ||
==Links== | ==Links== | ||
[[RCcoms|Wireless Hompage]] | [[RCcoms|Wireless Hompage]] | ||
Revision as of 12:11, 21 June 2006
Wireless Protocol
The host will be able to send each robot velocity, direction, and shoot directives, at with the time alloted between each sample of the playing field by the overhead camera. In such way the enitre system (host, camera, and robot) will behave as a real-time system. The robot will send its current error status, battery voltage, wheel velocity, unique ID, and whether or not it has the ball to the host but not in real-time.
Data Rate calculations
100 fps
At least two frames needed to track motion theta
Time per command 20ms
Each robot needs 3 bytes (will change)
6 robots = 18 Bytes
10 bits per Byte (Start bit , 8 data bits, 1 stop bit)
(18 Bytes/20ms)*(10 bits/1 Byte) = 9kbps
Double bit rate for Manchester encoding 18kbps
=19.2Bps baud rate
Articles
- Linx article on protocol design
- Paper on the Cylical Redundancy Check error checking algorithm (CRC)
- Enitre book on protocol design, a bit dated though like 1990 dated
