RU79360U1 - CONVERTER ANGLE CODE - Google Patents

Abstract

The utility model relates to instrumentation, in particular to converting the angle of rotation of the shaft into a code. The objective of the utility model is to simplify the converter by reducing the number of additional reading elements, while maintaining the ability to correct single errors. The angle-code converter contains a code disk with an information track made in the form of gradations of a pseudo-random binary sequence of maximum period length M = 2-1, constructed by means of a primitive polynomial h (x) of degree n, where n is the bit depth of the transform indexer, n readout elements located along the information track with a constant angular step that is a multiple of the converter quantum δ = 360 ° / M, k additional readout elements, n adders modulo two into two inputs, the outputs of n readout elements are connected to the first inputs of n adders modulo two into two inputs, k adders modulo two, the outputs of k additional readout elements are connected to the first inputs of k adders modulo two, exclude f = nk additional readout elements, where, and the sign] ... [means rounding off f to the nearest larger integer, k additional reading elements are placed along the information track with the possibility of receiving together with n reading elements M different n + k - bit code combinations representing a Hamming code, outputs of m reading elements representing the ith subset from the outputs of n readout elements, obtained by means of the checking equations of the Hamming code, i = 1,2, ..., k, are connected to the corresponding inputs of the i-th adder modulo two, a decoder is implemented that converts

Description

The utility model relates to the field of instrumentation, in particular to analog-to-digital conversion, namely, converters of the angle of rotation of the shaft into a code.

Known converter angle code [A.S. USSR No. 1474843, etc. pr. 27.05.87, IPC Н03М 1/24, publ. 04/23/1989] containing a code disk, n readout elements, an additional readout element, an adder modulo two, an information processing unit.

A disadvantage of the known angle-code converter is the low reliability of reading information from the code disk, since it does not provide the possibility of error correction.

The closest in technical solution and selected by the author for the prototype is the angle-code converter [A.S. USSR No. 1534748, etc. pr. 28.07.87, IPC Н03М 1/22, publ. 01/07/1990], containing a code disk with an information track made in the form of gradations of a pseudo-random binary sequence of maximum period length M = 2 ⁿ -1, constructed by means of a primitive polynomial h (x) of degree n, where n is the bit depth of the converter, n read elements, n additional reading elements, an adder modulo two, n-1 adders modulo two to three inputs, n-1 elements NOT, n-1 elements AND, n adders modulo two two inputs.

The disadvantage of the prototype is its complexity. This is due to the fact that in the considered angle-angle converter, the correction of single errors is achieved by using an excessive number of additional reading elements in it.

The problem solved by the utility model is to simplify the converter by reducing the number of additional reading elements, while maintaining the ability to correct single errors.

The problem is achieved in that from the known angle-code converter containing a code disk with an information track made in the form of gradations of a pseudorandom binary sequence of maximum period length M = 2 ⁿ -1, constructed by means of a primitive polynomial h (x) of degree n, where n - bit depth of the transducer, n readout elements located along the information track with a constant angular step that is a multiple of the transducer quantum δ = 360 ° / M, k additional readout elements, n adders in mode for two inputs, the outputs of n readout elements are connected to the first inputs of n adders modulo two to two inputs, k totalizers to modulo two, the outputs of k additional readout elements are connected to the first inputs of k adders modulo two, f = nk additional readouts are excluded elements where , and the sign] ... [means rounding to the nearest larger integer, k additional reading elements are placed along the information track with the possibility of receiving, together with n reading elements M, various n + k - bit code combinations representing a Hamming code that allows correcting single errors, the outputs of m reading elements, that is, a subset of the outputs of n reading elements, obtained by means of the checking equations of the Hamming code, i = 1,2, ..., k, are connected to the corresponding inputs i-th adder modulo two, introduced decoder performing ordinary binary code conversion in one-hot, i-th input of which is connected to the output i-th adder modulo two, j-th output is connected to a second input of j-th adder

modulo two to two inputs, j = 1,2, ..., n, the outputs of which are the outputs of the converter.

Compared with the prototype, the utility model has a new set of essential features, i.e. meets the criterion of novelty.

The essence of the utility model is illustrated by the drawing, which shows a linear scan of a code disk with an information track made in the form of gradations of a pseudorandom binary sequence of maximum length (M - sequence), as well as a functional diagram of the angle-code converter for n = 4.

In [1], code scales used in the utility model, called pseudorandom code scales (PSCS), and constructed on the basis of the theory of M-sequences, are considered. PCSS have only one information code track, made in accordance with the symbols M - the sequence α = α ₀ α ₁ ... α _M-1 and n readout elements (SC) located along the track. Reading elements make it possible to obtain, with a full turn of the scale M = 2 ⁿ -1, various n-bit code combinations, which ensures the resolution of the angular displacement transducer based on the PSCH δ = 360 ⁰ / M. In general terms, the problem of placing solar cells on a PCSS was solved in [2].

To generate an M-sequence of length M = 2 ⁿ -1, we use a primitive irreducible polynomial h (x) of degree n with Galois field coefficients GF (2) [3], ie

where h ₀ = h _n = 1, and h _i = 0.1 for 0 <i <n.

The symbols of the M-sequence α _{n + j} satisfy the recursive expression

..., (2)

where the sign Ξ means summation modulo two, and indices for symbols of the M-sequence are taken modulo M. The initial values of the symbols of the M-sequence α ₀ α ₁ ... α _n-1 can be chosen arbitrarily, with the exception of the zero combination. For definiteness, when constructing a circular PCSS, the symbols of the M-sequence α ₀ α ₁ ... α _{M-1 are} displayed on the information track in the clockwise direction.

M-sequences belong to the class of cyclic codes and can be specified using the generating polynomial g (x) = (x ^M +1) / h (x), where h (x) is determined in accordance with the expression (1), M = 2 ⁿ -one.

For each M-sequence of length M, there are exactly M different cyclic shifts that can be obtained by multiplying the generating polynomial g (x) by x ^j , where j = 0,1, ..., M-1.

Since PCSS are constructed in accordance with the symbols of the M-sequence, it is possible by cyclic shifts to determine the order in which n reading elements are placed on the scale, i.e. m-th SE, m = 1,2, ..., n, corresponds to the jth _mth cyclic shift x ^jm g (x) of the M-sequence.

Then the polynomial that determines the order of placement of n solar cells on the scale has the form:

Where

Setting j ₁ = 0, according to polynomial (3), we obtain the positions of the 2nd, 3rd, ..., n-th SE shifted relative to the first SE by j ₂ , j ₃ , ..., j _n elementary sections of information track scales respectively.

Table 1 shows the polynomials h (x) up to n = 12 inclusive, which can be used to generate the corresponding M-sequences [3].

Table 1 n h (x) M = 2 ⁿ -1 one x + 1 one 2 x ² + x + 1 3 3 x ³ + x + 1 7 four x ⁴ + x + 1 fifteen 5 x ⁵ + x ² +1 31 6 x ⁶ + x + 1 63 7 x ⁷ + x + 1 127 8 x ⁸ + x ⁶ + x ⁵ + x + 1 255 9 x ⁹ + x ⁴ +1 511 10 x ¹⁰ + x ³ +1 1023 eleven x ¹¹ + x ² +1 2047 12 x ¹² + x ⁷ + x ⁴ + x ³ +1 4095

Let us explain the option of building PCSS, shown in the drawing.

In the example, for simplicity, n = 4 was taken and, accordingly, a primitive irreducible polynomial h (x) = x ⁴ + x + 1 was chosen from Table 1, where h ₀ = h ₁ = h ₄ = 1 "h ₂ = h ₃ = 0. Here, the length of the M-sequence is M = 2 ⁴ -1 = 15, and the M-sequence itself is α = α ₀ α ₁ α ₂ α ₃ α ₄ α ₅ α ₆ α ₇ α ₈ α ₉ α ₁₀ α ₁₁ α ₁₂ α ₁₃ α ₁₄ = 000100110101111. For the initial values of the M-sequence a ₀ = a ₁ = a ₁ = 0, and ₃ = 1, the remaining characters of the sequence are obtained in accordance with the recursive relation (2), which in this example has the form a _{4 + j} = a _{1 + j} a _j , j = 0,1, ..., 10. The arrangement of the four reading elements СЭ ₁ (position 2 in the drawing), СЭ ₂ (position 3 in the drawing), СЭ ₃ (position 4 in the drawing) and СЭ ₄ (position 5 in the drawing) along the scale code track is defined according to (3) by the polynomial r (x) = 1 + x + x ² + x ³ .

When constructing the information track of the code disk 1, the M-sequence with a period of M = 15 should be applied to the code disk in the form of active (units of the M-sequence) and passive (zeros of the M-sequence) sections of the information track, for example, clockwise, only one period of the M-sequence is applied to the information track of the code disc. The M-sequence with a period of M / = 2 ⁿ -1 determines the number of quanta of the information track of the code disk, which in this example is M = 15. Hence, the quantum value is δ = 360 ⁰ / M / = 360 ^0/15 = 24 ⁰ . n reading elements should be placed on the information track of the code disk according to r (x) with a step equal to the value of one quantum of the scale δ, for example, clockwise.

By sequentially fixing the FE four-digit code combination when moving the scale by one quantum counterclockwise, we get 15 different four-digit code combinations. These code combinations corresponding to 15 different angular positions of the PCSS are shown in Table 2.

table 2 PSKSH position number SE ₁ SE ₂ SE ₃ SE ₄ Decimal equivalent of code 0 0 0 0 one one one 0 0 one 0 2 2 0 one 0 0 four 3 one 0 0 one 9 four 0 0 one one 3 5 0 one one 0 6 6 one one 0 one 13 7 one 0 one 0 10 8 0 one 0 one 5 9 one 0 one one eleven 10 0 one one one 7 eleven one one one one fifteen 12 one one one 0 fourteen 13 one one 0 0 12 fourteen one 0 0 0 8

Since the problem solved by the utility model is solved by using Hamming correcting codes that correct a single error, we show how such a code should be implemented in the proposed utility model.

In the early 1950s, Hamming [4] proposed a code in which control characters were placed in a code combination not arbitrarily, but in strictly defined places, which naturally facilitated decoding.

A system was developed to carry out checks of the correctness of the transmitted encoded message, including an algorithm for determining the error syndrome, indicating not only the presence of an error, but also the number of the distorted code position.

The most widely used Hamming code model with the detection and correction of a single error (minimum code distance d = 3).

To synthesize such a Hamming code, it is necessary to solve the following problems.

1. Determine the number of control characters that provide the specified requirements for noise immunity.

2. To establish at what positions of the code combination the control symbols should be placed and which positions the information symbols will occupy.

3. Having collected the layout of the code combination, determine the value of each control character.

4. Create code combinations that include both control and information symbols.

5. Give a check algorithm to determine the presence and place of the error.

Consider the synthesis of a Hamming code with d = 3, as applied to a utility model.

The number of additional SCs k is equal to the number of control characters in the Hamming code and is determined from the relation

where n is the number of SE equal to the number of information symbols in the Hamming code, and the sign] ... [means rounding to the nearest larger integer.

Using expression (4), we calculate the number of additional solar cells k for n = 4, ..., 12. The corresponding calculations and comparative data for the number of additional solar cells in the prototype and utility model are presented in table.3.

table 3 SE number n four 5 6 7 8 9 10 eleven 12 The number of additional solar cells of the utility model k 3 four four four four four four four 5 The number of additional SE prototype n four 5 6 7 8 9 10 eleven 12

Table analysis 3 shows that the use of a Hamming correcting code in a utility model with the ability to correct single errors gives a significant gain in the number of additional FEs, which is from 1 to 7 FEs depending on the bit depth of the converter. Due to this, the task solved by the utility model is achieved.

The places where the control bits should be located in the common code combination are determined. The control characters must be a binary number (error syndrome), which would indicate the number of the error position. As a result of the first private parity check, the symbol of the first (lower) category of the syndrome is obtained, as a result of the second check, the symbol of the second, etc. So, if the error syndrome is represented in the form of a binary number, and the corresponding decimal equivalents are written nearby, then we get Table 4.

Table 4 Error syndrome Decimal equivalent Error syndrome Decimal equivalent 00001 one 01010 10 00010 2 01011 eleven 00011 3 01100 12 00100 four 01101 13 00101 5 01110 fourteen 00110 6 01111 fifteen 00111 7 10,000 16 01000 8 10001 17 01001 9

Next, the numbers of the positions involved in each parity check are written out sequentially.

The first check should include those positions that contain a unit in the lower order. Based on table 3, it will be 1, 3, 5, 9, 11, 13, 15, 17.

The second check should include those positions that contain a unit in the second category. According to table 3, it will be 2, 3, 6, 7, 10, 11, 14, 15.

The third check should include 4, 5, 6, 7, 12, 13, 14, 15 positions.

The fourth check should be attended by 8, 9, 10, 11, 12, 13, 14, 15 positions.

The fifth check should be attended by 16, 17 positions.

As a result, we obtain Table 5.

Table 5 Verification Number Item numbers covered by this check First one 3 5 7 9 eleven 13 fifteen 17 Second 2 3 6 7 10 eleven fourteen fifteen Third four 5 6 7 12 13 fourteen fifteen Fourth 8 9 10 eleven 12 13 fourteen fifteen Fifth 16 17

Analyzing Table 4, we can conclude that the control symbols K _m should be placed at the following positions:

K ₁ at position 1, i.e. 2 ⁰ ;

K ₂ at position 2, i.e. 2 ¹ ;

K ₃ at position 4, i.e. 2 ² ;

K ₄ at position 8, i.e. 2 ³ ;

K ₅ at position 16, i.e. 2 ⁴ .

Positions 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17 should occupy information symbols And ₁₁ , And ₁₀ , And ₉ , And ₈ , And ₇ , And ₆ , And ₅ , respectively. And ₄ , And ₃ , And ₂ , And ₁ , And ₀ .

For a utility model, this result must be applied as follows.

Symbols And ₀ should be formed from the first SC, from the second - And ₁ , ..., from the twelfth - And ₁₁ , from the first additional SC should be formed K ₁ symbols, from the second - K ₂ , ... symbols, from the fifth - symbols K ₅ .

In accordance with the foregoing, the layout of the Hamming code should look as follows.

Item Number one 2 3 four 5 6 7 8 9 10 eleven 12 13 fourteen fifteen 16 17 Symbol K ₁ K ₂ And ₁₁ K ₃ And ₁₀ And ₉ And ₈ K ₄ And ₇ And ₆ And ₅ And ₄ And ₃ And ₂ And ₁ K ₅ And ₀

The definition of the values of each control character is determined by the following expressions.

K ₅ = And ₀ .

Let us explain the above theoretical considerations on the example of a four-digit angle-code converter.

From table 3 for n = 4, we find k = 3.

From Table 5, we have the numbers of positions that participated in each parity check.

Verification No. No. of items covered by this check one 1, 3, 5, 7 2 2, 3, 6, 7 3 4, 5, 6, 7

The control symbols should be placed at the following positions: K ₁ - at position 1, K ₂ - at position 2, K ₃ - at position 4. Positions 3, 5, 6, 7 will occupy respectively the information symbols I ₃ , I ₂ , I ₁ , And ₀ .

The layout of the Hamming code in this case will look as follows.

Item Number one 2 3 four 5 6 7 Symbol K ₁ K ₂ And ₃ K ₃ And ₂ And ₁ And ₀

From the first SE, the And ₀ symbols should be formed, from the second - And ₁ from the third - And ₂ , from the fourth - And ₃ , from the first additional SE should be formed K ₁ symbols, from the second - K ₂ symbols, from the third - K ₃ symbols.

To obtain a seven-digit Hamming code from the scale, we determine the placement positions of three additional SCs along the information track of the code disk.

The initial data for the calculation are expressions for determining control characters and also the polynomial that determines the placement along the information track of the code disk of four SC r (x) = 1 + x + x ² + x ³ .

To determine the position of the first additional FE by the expression for K ₁ , taking into account r (x), we form a polynomial that will have the form r ₁ (x) = 1 + x ² + x ³ . Next, we divide this polynomial modulo two from the side of the lower degrees into the primitive polynomial h (x) = x ⁴ + x + 1 to obtain the remainder as a monomial, and the degree of the monomial is taken modulo M = 15, i.e.

The degree of the monomial determines the position of placement on the scale of the first additional SC, and it should be shifted relative to the first SC by 13 elementary sections of the scale δ clockwise.

To determine the position of the second additional SC by the expression for K ₂ , taking into account r (x), we form a polynomial that will have the form r ₂ (x) = 1 + x + x ³ . Next, we divide this polynomial modulo two from the side of the lower degrees into the primitive polynomial h (x) = x ⁴ + x + 1 to obtain the remainder as a monomial, and the degree of the monomial is taken modulo M = 15, i.e.

The degree of the monomial determines the placement position on the scale of the second additional SC, and it should be shifted relative to the first SC by 7 elementary sections of the scale δ clockwise.

To determine the position of the third additional FE by the expression for K ₃ , taking into account r (x), we form a polynomial that will have the form r ₃ (x) = 1 + x + x ² . Next, we divide this polynomial modulo two from the side of the lower degrees into the primitive polynomial h (x) = x ⁴ + x + 1 to obtain the remainder as a monomial, and the degree of the monomial is taken modulo M = 15, i.e.

The degree of the monomial determines the position of placement on the scale of the third additional SC, and it should be offset relative to the first SC by 10 elementary sections of the scale δ clockwise.

Now the joint placement of four reading elements СЭ ₁ , СЭ ₂ , СЭ ₃ , СЭ ₄ and three additional reading elements ДСЭ ₁ , ДСЭ ₂ , ДСЭ ₃ (positions 6, 7 and 8 in the drawing, respectively) along the code track of the scale will be determined by a polynomial r _total (x) = r (x) + r _add (x) = 1 + x + x ² + x ³ + x ⁷ + x ¹⁰ + x ¹³ .

Consistently fixing the SE seven-bit code combination when moving the scale by one quantum counterclockwise, we get 15 different seven-digit combinations of the Hamming code with a minimum distance of d = 3. It is known that such a code allows correcting a single error. These code combinations corresponding to 15 different angular positions of the PCSS, as well as the correspondence between SC and information symbols, additional SC and control symbols of the Hamming code, are given in Table 6.

Table 6 PSKSH position number DSE ₁ DSE ₂ SE ₄ DSE ₃ SE ₃ SE ₂ SE ₁ K ₁ K ₂ And ₃ K ₃ And ₂ And ₁ And ₀ 0 one one one 0 0 0 0 one one 0 0 one one 0 0 2 0 one 0 one 0 one 0 3 0 0 one one 0 0 one four 0 one one one one 0 0 5 one one 0 0 one one 0 6 0 one one 0 0 one one 7 0 one 0 0 one 0 one 8 one 0 one one 0 one 0 9 one 0 one 0 one 0 one 10 0 0 one 0 one one 0 eleven one one one one one one one 12 0 0 0 one one one one 13 one 0 0 0 0 one one fourteen one one 0 one 0 0 one

Thus, Table 6 shows all possible combinations of the Hamming code with d = 3, including both control and information symbols, for n = 4, when there are no errors in the converter operation. In our case, by mistake we will mean the failure of any SC.

Consider an algorithm based on Hamming verification equations that allows us to establish the presence and place of an error in the operation of the converter. The following cases are possible.

1. There are no errors in the operation of the converter, i.e. all SCs are operational and we have table 6.

Check the code combination read from the scale for errors. Suppose the sixth code combination was read: 0110011. Let us calculate the syndrome. In our case

The 1st check covers positions 1, 3, 5, 7, therefore, the least significant category of the syndrome

The second check covers positions 2, 3, 6, 7, then the second category of the syndrome

The 3rd check covers positions 4, 5, 6, 7, and the third category of the syndrome

Thus, we were convinced that the syndrome has a zero value, which indicates the absence of an error converter in operation, i.e. all SCs are operational. If there is no error converter in operation, the calculation of the syndrome for any code combination will give the same result - zero error syndrome.

Technically, the ratios 5, 6 and 7 are realized by means of three four-input adders modulo two, indicated in the drawing by positions 9, 10 and 11, respectively.

With a zero syndrome, the outputs of these adders generate signals corresponding to the level of logical zero. Further, these signals are fed to the corresponding inputs of the decoder 12. With this combination of signals at its input, a signal corresponding to the level of a logical unit is generated at its zero output, which indicates the absence of an error converter, and signals corresponding to the level of a logical zero are generated at its other outputs. The signals corresponding to the logic zero level from the outputs of the decoder 3, 5, 6 and 7 are fed to the second inputs of the respective adders modulo two to two inputs (16-13), the first inputs of which receive signals from the reading elements СЭ ₁ , СЭ ₂ , СЭ ₃ , SE ₄ , which without change pass to the output of the converter (17).

2. Errors are observed in the operation of the converter, for example, a second SC is out of order, from which information symbols I _{1 are formed} . In the layout of the Hamming code, this symbol takes the sixth position.

Let us analyze the code combination read from the scale for errors. Suppose the sixth code combination 0110001 was read. The second SC in this combination reads zero instead of 1 (see Table 6). We calculate the syndrome. In our case

The 1st check covers positions 1, 3, 5, 7, therefore, the least significant category of the syndrome

The second check covers positions 2, 3, 6, 7, then the second category of the syndrome

The third check covers positions 4, 5, 6, 7, and the third category of the syndrome

Thus, we have an error syndrome equal to 110 ₂ = 6 ₁₀ , which indicates the number of the erroneous position in the Hamming code. This, in turn, indicates that SE ₂ does not work correctly, from which information symbols I _{1 are formed} . When the error syndrome is 110, the output of the adder 9 produces a signal corresponding to the level of logical zero, and at the outputs of the adders 10 and 11 - signals corresponding to the level of the logical unit. Further, these signals are fed to the corresponding inputs of the decoder 12. With this combination of signals at its input, a signal corresponding to the level of a logical unit is generated at its sixth output, which indicates the presence of an error converter, and signals corresponding to a logic zero level are generated at its other outputs. The signals corresponding to the logic zero level from the outputs of the decoder 3, 5 and 7 are fed to the second inputs of the respective adders modulo two to two inputs (16, 15 and 13), the first inputs of which receive signals from the reading elements СЭ ₁ , СЭ ₃ and СЭ ₄ , which without change pass to the output of the converter. The signal corresponding to the level of the logical unit from the output of the decoder 6 is fed to the second input of the corresponding adder modulo two to two inputs (14), the first input of which receives a signal from the reading element SE ₂ , which is corrected (inverted) and passed to the output of the converter (17 )

In the event of failure of any other SC, the correction of the resulting output signals is carried out similarly.

3. The third additional SC failed, from which control symbols K _{3 are formed} . In the layout of the Hamming code, this character takes the fourth position.

Let us analyze the code combination read from the scale for errors. Suppose that the null code combination 1111000 was read. DSE ₃ in this combination reads 1 instead of 0 (see Table 6). We calculate the syndrome. In our case, the first check covers positions 1, 3, 5, 7, therefore, the least significant category of the syndrome

The second check covers positions 2, 3, 6, 7, then the second category of the syndrome

The third check covers positions 4, 5, 6, 7, and the third category of the syndrome

Thus, we have an error syndrome equal to 100 ₂ = 4 ₁₀ , which indicates the No. of the erroneous position in the Hamming code. This, in turn, indicates that DSE ₃ does not work correctly, from which control symbols K _{3 are formed} . With an error syndrome of 100, a signal corresponding to the level of a logical unit is generated at the output of the adder 11, and signals corresponding to a logical zero level are generated at the outputs of the adders 9 and 10. Further, these signals are fed to the corresponding inputs of the decoder 12. With this combination of signals at its input, a signal corresponding to the level of a logical unit is generated at its fourth output, which indicates the presence of an error converter, and signals corresponding to the level of logical zero are generated at its other outputs. The signals corresponding to the level of logical zero from the outputs of the decoder 3, 5, 6 and 7 are fed to the second inputs of the respective adders modulo two to two inputs (16-13), the first inputs of which receive signals from the reading elements of the SE ₁ SE ₂ , SE ₃ , SE ₄ , which without change pass to the output of the converter (17).

The signal at the fourth output of the decoder 12, corresponding to the level of a logical unit, indicates the failure of DSE ₃ . Note that the failure of the additional solar cell does not negatively affect the operation of the converter as a whole.

If any other additional SE fails, the analysis of the readable code combinations is considered in the same way. The signals indicating the failure of additional solar cells, obtained from the corresponding outputs of the decoder 12, can be used during maintenance work or testing the converter.

Thus, the inventive converter is simpler than the prototype and gives a gain in the number of additional SCs used, which is from 1 to 7 SC, depending on the capacity of the converter. Due to this, the task solved by the utility model is achieved. Literature

1. Ozhiganov A.A. Pseudorandom code scales // Instrument Engineering, 1987. V.30. N.2. S.40-43.

2. Ozhiganov A.A. Algorithm for placing reading elements on a pseudo-random code scale // Instrument Engineering, 1994. V.37. N2. S.22-27.

3. MacWilliams F.D., Sloan N.D. Pseudorandom sequences and tables // TIIER. 1976.V.64. N12. S.80-95.

4. Hamming R.V. Coding Theory and Information Theory: Per. from English - M.: Radio and Communications, 1983. - 176 p., Ill.

Claims (1)

An angle-code converter containing a code disk with an information track made in the form of gradations of a pseudorandom binary sequence of maximum period length M = 2 ⁿ -1, constructed by means of a primitive polynomial h (x) of degree n, where n is the bit depth of the converter, n read elements, placed along the information track with an angular step equal to the magnitude of the transducer quantum δ = 360 ° / M, k additional readout elements, n adders modulo two to two inputs, outputs of n readout elements are connected to the first the inputs of n adders modulo two to two inputs, k adders modulo two, the outputs of k additional readout elements are connected to the first inputs of k adders modulo two, characterized in that k additional readout elements are placed along the information track with the possibility of receiving together with n reading elements M of various n + k - bit code combinations representing a Hamming code, where

, and the sign] ... [means rounding to the nearest larger integer, the outputs of n readout elements representing ie the subset of the outputs of n readout elements obtained by the Hamming code verification equations, i = 1, 2, ..., k, are connected to the corresponding inputs of the i-th adder are modulo two, a decoder is introduced that converts an ordinary binary code into a unitary code, the i-th input of which is connected to the output of the i-th adder modulo two, the j-th output of which is connected to the second input of the j-th adder modulo two to two input a, j = 1, 2, ..., n, the outputs of which are the outputs of the converter.