US3990071A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data transmission system using frequency permutation codes
Assignee: Hitachi Ltd
•
Filing: 1974-08-30
•
Granted: 1976-11-02
•
Expires: 1994-08-30
Abstract
Abstract A data transmission system is disclosed in which the information to be transmitted comprises a plurality of unit information pieces each of which in turn is indicated by a numerical code of a binary number or a binary-coded decimal number having a predetermined number of bits. One of said numerical codes makes up a fundamental matrix of a frequency permutation code comprising a plurality of different frequency signals; the number of times by which the information in the form of numerical codes shifts the elements of the fundamental matrix on the basis of weight constants determined by said number of bits is detected; each numerical code is converted into a permutation code in response to the above-mentioned detection and transmitted at the transmitting end in the form of a plurality of different frequency signals according to the elements of the shifted permutation code; the frequency signals thus transmitted are received and stored in sequence and detection is made as to how many shifts are required in order that the matrix elements of said stored permutation code may be made identical to with the fundamental matrix; and the permutation code is converted into a numerical code by calculation of the detected number of shifts and the weight constants.
Inventors
- 👤 Tetsuo Ito
- 👤 Motohisa Nishihara
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 18:10
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/26; H04B; H04B11/00
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
295 words
A data transmission system for transmitting a plurality of numerical codes, successively, comprising: first means for converting each of the numerical codes to be transmitted to a corresponding one of permutation codes represented by a corresponding one of permutations, in time sequence, of a predetermined number of different frequency signals; said first means including matrix means having memories for storing any one of said permutation codes in the form of a matrix, the contents of said memories representing, respectively, elements constituting said matrix so as to indicate the time sequence in transmission of said frequency signals of said one permutation code, means for storing a plurality of weight constants predetermined according to the number of bits constituting each of said numerical codes, means for calculating numerical values by processing said numerical code with respect to said weight constants, successively in order from a larger one to a smaller one of said weight constants, each of said numerical values representing the number of units of the corresponding weight constant contained in a residue of the numerical code after processing of the same with respect to the weight constants larger than said corresponding weight constant, and means for applying a specific one of said permutation codes to said matrix means and effecting shifting of the contents of selected memories in a predetermined mode, repeatedly, by a number of times whose number is dependent on said numerical values, thereby to obtain a new matrix indicative of the time sequence of said frequency signals corresponding to the permutation code of each numerical code, second means for transmitting said different frequency signals in time sequence indicated by said new matrix, and third means for receiving said frequency signals transmitted by said second means and converting said signals into numerical codes.
Claim 2
Dependent Claim
295 words
A data transmission system for transmitting a plurality of numerical codes, successively, comprising: first means for converting each of the numerical codes to be transmitted to a corresponding one of permutation codes represented by a corresponding one of permutations, in time sequence, of a predetermined number of different frequency signals; said first means including matrix means having memories for storing any one of said permutation codes in the form of a matrix, the contents of said memories representing, respectively, elements constituting said matrix so as to indicate the time sequence in transmission of said frequency signals of said one permutation code, means for storing a plurality of weight constants predetermined according to the number of bits constituting each of said numerical codes, means for calculating numerical values by processing said numerical code with respect to said weight constants, successively in order from a larger one to a smaller one of said weight constants, each of said numerical values representing the number of units of the corresponding weight constant contained in a residue of the numerical code after processing of the same with respect to the weight constants larger than said corresponding weight constant, and means for applying a specific one of said permutation codes to said matrix means and effecting shifting of the contents of selected memories in a predetermined mode, repeatedly, by a number of times whose number is dependent on said numerical values, thereby to obtain a new matrix indicative of the time sequence of said frequency signals corresponding to the permutation code of each numerical code, second means for transmitting said different frequency signals in time sequence indicated by said new matrix, and third means for receiving said frequency signals transmitted by said second means and converting said signals into numerical codes.
Claim 3
Dependent Claim
34 words
A data transmission system according to claim 1, in which said weight constant storing means stores weight constants including (m-1)!, (m-2)!, ......, 2!, 1! in the event that said numerical code comprises m bits.
Claim 4
Dependent Claim
51 words
A data transmission system according to claim 1, in which said calculating means include comparator means for comparing each of said numerical codes with the weight constants stored in said weight constant storing means, and means for subtracting the result of the comparison by said comparator means from said numerical code.
Claim 5
Dependent Claim
34 words
A data transmission system according to claim 3, in which said weight constant storing means stores weight constants including (m-1)!, (m-2)!, ....., 2!, 1! in the event that said numerical code comprises m bits.
Claim 6
Dependent Claim
32 words
A data transmission system according to claim 3, in which said weight constant storing means include gate means for comparing said numerical codes in the order of magnitude of said weight constants.
Claim 7
Dependent Claim
265 words
A data transmission system comprising: means for receiving permutation code signals representing numerical codes, respectively, each of said permutation code signals being transmitted in the form of a corresponding one of the permutations of a predetermined number of different frequency signals; matrix means having memories for storing any one of said permutation code signals in the form of a matrix, the contents of said memories representing, respectively, the elements constituting said matrix so as to indicate the time sequence of said frequency signals of said one permutation code signal, means for applying said received permutation code signals to said matrix means to store the frequency signals constituting said permutation code in selected memories of said matrix means such that the time sequence of said frequency signals in receiving of said permutation code is in accordance with the time sequence represented by the elements of said matrix representing said selected memories, means for storing a plurality of weight constants predetermined according to the number of bits constituting each of said numerical codes, means for effecting shifting of the contents of said memories of said matrix means, in a predetermined mode, repeatedly, by a number of times with respect to each of said weight constants, successively, so that the contents of said memories are finally shifted to the memories representing predetermined elements of said matrix, and determining the number of repeating times with respect to each of said weight constants, and means for processing the number of repeating times of the shifting and said weight constants to produce a numerical code corresponding to each permutation code signal.
Claim 8
Dependent Claim
265 words
A data transmission system comprising: means for receiving permutation code signals representing numerical codes, respectively, each of said permutation code signals being transmitted in the form of a corresponding one of the permutations of a predetermined number of different frequency signals; matrix means having memories for storing any one of said permutation code signals in the form of a matrix, the contents of said memories representing, respectively, the elements constituting said matrix so as to indicate the time sequence of said frequency signals of said one permutation code signal, means for applying said received permutation code signals to said matrix means to store the frequency signals constituting said permutation code in selected memories of said matrix means such that the time sequence of said frequency signals in receiving of said permutation code is in accordance with the time sequence represented by the elements of said matrix representing said selected memories, means for storing a plurality of weight constants predetermined according to the number of bits constituting each of said numerical codes, means for effecting shifting of the contents of said memories of said matrix means, in a predetermined mode, repeatedly, by a number of times with respect to each of said weight constants, successively, so that the contents of said memories are finally shifted to the memories representing predetermined elements of said matrix, and determining the number of repeating times with respect to each of said weight constants, and means for processing the number of repeating times of the shifting and said weight constants to produce a numerical code corresponding to each permutation code signal.
Claim 9
Dependent Claim
34 words
A data transmission system according to claim 6 in which said weight constant storing means stores weight constants including (m-1)!, (m-2)!, ......, 2!, 1! in the event that said numerical code comprises m bits.
Claim 10
Dependent Claim
38 words
A data transmission system according to claim 6, in which said processing means include means for multiplying each of said number of shifts by each of said weight constants and means for adding the results of said multiplications.
Claim 11
Dependent Claim
34 words
A data transmission system according to claim 8, in which said weight constant storing means stores weight constants including (m-1)!, (m-2)!, ......, 2!, 1! in the event that said numerical code comprises m bits.
References Cited (Backward Citations)
US2369662A
Cited
US2395693A
Cited
US2900621A
Cited
US2811708A
Cited
US3039081A
Cited
US3344400A
Cited
US3506966A
Cited
US3668643A
Cited
US3860913A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1979-11-02 | 1980-05-03 | 1980-11-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1983-11-02 | 1984-05-03 | 1984-11-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1987-11-02 | 1988-05-03 | 1988-11-02 | $7700.00 | Window Closed / Lapsed |