Disambiguation of Reading Information in Quasi-Cyclic Code Scales


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

A method is proposed to solve the problem of eliminating the ambiguity of reading information from a quasi-cyclic code scale. The solution is derived with the usage of a smaller number of reading elements by comparison with the application of the “dual brush” classical method. It is shown that the benefit in the number of required reading elements increases with the increase in the number of bits of the code scale. An example of a scale implementing this method is presented. The proposed quasi-cyclic scales are required in the development of digital angle converters and are used as an alternative to classical code scales, the mask of which is implemented in regular binary code.

作者简介

A. Ozhiganov

St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO)

编辑信件的主要联系方式.
Email: ojiganov@mail.ifmo.ru
俄罗斯联邦, St. Petersburg

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2019