Patent GB-762284-A (GB)
Title: Digital encoders and decoders
Inventor: PETHERICK EDWARD JOHN
IPC: H03M1/00
Filed: 1954-01-07
Abstract: 762,284. Digital encoders and decoders. NATIONAL RESEARCH DEVELOPMENT CORPORATION. Dec. 24, 1954 [Jan. 7, 1954], No. 456/54. Class 40 (1). A digital encoder comprises means for representing a magnitude, e.g. a displacement or rotation, in a cyclic permuting binary-decimal code in which the digits 0 to 9 of a cyclic permuting decimal code are represented in a binary code which is cyclic permuting at least for the representation of the digits 0 to 9 and from 9 directly to 0. A digital decoder is provided with means for converting a cyclic permuting binary-decimal code into normal decimal form. The digits of the cyclic permuting decimal code are obtained from a normal decimal number by substituting for a digit in the decimal number the complement on nine of the digit whenever the immediately preceding digit of greater significance in the decimal number is odd, e.g. the decimal number 497,649 is represented by 492,349 in the cyclic permuting decimal code. Similarly 497,650 is represented by 492,359, and whereas in changing from 492,349 to 492,359 only one digit is altered, and that by unity, in changing from one to the other corresponding number in the normal decimal system two digits are altered. A normal decimal number is obtained from digits in the corresponding cyclic permuting decimal code by substituting for a digit in the code the complement on nine of that digit when and only when the decoded, normal, decimal digit of next greater order of significance is odd, and a method of determining this is to sum all the uncoded cyclic permuting decimal digits of greater significance than that of the digit to be converted and if this sum is odd, the digit should be complemented on nine, and if even should be left unchanged. The cyclic permuting binary code is preferably such that an odd number of digits 1 in a binary word represents an odd cyclic permuting decimal digit, and is such that not only does not more than one binary digit change for each unit change between 0 and 9, but also not more than one binary digit changes during the change from 9 directly to 0. For ease in decoding it is arranged that the binary words representing N and (9-N) differ by only one binary digit, i.e. the complementing digit, e.g. 0101 = 0, 1101 = 9, 0001 = 1, 1001 = 8, and so on. Encoder. A copper disc, Fig. 1, is notionally divided into one hundred sectors, conducting portions being shown as cross-hatched and the remaining portions representing depressions which are filled with insulating material. The disc is divided notionally into eight annular rings Y1 to Y8 which co-operate with brushes (not shown) and define binary digits 1 or 0 according to whether there is a conducting portion or depression at a given point. The outer rings Y1 to Y4 define by means of a cyclic permuting binary code the less significant digit of a cyclic permuting decimal word,'which itself defines one of the hundred sectors. The inner rings Y5 to Y8 define the more significant digit. With the preferred code, one ring in each group of four may be dispensed with by placing two brushes staggered relative to one another on one of the rings. Alternatively the disc may be made from transparent material with opaque portions corresponding to the conducting portions on the copper disc, the code being obtained as pulse train by means of a beam of light which scans the disc radially and cooperates with a photo-electric cell. Two or more discs may be geared together by Geneva stop mechanism. Decoder. A decoder operating in the parallel mode, Fig. 2, comprises a converter 20 for converting signals in the binary-decimal cyclic permuting code into signals representing in a cyclic permuting binary code the digits of the corresponding normal decimal number, and converters 21, 22, 23, for converting the binary digits representing the normal decimal number into normal decimal form. The rule for effecting this conversion is that the digits of the cyclic permuting binary code representing a cyclic permuting decimal digit are altered so as to represent the complement on nine of the decimal digit whenever the total number of digits 1 in the cyclic permuting binary words representing cyclic permuting decimal digits of greater significance is odd. To each group of input lines 24, 25, 26 is applied a potential pattern representing in the cyclic permuting binary code a digit in the cyclic permuting decimal code, the group 24 representing the most significant digit, and a positive potential representing the binary digit 1 and a zero potential the digit 0. The left-hand line in each group represents the complementing binary digit, and when it is desired to complement on 9 the decimal digit represented by the potentials on the input lines, the potential on the left-hand line of the group is changed from positive to zero or vice versa. Thus when an odd number of input lines are at a positive potential in the group 24, a positive (or zero) potential in line 27 of group 25 will appear as a zero (or positive) potential on line 29 at the output of the converter 20. Similarly, when an odd number of input lines are at a positive potential in the groups 24 and 25 a zero (or positive) potential on line 28 will appear as a positive (or zero) potential on line 30. When an even number of input lines are at a positive potential in the group 24 the potential on the line 27 appears unchanged at the line 29 and similarly for the remaining groups. Each group of four output lines from the converter 20 is fed to a converter 21, 22 or 23, each converter energizing one of a group of ten output lines 31, 32 or 33, according to the potential pattern at its input. Each output line may energize a printing mechanism, or electric lamp to indicate the normal decimal number represented by the inputs to the converter 20. The converter 20, Fig. 3, comprises a series of not-equivalent gates 40 to 47, in which if the two inputs to a gate 1 are the same, no output is obtained therefrom, but if the inputs differ, an output is obtained. The gate 40 has two input lines 49 and 50 representing the first two digits respectively of the binary word representing the most significant cyclic permuting decimal digit, these two inputs also being passed to two output lines 51, 52. The output f each of the gates 40 to 46 is connected to the next gate in the series. The input lines 49, 50, 53, 54 form the group of input lines 24, Fig. 2, and output lines 51, 52, 55, 56, from the corresponding group of output. lines. The input lines 27, 57, 58, 59, form the group 25, and output lines 29, 60, 61, 62, the corresponding output. If positive potentials are applied to an odd number of input lines 49, 50,53, 54, a positive potential will appear at the output of gate 42, but not otherwise, and this positive potential will cause the digit represented by the potential on the line 27 to be changed at the output 29 of the gate 46. Similarly the digit represented by the input on the line 28 will be changed at the output line 30 when positive potentials are applied to an odd number of the preceding input lines 49 ... 59. The groups of four not-equivalent gates in Fig. 3 may comprise circuits operating on the principle disclosed in Specification 701,851, [Group XIX], Fig. 4 (not shown). Fig. 5 shows a converter such as 21, Fig. 2, in which the input lines 51, 52, 55, 56 carry a code representing a normal decimal number in cyclic permuting binary form. The lines 52, 55 are connected to an and gate 60 which passes a positive potential to an and gate 61 and an inhibiting gate 62 only when a positive potential is applied to both lines 52 and 55. Lines 55, 56 are connected to an and gate 63 whose output is connected to gates 64, 65. Lines 52, 56 are connected to an and gate 66 whose output is connected to gates 67, 68. The line 55 is connected to an inhibiting gate 69 so that a positive potential from line 55 will pass to two gates 70, 71, except when there is a positive potential on either of lines 52 and 56. Similarly the line 56 is connected to an inhibiting gate 72 to pass a positive potential to gates 73 and 74 except when there is a positive potential on either of the lines 52 and 55. The line 51 is connected to and gates 61, 70, 64, 73, and 67, and to the inhibiting inputs of the inhibiting gates 62, 71, 65, 74, and 68, these and gates and inhibiting gates being connected at their outputs to lamps 75 to 84 respectively which when energized illuminate drawings of the decimal digits 5, 4, 6, 3, 7, 2, 8, 1, 9, 0, respectively. If, for example, positive potentials are applied to the input lines 51, 52, 53, and zero potential to the line 56, positive potentials will be applied to the and gate 60 and through this gate to gates 61 and 62. The gate 61 will be opened and gate 62 closed by the positive potential on input line 51 and the lamp 75 will be lit to indicate the normal decimal digit 5 in accordance with the code used. The positive potential on line 55 is prevented from reaching gates 70 and 71 because the gate 69 is closed by the positive potential on line 52. In a similar manner the circuit will convert any combination of potentials set up in accordance with the code used into a potential on a single output line representing the corresponding decimal digit. A decoder arranged directly to operate a typewriter, Fig. 6a, comprises relays A, B, C, D having inputs 110 to 113 to which are applied voltages according to a binary word representing a single cyclic permuting decimal. digit. Lines 114 and 115 are connected to contacts A1 and A2 respectively of relay A2, and to the outputs of a similar set of relay contacts associated with further relays which are so arranged that when the total number of digits 1 representing cyclic permuting decimal digits of higher significance is even the line 114 is earthed and when this number of digits 1 is odd the line 115 is earthed. Similarly the