Ternary and Higher Multi-Value Digital Scramblers/Descramblers
First Claim
1. A method of scrambling a plurality of n-state symbols with n>
- 2, an n-state symbol being able to assume one of n states, comprising;
inputting a first signal representing a first n-state symbol of the plurality of n-state symbols on a first input of a scrambling device also having a second input and an output;
inputting a second signal representing a second n-state symbol on the second input;
outputting an output signal representing a scrambled n-state symbol on the output;
wherein the relationship between the first n-state symbol which may be called A, the second n-state symbol which may be called B and the scrambled n-state symbol which may be called C is determined by a commutative self reversing function, sc, that satisfies the following equations for all possible states of A and B;
(1) A sc B=C;
(2) C sc B=A; and
(3) A sc C=B; and
repeating the previous steps until all symbols of the plurality of n-state symbols have been scrambled.
0 Assignments
0 Petitions
Accused Products
Abstract
Ternary (3-value) and higher, multi-value digital scramblers/descramblers in digital communications. The method and apparatus of the present invention includes the creation of ternary (3-value) and higher value truth tables that establish ternary and higher value scrambling functions which are its own descrambling functions. The invention directly codes by scrambling ternary and higher-value digital signals and directly decodes by descrambling with the same function. A disclosed application of the invention is the creation of composite ternary and higher-value scrambling devices and methods consisting of single scrambling devices or functions combined with ternary or higher value shift registers. Another disclosed application is the creation of ternary and higher-value spread spectrum digital signals. Another disclosed application is a composite ternary or higher value scrambling system, comprising an odd number of scrambling functions and the ability to be its own descrambler.
68 Citations
20 Claims
-
1. A method of scrambling a plurality of n-state symbols with n>
- 2, an n-state symbol being able to assume one of n states, comprising;
inputting a first signal representing a first n-state symbol of the plurality of n-state symbols on a first input of a scrambling device also having a second input and an output; inputting a second signal representing a second n-state symbol on the second input; outputting an output signal representing a scrambled n-state symbol on the output; wherein the relationship between the first n-state symbol which may be called A, the second n-state symbol which may be called B and the scrambled n-state symbol which may be called C is determined by a commutative self reversing function, sc, that satisfies the following equations for all possible states of A and B; (1) A sc B=C; (2) C sc B=A; and (3) A sc C=B; and repeating the previous steps until all symbols of the plurality of n-state symbols have been scrambled. - View Dependent Claims (2, 3, 4, 5, 6)
- 2, an n-state symbol being able to assume one of n states, comprising;
-
7. An apparatus for scrambling a plurality of n-state symbols including a first n-state symbol, into a plurality of scrambled n-state symbols, each n-state symbol enabled to assume one of n states with n>
- 2, each n-state symbol being represented by a signal, comprising;
a scrambling device having a first and a second input and an output, the first input enabled to receive a signal representing the first n-state symbol, the second input enabled to receive a signal representing a second n-state symbol and the output providing a signal representing a scrambled n-state symbol; wherein the relationship between the first n-state symbol which may be called A, the second n-state symbol which may be called B and the scrambled n-state symbol which may be called C is determined by a commutative self reversing function, sc, that satisfies the following equations for all possible states of A and B; (1) A sc B=C; (2) C sc B=A; and (3) A sc C=B; and wherein the scrambling device has a corresponding descrambling device that recovers the plurality of n-state symbols from the plurality of scrambled n-state symbols. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14)
- 2, each n-state symbol being represented by a signal, comprising;
-
15. An apparatus for descrambling a plurality of scrambled n-state symbols including a first scrambled n-state symbol, each n-state symbol enabled to assume one of n states with n>
- 2, each n-state symbol being represented by a signal, comprising;
a descrambling device having a first and a second input and an output, the first input enabled to receive a signal representing the first scrambled n-state symbol, the second input enabled to receive a signal representing a second n-state symbol and the output providing a signal representing a descrambled n-state symbol; wherein the relationship between the first scrambled n-state symbol which may be called A, the second n-state symbol which may be called B and the descrambled n-state symbol which may be called C is determined by a commutative self reversing function, sc, that satisfies the following equations for all possible states of A and B; (1) A sc B=C; (2) C sc B=A; and (3) A sc C=B. - View Dependent Claims (16, 17, 18, 19, 20)
- 2, each n-state symbol being represented by a signal, comprising;
Specification