Patent US3657477A successfully refreshed from Google Patents.
US3657477A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arrangement for encoding intelligence
Assignee: OMNISEC AG TROCKENLOOSTRASSE 91 CH-8105 REGENSDORF SWITZERLAND A Co OF SWITZERLAND
•
Filing: 1962-10-01
•
Granted: 1972-04-18
•
Expires: 1982-10-01
Abstract
Abstract 1. For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mixing circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said inputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the input of the individual consecutive elements of the counting chain being connected with said counting pulse supply so as to alter its state from counting pulse to counting pulse, and the input of the individual consecutive elements of the counting chain being connected further with the output of every previous element by logic gates which serve to interrupt the changing of the state of any particular stage only when by arriving of a counting pulse the state of all previous elements is ''''1'''', and the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Inventors
- 👤 Kurt Ehrat
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 09:20
CPC Classifications
H; H03; H03K; H03K21/00; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
247 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mixing circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said inputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the input of the individual consecutive elements of the counting chain being connected with said counting pulse supply so as to alter its state from counting pulse to counting pulse, and the input of the individual consecutive elements of the counting chain being connected further with the output of every previous element by logic gates which serve to interrupt the changing of the state of any particular stage only when by arriving of a counting pulse the state of all previous elements is ''''1'''' , and the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 2
Dependent Claim
247 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mixing circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said inputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the input of the individual consecutive elements of the counting chain being connected with said counting pulse supply so as to alter its state from counting pulse to counting pulse, and the input of the individual consecutive elements of the counting chain being connected further with the output of every previous element by logic gates which serve to interrupt the changing of the state of any particular stage only when by arriving of a counting pulse the state of all previous elements is ''''1'''' , and the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 3
Dependent Claim
32 words
The generator of claim 1, wherein the number of counting chain elements is greater than 20 so that a minimum period length of code pulse program of 220 counting steps is provided.
Claim 4
Dependent Claim
237 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mixing circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said iNputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the input of the individual consecutive elements of the counting chain being connected over an OR-gate with the output of the previous element and with the complementary output of the element before said previous element, and the first element of the counting chain being connected with said counting pulse supply, the individual elements changing its state with every counting pulse excepted when the previous element changes over from the state ''''1'''' to the ''''0'''' state, and the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 5
Dependent Claim
237 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mixing circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said iNputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the input of the individual consecutive elements of the counting chain being connected over an OR-gate with the output of the previous element and with the complementary output of the element before said previous element, and the first element of the counting chain being connected with said counting pulse supply, the individual elements changing its state with every counting pulse excepted when the previous element changes over from the state ''''1'''' to the ''''0'''' state, and the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 6
Dependent Claim
32 words
The generator of claim 3, wherein the number of counting chain elements is greater than 20 so that a minimum period length of code pulse program of 220 counting steps is provided.
Claim 7
Dependent Claim
226 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mining circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said inputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the first element of the counting chain being connected to said counting pulse supply and the input of the consecutive elements being connected to the output of the previous element so as to form an ordinary binary counter, and means for inverting the outputs of said elements from counting step to counting step and for suppressing such inversion when the highest element changes its state, the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 8
Dependent Claim
226 words
For use in an arrangement for encoding intelligence, a code pulse generator comprising a counting pulse supply, a plurality of binary elements constituting at least one counting chain, an output to each of said binary elements, at least one mixing circuit arrangement, an output to the mining circuit arrangement, and a plurality of inputs to said mixing circuit arrangement, the number of said inputs being substantially equal to the number of elements in the counting chain and each such input being controllable by a respective output of said binary elements, the mixing circuit including means for converting the state of all its inputs into a predetermined code program appearing at its output, the first element of the counting chain being connected to said counting pulse supply and the input of the consecutive elements being connected to the output of the previous element so as to form an ordinary binary counter, and means for inverting the outputs of said elements from counting step to counting step and for suppressing such inversion when the highest element changes its state, the mode of action of the counting chain being such as to alter from counting step to counting step more than the half of all the elements of the counting chain and to pass the counting chain through all the possible position combinations before returning to its initial position.
Claim 9
Dependent Claim
32 words
The generator of claim 5, wherein the number of counting chain elements is greater than 20 so that a minimum period length of code pulse program of 220 counting steps is provided.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-04-18 | 1975-10-18 | 1976-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-04-18 | 1979-10-18 | 1980-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-04-18 | 1983-10-18 | 1984-04-18 | $7700.00 | Window Closed / Lapsed |