Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. TANG Tian-jin, CAO Xiang-qun, LIN Bin. Developing current situation and the trend of photoelectric-angular encoder [J]. Optical Instruments, 2005, 27(1): 90–96. (in Chinese).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

  5. HILTGEN A P, PATERSON K G, BRANDESTINI M. Single-track Gray codes [J]. IEEE Transactions on Information Theory, 1996, 42(5): 1555–1561.

    Article  MATH  Google Scholar 

  6. ETZION T, PATERSON K G. Near optimal single-track Gray codes [J]. IEEE Transactions on Information Theory, 1996, 42(3): 779–789.

    Article  MATH  MathSciNet  Google Scholar 

  7. SCHWARTZ M, ETZION T. The structure of single-track Gray codes [J]. IEEE Transactions on Information Theory, 1999, 45(7): 2383–2396.

    Article  MATH  MathSciNet  Google Scholar 

  8. ZINOVIK I, KROENING D, CHEBIRYAK Y. Computing binary combinatorial Gray codes via exhaustive search with SAT solvers [J]. IEEE Transactions on Information Theory, 2008, 54(4): 1819–1823.

    Article  MathSciNet  Google Scholar 

  9. QIU Cheng, WANG Yang, ZHU Heng-jun, Absolute encoder based on Karnaugh map [J]. Chinese Journal of Scientific Instrument, 2007, 28(6): 1080–1086. (in Chinese).

    Google Scholar 

  10. KILLIAN C E, SAVAGE C D. Antipodal Gray codes [J]. Discrete Mathematics, 2004, 281(1/3): 221–236.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  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. AGRELL E, LASSING J, STROM E G, OTTOSSON T. On the optimality of the binary reflected Gray code [J]. IEEE Transactions on Information Theory, 2004, 50(12): 3170–3182.

    Article  MathSciNet  Google Scholar 

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

  18. ZHENG Yun-hui, BRADY D J, SULLIVAN M E, GUENTHER B D. Fiber-optic localization by geometric space coding with a two-dimensional Gray code [J]. Applied Optics, 2005, 44(20): 4306–4314.

    Article  Google Scholar 

  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. YU You-wen, CHANG Jian. A modern coding way of absolute encoder [J]. Chinese Journal of Scientific Instrument, 2004, 25(4): 541–544. (in Chinese).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing, 100044, China

    Fan Zhang  (张 帆) & Heng-jun Zhu  (朱衡君)

Authors
  1. Fan Zhang  (张 帆)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heng-jun Zhu  (朱衡君)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heng-jun Zhu  (朱衡君).

Additional information

Foundation item: Project(JX2004J0170) supported by the Foundation of Beijing Jiaotong University, China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, F., Zhu, Hj. Determination of optimal period of absolute encoders with single track cyclic gray code. J. Cent. South Univ. Technol. 15 (Suppl 2), 362–366 (2008). https://doi.org/10.1007/s11771-008-0488-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-008-0488-7

Key words

Search

Navigation