SU388290A1 - B - Google Patents



Publication number
SU388290A1 SU1665165A SU1665165A SU388290A1 SU 388290 A1 SU388290 A1 SU 388290A1 SU 1665165 A SU1665165 A SU 1665165A SU 1665165 A SU1665165 A SU 1665165A SU 388290 A1 SU388290 A1 SU 388290A1
USSR - Soviet Union
Prior art keywords
Prior art date
Application number
Other languages
Russian (ru)
Г. Стрелков В.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed filed Critical
Priority to SU1665165A priority Critical patent/SU388290A1/en
Application granted granted Critical
Publication of SU388290A1 publication Critical patent/SU388290A1/en



The invention relates to devices for converting the angle of rotation into a code, applicable: -, 1 in various industries in software control systems for machines, in automatic weighing devices, in remote control and monitoring systems, etc.
Angle-code converters operating in accordance with the principle of reading are used to convert the rotation angle into a code, along with other devices. The main part of such transducers is the vrash, austers disk (L: for a drum) with code tracks applied to it. The number of code tracks is determined by the value of the conversion error that occurs, due to the sampling resolution. The higher the conversion accuracy is to be ensured, the larger the number of tracks should be the code scale of the converter. This in turn complicates the design of the disc and causes its production to become more expensive.
The purpose of the invention is to simplify the design of the converter disk and thereby reduce the cost of its manufacture.
This is achieved by executing a code scale, providing, to it, any desired accuracy of the angle of rotation, in the form of a disk with a single code track, on which the code values of the angle of rotation are represented
all different code combinations of each of the bits arranged in a cyclic sequence such that each code combination is obtained from the next bit offset one digit to the left (or right), lowering the first bit and entering the last bit.
FIG. 1 shows the code scale of the device.
Eight different three-bit combinations are arranged in a cyclic sequence on the same code track. When read clockwise, starting with the sector labeled "O, three-bit code combinations, the following code combinations are obtained in sequence: 000 001 010 101 011 111 110 100 or other, and translated into decimal numbers O, 1, 2, 5, 3, 7, 6, 4.
FIG. 2 is a schematic diagram of the proposed device.
The purpose of the decoder / and matrix scheme 2 - the transformation of the resulting sequence of code combinations from disk 3
using the sensing elements 4 into a sequence of ordinary binary data, which is necessary for the operation of the computing devices connected to the output of the conversion device. As a decoder
the simplest matrix scheme is shown,
in practice, in order to save diodes, it can be replaced by another one (by example, a multi-stage rectangular type).
When any combination of signals is fed to the inputs of the decoder, a signal is obtained at its output only at one specific width. The input signals are binary variables, i.e. the number of combinations of input signals is 2. Therefore, at n inputs, the number of output buses must be 2. In the decoder, the following operating logic is accepted: an output signal equal to one occurs on that bus, the number of which is equal to the binary number, nodavaemoe to the input of the decoder. If a binary combination 101 arrives at the input, an output signal equal to one appears on the bus marked with the AS index. The decoder output buses are input to the matrix transformation circuit (matrix). The number of rows of the matrix is thus 2, and the number of columns is the code length. For the formation of a code at the output of the matrix, each of the output busbars of the decoder connects those columns that provide the required conversion of a sequence of code combinations printed on the proposed disc scale into a regular binary sequence.
The device works as follows.
A code combination readable at the time of measuring the angle of rotation (it will be, for example, 101) is fed to the input of the decoder. At the same time, the voltage source () is turned on. The read combination translates the G and Gz triggers into a single position, leaving the trigger Gd at zero. Under the influence of the incoming voltages from the flip-flops, the diodes connected to the vertical buses a, d, and e turn out to be locked and a high voltage level (code 1) passes to the output bus Ld. On all other weekend tires under consideration. combinations of input signals at least one of the diodes open. As a result, due to the voltage across the resistors R, the AQ-Lu buses are at a low potential (code 0). 0000001010100101 1 101 100100001 10001
This scale ensures the accuracy of that angle of rotation.
360 360
 5 ° 3730.
Subject invention
Turning angle converter into a code containing a disk with a coded and sensing code. In the same way, when the trigger register is set to the trigger register 000, bus A is selected, combinations 001 are bus L, and so on.
Columns B and 5h of the matrix are connected to the bus Lz, the output of which appears as code combination 011.
For convenience of placing the strips of removal of a code from a disk, a code scale can be applied on its front part.
In real devices, the accuracy of measuring the angle of rotation is quite high, which is achieved by increasing the number of bits read from the code scale combinations. The construction of a code scale in the form of a disk with one bit track for large n (six or more) selection methods does not seem possible.
To create such a scale, the following sequence of actions is recommended: n zeroes at the beginning of the scale; recording the received binary number (or its decimal equivalent) into the “accumulator of scale numbers (for example, a separate blank sheet of paper); inclusion in the scale of the next binary mark, different from the previous one; check condition: the number of characters in the scale is less than the value (). If this number is
(), the units are entered in the remaining n bits of the scale (the scale is compiled completely). If the specified condition is met, the last binary characters (i.e., the next number) are extracted. Next, check for the presence of the next number in the accumulator. In the case of its absence, the returned binary number is written to the accumulator of the scale numbers. If it is, then replace the last binary sign of the scale being created with the opposite one, and return to the selection n of the last binary signs of the scale.
This algorithm makes it possible to form an annular sequence consisting of 2 different n-bit code combinations for any ft. So, for example, the scale, compiled according to this rule, for l 6 has the following sequence of zeros in one:
elements connected to the inputs of the decoder, the outputs of which are connected to the inputs of the matrix circuit, characterized in that, in order to simplify the converter, the code scale contains a bit path with code combinations forming a cyclic sequence, and the sensitive elements are located along the discharge path with the distance between them is 1/8 of its length. 01011 1010001001 11001 1 110111 11 1
i g
SU1665165A 1971-06-07 1971-06-07 B SU388290A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
SU1665165A SU388290A1 (en) 1971-06-07 1971-06-07 B

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
SU1665165A SU388290A1 (en) 1971-06-07 1971-06-07 B

Publications (1)

Publication Number Publication Date
SU388290A1 true SU388290A1 (en) 1973-06-22



Family Applications (1)

Application Number Title Priority Date Filing Date
SU1665165A SU388290A1 (en) 1971-06-07 1971-06-07 B

Country Status (1)

Country Link
SU (1) SU388290A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2553079C1 (en) * 2013-11-15 2015-06-10 Открытое акционерное общество "Авангард" Inverse-conjugated code scale

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2553079C1 (en) * 2013-11-15 2015-06-10 Открытое акционерное общество "Авангард" Inverse-conjugated code scale

Similar Documents

Publication Publication Date Title
US2775727A (en) Digital to analogue converter with digital feedback control
GB1360289A (en) Device for scanning and decoding a multiple bar coded representation
US2849704A (en) Data processing system
GB802188A (en) Electrical apparatus for use in controlling the composition of data to be read out seriatim during a read out routine from a data storage device to an output device
US4315252A (en) Apparatus for detecting the relative position of two movable bodies
US2966671A (en) Data transformation systems
US2754502A (en) Data processing machine
SU388290A1 (en) B
GB1257142A (en)
US3614774A (en) Analog-to-digital shaft encoder with antiambiguity binary digital code output
US3114144A (en) Analog to digital converter
US3317905A (en) Data conversion system
GB1031202A (en) Universal code translator
US2984830A (en) Digital code translating system
RU1810898C (en) Device for controlling control-pass point
US2922995A (en) Creep cam indexing mechanism
SU960809A1 (en) Device for computing sine and cosine functions
US3045912A (en) Velocity quantizer
SU388361A1 (en) Functional converter analog — digit
SU857972A1 (en) Coder
SU451114A1 (en) Angle Code Transducer
SU758510A1 (en) Analogue-digital converter
SU377761A1 (en) Device for displaying information on screen
SU668084A1 (en) Multichannel converter
SU898609A1 (en) Voltage-to-code converter with dynamic error correction