Determination of optimal period of absolute encoders with single track cyclic gray code

Abstract

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.

Keywords

rotary encoder / absolute encoder / single track / grey code / cyclic / reliability

References

[1] TangT.-j., CaoX.-q., LinB.. Developing current situation and the trend of photoelectric-angular encoder [J]. Optical Instruments, 2005, 27(1): 90-96

[2] YuY.-wen.. Single channel absolute photoelectric shaft encoder [J]. Journal of Nanjing Normal University, 2003, 3(1): 34-37

[3] QiuC., ZhuH.-jun.. Absolute optical encoder with the code detectors placed consecutively in the peripheral direction [J]. Science Technology and Engineering, 2006, 6(19): 3053-3056

[4] ZHU Heng-jun, QIU Cheng. An encoding method for absolute positioning: CIV, ZL 2004 1 0009539.X[P]. 2004. (in Chinese).

[5] HiltgenA. P., PatersonK. G., BrandestiniM.. Single-track Gray codes [J]. IEEE Transactions on Information Theory, 1996, 42(5): 1555-1561

[6] EtzionT., PatersonK. G.. Near optimal single-track Gray codes [J]. IEEE Transactions on Information Theory, 1996, 42(3): 779-789

[7] SchwartzM., EtzionT.. The structure of single-track Gray codes [J]. IEEE Transactions on Information Theory, 1999, 45(7): 2383-2396

[8] ZinovikI., KroeningD., ChebiryakY.. Computing binary combinatorial Gray codes via exhaustive search with SAT solvers [J]. IEEE Transactions on Information Theory, 2008, 54(4): 1819-1823

[9] QiuC., WangY., ZhuH.-j.. Absolute encoder based on Karnaugh map [J]. Chinese Journal of Scientific Instrument, 2007, 28(6): 1080-1086

[10] KillianC. E., SavageC. D.. Antipodal Gray codes [J]. Discrete Mathematics, 2004, 281(1/3): 221-236

[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] VajnovszkiV., WalshT.. A loop-free two-close Gray-code algorithm for listing k-ary Dyck words [J]. Journal of Discrete Algorithms, 2006, 4(4): 633-648

[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] AgrellE., LassingJ., StromE. G., OttossonT.. On the optimality of the binary reflected Gray code [J]. IEEE Transactions on Information Theory, 2004, 50(12): 3170-3182

[17] WENG Chi-shun. Method for establishing a gray code and related counter circuit: US 6836525[P]. 2004-12-28.

[18] ZhengY.-h., BradyD. J., SullivanM. E., GuentherB. D.. Fiber-optic localization by geometric space coding with a two-dimensional Gray code [J]. Applied Optics, 2005, 44(20): 4306-4314

[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] YuY.-w., ChangJ.. A modern coding way of absolute encoder [J]. Chinese Journal of Scientific Instrument, 2004, 25(4): 541-544