Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
177 words
A system for converting n-bit binary code signals of more than three bits per signal of 1 and 0 bits into a ternary balanced code signal of n-1 bits of 0, + and - bits per ternary code signal, wherein each ternary signal has the same number of 0-bits, comprising: A. means for dividing each signal of said binary code into two groups of units, the first group consisting of the first n-3 bits of each code signal, B. means for converting said first group of bits into the first n-1 bits having a constant ratio of 0 and 1-bits per signal, C. means for converting the 1-bits of said first group of bits into + and - bits according to the second group of the last 3-bits of each binary code signal, and D. means for inverting the + and - bits in alternate ternary code signals having the same unevenness in the number of + and - bits, so that after a few converted ternary signals any D.C. component in said ternary signals is eliminated.
Claim 2
Independent Claim
177 words
A system for converting n-bit binary code signals of more than three bits per signal of 1 and 0 bits into a ternary balanced code signal of n-1 bits of 0, + and - bits per ternary code signal, wherein each ternary signal has the same number of 0-bits, comprising: A. means for dividing each signal of said binary code into two groups of units, the first group consisting of the first n-3 bits of each code signal, B. means for converting said first group of bits into the first n-1 bits having a constant ratio of 0 and 1-bits per signal, C. means for converting the 1-bits of said first group of bits into + and - bits according to the second group of the last 3-bits of each binary code signal, and D. means for inverting the + and - bits in alternate ternary code signals having the same unevenness in the number of + and - bits, so that after a few converted ternary signals any D.C. component in said ternary signals is eliminated.
Claim 3
Dependent Claim
17 words
A system according to claim 1 wherein said n-bit binary code consists of seven units per signal.
Claim 4
Dependent Claim
17 words
A system according to claim 1 wherein said n-bit binary code consists of eight units per signal.
Claim 5
Dependent Claim
17 words
A system according to claim 1 wherein each of said means for converting includes a shift register.
Claim 6
Dependent Claim
15 words
A system according to claim 1 wherein said means for inverting comprises a flip-flop circuit.
Claim 7
Dependent Claim
37 words
A system according to claim 1 wherein each of said means for converting comprises a relay having a switch and each switch is connected for connection to three different potentials corresponding to 0; +, and - bits.
Claim 8
Dependent Claim
25 words
A system according to claim 1 wherein said inverting means is connected to said means for converting the 1-bits of said first group of bits.
Claim 9
Dependent Claim
34 words
A system according to claim 1 wherein said means for connecting the 1-bits of said first group of bits comprises a converter for the last three bits divided from said 8-bit binary code signal.
Claim 10
Dependent Claim
25 words
A system according to claim 8 wherein said dividing means is connected to said converters for the first group of bits and the three bits.
Claim 11
Dependent Claim
20 words
A system according to claim 8 wherein said inverting means is connected to said converter for the last three bits.