Disambiguation of Reading Information in Quasi-Cyclic Code Scales

Abstract

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.