Determination of optimal period of absolute encoders with single track cyclic gray code
Fan Zhang , Heng-jun Zhu
Journal of Central South University ›› 2010, Vol. 15 ›› Issue (Suppl 2) : 362 -366.
Determination of optimal period of absolute encoders with single track cyclic gray code
Low cost and miniaturized rotary encoders are important in automatic and precise production. Presented here is a code called Single Track Cyclic Gray Code (STCGC) that is an image etched on a single circular track of a rotary encoder disk read by a group of even spread reading heads to provide a unique codeword for every angular position and features such that every two adjacent words differ in exactly one component, thus avoiding coarse error. The existing construction or combination methods are helpful but not sufficient in determining the period of the STCGC of large word length and the theoretical approach needs further development to extend the word length. Three principles, such as the seed combination, short code removal and ergodicity examination were put forward that suffice determination of the optimal period for such absolute rotary encoders using STCGC with even spread heads. The optimal periods of STCGC in 3 through 29 bit length were determined and listed.
rotary encoder / absolute encoder / single track / grey code / cyclic / reliability
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
ZHU Heng-jun, QIU Cheng. An encoding method for absolute positioning: CIV, ZL 2004 1 0009539.X[P]. 2004. (in Chinese). |
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
KIM D, MOONWOOK R, SUKHAN L. Antipodal Gray codes for structured light [C]// IEEE International Conference on Robotics and Automation. 2008: 3016–3021. |
| [12] |
|
| [13] |
TUOHY D R, POTTER W D, CASELLA D A. Searching for snake-in-the-box codes with evolved pruning models [C]// Proceedings of the 2007 Int Conf on Genetic and Evolutionary Methods (GEM’2007). Las Vegas, Nevada, 2007: 3–9. |
| [14] |
CASELLA D A, POTTER W D. Using evolutionary techniques to hunt for snakes and coils [C]// 2005 IEEE Congress on Evolutionary Computation (CEC2005). 2005: 2499–2504. |
| [15] |
BITTERMAN D S. New lower bounds for the snake-in-the-box problem: A prolog genetic algorithm and heuristic search approach [D]. University of Georgia, 2004. |
| [16] |
|
| [17] |
WENG Chi-shun. Method for establishing a gray code and related counter circuit: US 6836525[P]. 2004-12-28. |
| [18] |
|
| [19] |
ROWE J E, HIDOVIC D. An evolution strategy using a continuous version of the Gray-code neighbour-hood distribution [M]. Genetic and Evolutionary Computation, 2004: 725–736. |
| [20] |
|
/
| 〈 |
|
〉 |