Ternary and multi-value digital signal scramblers, descramblers and sequence generators
First Claim
1. A method of scrambling a ternary signal with a scrambler, the ternary signal being able to assume one of three states and the scrambler having a first scrambling ternary logic device that implements a ternary logic function, sc, and a scrambling logic circuit, comprising:
- inputting the ternary signal and an output from the scrambling logic circuit to the first scrambling ternary logic device;
inputting an output from the first scrambling ternary logic device to the scrambling logic circuit;
wherein the ternary logic function, sc, can be specified by a scrambling ternary truth table having three columns, each of the columns being defined by a ternary inverter;
whereby the output from the first scrambling ternary logic device is a scrambled version of the ternary signal.
2 Assignments
0 Petitions
Accused Products
Abstract
Reversible and self reversing multi-value scrambling functions created by applying multi-value inverters are disclosed. The generation of possible multi-value inverters is also presented. Corresponding multi-value descrambling functions are also disclosed. The multi-value functions are used in circuits that scramble and descramble multi-value signals. The multi-value functions can also be used in signal generators. Such signal generators do not require the use of multipliers. The auto-correlation of the signals generated by the signal generators is also presented. Electronic circuits that implement the multi-value functions are also described.
90 Citations
73 Claims
-
1. A method of scrambling a ternary signal with a scrambler, the ternary signal being able to assume one of three states and the scrambler having a first scrambling ternary logic device that implements a ternary logic function, sc, and a scrambling logic circuit, comprising:
-
inputting the ternary signal and an output from the scrambling logic circuit to the first scrambling ternary logic device;
inputting an output from the first scrambling ternary logic device to the scrambling logic circuit;
wherein the ternary logic function, sc, can be specified by a scrambling ternary truth table having three columns, each of the columns being defined by a ternary inverter;
whereby the output from the first scrambling ternary logic device is a scrambled version of the ternary signal. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. Apparatus for scrambling a ternary signal that can assume one of three states, comprising:
-
a first scrambling ternary logic device that implements a ternary logic function, sc, the first scrambling ternary logic device having a first and second input and an output;
a scrambling logic circuit having an input and an output;
wherein the ternary signal is input to the first input of the first scrambling ternary logic device, the output of the scrambling logic circuit is input to the second input of the first scrambling ternary logic device and the output of the first scrambling ternary logic device is provided to the input of the scrambling logic circuit, wherein the ternary logic function, sc, can be specified by a scrambling ternary truth table having three columns, each of the columns being defined by a ternary inverter;
whereby a scrambled ternary signal is provided on the output of the first scrambling ternary logic device. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A method of scrambling a multi-value signal that can assume one of x states, wherein x is greater than or equal to 4, with a scrambler, the scrambler having a first scrambling multi-value logic device that implements a multi-value logic function, fsc, and a scrambling logic circuit, comprising:
-
inputting the multi-value signal and an output from the scrambling logic circuit to the first scrambling multi-value logic device;
inputting an output from the first scrambling multi-value logic device to an input to the scrambling logic circuit;
wherein the multi-value logic function, fsc, can be specified by a multi-value scrambling truth table having x columns, each of the columns being defined by a multi-value inverter;
whereby the output from the first scrambling multi-value logic device is a scrambled version of the multi-value signal. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
-
28. Apparatus for scrambling a multi-value signal that can assume one of x states, wherein x is greater than or equal to 4, comprising:
-
a first scrambling multi-value logic device that implements a multi-value logic function, fc, the first multi-value logic device having a first and second input and an output;
a scrambling logic circuit having an input and an output;
wherein the multi-value signal is input to the first input of the first scrambling multi-value logic device, the output of the scrambling logic circuit is input to the second input of the first scrambling multi-value logic device and the output of the first scrambling multi-value logic device is input to the input of the scrambling logic circuit, wherein the multi-value logic function, fc, can be specified by a multi-value scrambling truth table having x columns, each of the columns being defined by the application of one or more multi-value inverters to each column;
whereby a scrambled multi-value signal is provided on the output of the first scrambling multi-value logic device. - View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36)
-
-
37. A multi-value sequence generator, comprising:
-
a shift register having a plurality of elements;
a multi-value logic device having a first input, a second input and an output;
wherein an output from a first of the plurality of elements is connected to the first input of the multi-value logic device, an output from a second of the plurality of elements is connected to the second input of the multi-value logic device and the output from the multi-value logic device is connected to an input of one of the plurality of elements.
-
-
38. A ternary sequence generator, comprising:
-
a ternary shift register comprising n serially connected ternary memory elements, n being an integer with value 2 or greater;
a ternary logic device that implements a ternary function, the ternary function being represented by a ternary truth table with three columns of three elements and each column in the truth table being one of six ternary reversible inverters, as long as each column in the truth table is not an identity inverter, the ternary logic device having a first and second input and an output;
wherein an output of a first of the memory elements of the n length shift register is connected to the first input of the ternary logic device and an output of a second of the memory elements of the n-length shift register is connected to the second input of the ternary logic device; and
wherein the output of the ternary logic device is connected to an input of the n-length shift register.
-
- 39. The ternary sequence generator as claimed in claim 39, whereby a ternary sequence is generated at the output of any of the n-length shift register memory elements
-
41. A method of generating a ternary sequence with a ternary shift register having n serially connected ternary memory elements, n being an integer with value 2 or greater and with a ternary logic device that implements a ternary function, the ternary function being represented by a ternary truth table with three columns of three elements and each column in the truth table being one of six ternary reversible inverters, as long as each column in the truth table is not an identity inverter, the ternary logic device having a first and second input and an output, comprising:
-
outputting a first signal from a first of the memory elements of the n length shift register to the first input of the ternary logic device;
outputting a second signal from a second of the memory elements of the n-length shift register to the second input of the ternary logic device; and
outputting a third signal from the ternary logic device to an input of the n-length shift register.
-
-
44. A multi-value sequence generator, comprising:
-
a multi-value shift register comprising n serially connected multi-value memory elements, n being an integer with value 2 or greater;
a multi-value logic device that implements a multi-value function, the multi-value function being represented by a multi-value truth table with x columns of x elements and each column in the truth table being one of x! multi-value reversible inverters, as long as each column in the truth table is not an identity inverter, the multi-value logic device having a first and second input and an output, x being greater than 3;
wherein an output of a first of the memory elements of the n length shift register is connected to the first input of the multi-value logic device and an output of a second of the memory elements of the n-length shift register is connected to the second input of the multi-value logic device; and
wherein the output of the multi-value logic device is connected to an input of the n-length shift register. - View Dependent Claims (45, 46)
-
-
47. A method of generating a multi-value sequence with a multi-value shift register having n serially connected multi-value memory elements, n being an integer with value 2 or greater and with a multi-value logic device that implements a multi-value function, the multi-value function being represented by a multi-value truth table with three columns of three elements and each column in the truth table being one of six multi-value reversible inverters, as long as each column in the truth table is not an identity inverter, the multi-value logic device having a first and second input and an output, comprising:
-
outputting a first signal from a first of the memory elements of the n length shift register to the first input of the multi-value logic device;
outputting a second signal from a second of the memory elements of the n-length shift register to the second input of the multi-value logic device; and
outputting a third signal from the multi-value logic device to an input of the n-length shift register. - View Dependent Claims (48, 49)
-
-
50. A ternary sequence generator, comprising:
-
a ternary shift register having n serially connected ternary memory elements, n being an integer greater than or equal to 2;
p ternary logic devices, each ternary logic device implementing a ternary function, each of the ternary functions being represented by a ternary truth table with three columns of three elements, each of the three columns being defined by one of six ternary reversible inverters such that each column is not defined by an identity inverter;
wherein p is less than or equal to (n−
1);
each of the p ternary logic devices being connected in series between an output of the ternary shift register and the input of the ternary shift register and each of the p ternary logic devices having an input connected to an output of one of the ternary memory elements;
wherein the ternary memory elements providing the output to each of the p ternary logic devices are defined by the presence of a coefficient not equal to zero in an irreducible polynomial over the Galois Field GF(3n) of degree n with p coefficients not equal to zero.
-
-
51. A x-value sequence generator, comprising:
-
a x-value shift register having n serially connected ternary memory elements, n being an integer greater than or equal to 2;
p x-value logic devices, each x-value logic device implementing a x-value function, each of the x-value functions being represented by a x-value truth table with x columns of x elements, each of the x columns being defined by one of x! reversible inverters such that each column is not defined by an identity inverter;
wherein p is less than or equal to (n−
1);
each of the p x-value logic devices being connected in series between an output of the x-value shift register and the input of the x-value shift register and each of the p x-value logic devices having an input connected to an output of one of the x-value memory elements;
wherein the x-value memory elements providing the output to each of the p x-value logic devices are defined by the presence of a coefficient not equal to zero in an irreducible polynomial over the Galois Field GF(xn) of degree n with p coefficients not equal to zero.
-
-
52. A ternary sequence generator that generates a sequence based on the polynomial xn+axn−
- 1+bxn−
2+ . . . —
1, the polynomial having p coefficients, comprising;
a ternary shift register having n serially connected ternary memory elements, n being an integer greater than or equal to 2;
p ternary logic devices, each ternary logic device implementing a ternary function, each of the ternary functions being represented by a ternary truth table with three columns of three elements, each of the three columns being defined by one of six ternary reversible inverters such that each column is not defined by an identity inverter;
wherein p is less than or equal to (n−
1);
each of the p ternary logic devices being connected in series between an output of the ternary shift register and the input of the ternary shift register and each of the p ternary logic devices having an input connected to an output of one of the ternary memory elements;
wherein the ternary memory elements providing the output to each of the p ternary logic devices are defined by the terms of the polynomial having a non-zero coefficient.
- 1+bxn−
-
53. A method of reducing the component count in a first circuit to generate a second circuit that is equivalent to the first circuit, the first circuit having a ternary logic device having a first input and a second input and a two time multiplier connected to at least to one of the first or second inputs, the ternary logic device implementing a ternary logic function that is defined by a first ternary truth table having three rows and three columns, comprising:
-
if the multiplier is connected to the first input, then modifying the first ternary truth table by switching two columns in the first ternary truth table;
if the multiplier is connected to the second input, then modifying the ternary truth table by switching two rows in the first ternary truth table;
whereby a second ternary truth table is created from the first ternary truth table and the second circuit can be implemented by a second ternary logic device that implements a function that is defined by the second ternary truth table.
-
-
54. A method of reducing the component count in a first circuit to generate a second circuit that is equivalent to the first circuit, the first circuit having a ternary logic device having a first input and a second input and a ternary inverter connected to at least to one of the first or second inputs, the ternary logic device implementing a ternary logic function that is defined by a first ternary truth table having three rows and three columns, comprising:
-
if the ternary inverter is connected to the first input, then modifying the first ternary truth table by switching two columns in the first ternary truth table if the inverter is self-reversing and not equal to the identity inverter or by switching three columns if the inverter is not self-reversing;
if the ternary inverter is connected to the second input, then modifying the ternary truth table by switching two rows in the first ternary truth table if the inverter is self-reversing and not equal to the identity inverter or by switching three rows if the inverter is not self-reversing;
whereby a second ternary truth table is created from the first ternary truth table and the second circuit can be implemented by a second ternary logic device that implements a function that is defined by the second ternary truth table.
-
-
55. An electronic circuit for implementing a ternary logic function that has a first column defined by a first ternary inverter, a second column defined by a second ternary inverter and a third column defined by a third ternary inverter, the electronic circuit processing a ternary logic signal and a second input signal, both signals being able to assume a first state, a second state and a third state, comprising:
-
a first input for the ternary logic signal;
a second input for the second input signal;
an output;
a first channel including means for inverting the ternary logic signal with the first ternary inverter to generate a first inverted ternary logic signal and for placing the first inverter ternary logic signal on the output, when the second input is in the first state;
a second channel including means for inverting the ternary logic signal with the second ternary inverter to generate a second inverted ternary logic signal and for placing the second inverter ternary logic signal on the output, when the second input is in the second state;
a third channel including means for inverting the ternary logic signal with the third ternary inverter to generate a third inverted ternary logic signal and for placing the third inverter ternary logic signal on the output, when the second input is in the third state.
-
-
56. An electronic circuit for implementing a ternary logic function that has a first column defined by a first ternary inverter, a second column defined by a second ternary inverter and a third column defined by a third ternary inverter, the electronic circuit processing a ternary logic signal and a second input signal, both signals being able to assume a first state, a second state and a third state, comprising:
-
a first input for the ternary logic signal;
a second input for the second input signal;
an output;
a first channel connecting the first input to the output, the first channel having a series connection of the first inverter and a first ternary gate that conducts when the second input is in the first state;
a second channel connecting the first input to the output, the second channel having a series connection of the second inverter and a second ternary gate that conducts when the second input is in the second state;
a third channel connecting the first input to the output, the third channel having a series connection of the third inverter and a third ternary gate that conducts when the second input is in the third state.
-
-
57. A method of scrambling an unknown ternary signal with a known ternary signal, the known and unknown ternary signals being able to assume one of three states, comprising:
-
inputting the unknown ternary signal to a first input of a scrambling ternary logic device;
inputting the known ternary signal to a second input of the scrambling ternary logic device;
wherein the ternary logic function, sc, can be specified by a scrambling ternary truth table having three columns, each of the columns being defined by a ternary inverter, and outputting a scrambled ternary signal from an output of the scrambling ternary logic device. - View Dependent Claims (58, 59, 60, 61, 62, 63, 64)
-
-
65. Apparatus for scrambling an unknown ternary signal with a known ternary signal, the known and unknown ternary signals being able to assume one of three states, comprising:
-
a scrambling ternary logic device having a first input, a second input and an output;
the unknown ternary signal being input to the first input of the scrambling ternary logic device and the known ternary signal being input to the second input of the scrambling ternary logic device;
wherein the scrambling ternary logic device implements a ternary logic function, sc, that is specified by a ternary truth table having three columns, each of the columns being defined by a ternary inverter, and wherein a scrambled ternary signal is provided at the output of the scrambling ternary logic device. - View Dependent Claims (66, 67, 68, 69, 70, 71, 72, 73)
-
Specification