US3885105A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Code multiplex method using a binary channel
Assignee: Licentia Patent Verwaltungs GmbH
•
Filing: 1973-10-23
•
Granted: 1975-05-20
•
Expires: 1993-10-23
Abstract
Abstract A method of transmitting and receiving data transmitted via a binary transmission channel according to a code multiplex method wherein a plurality of data sources transmit data in the form of a receiver-specific coded binary sequence per data bit. At each of the data sources, the respective coded binary sequence is transformed to a transformed coded binary sequence which changes its polarity per bit clock pulse whenever a bit of the specific original coded binary sequence is present. The plurality of transformed coded binary sequences are added in a mod 2 adder to form a binary sequence which corresponds to the mod 2 sum signal of all of the transformed coded binary sequences, and the mod 2 sum signal is transmitted via the transmission channel as a binary sequence. At the receiving end, each receiver detects its specific binary coded signal in the mod 2 sum signal and regenerates the data bits.
Inventors
- 👤 Rupert Hildenbrand
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 19:11
CPC Classifications
H; H04; H04J; H04J13/00; H04J13/0074
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
178 words
A method of transmitting data via a binary transmission channel between a plurality of data sources and a plurality of receivers according to the code multiplex method comprising the steps of: providing the data to be transmitted from each of the data sources in the form of a receiver-specific coded binary sequence (Xk) per data bit; transforming each of the coded binary sequences (Xk) to a respective transformed binary sequence (Yk) which changes its polarity per bit clock pulse whenever a bit of the original binary sequence (Xk) is present; adding the transformed binary sequences (Yk) of the individual data sources in mod 2 with a shift in phase to form a binary sequence (M) which corresponds to the mod 2 sum of all of the transformed binary sequences (Yk); feeding the sum signal (M) to the binary data channel as a binary sequence for transmission to the receivers; and at each of the receivers, detecting the specific coded binary sequence associated with the respective receiver and regenerating the data bits associated with the specific coded binary sequence.
Claim 2
Independent Claim
178 words
A method of transmitting data via a binary transmission channel between a plurality of data sources and a plurality of receivers according to the code multiplex method comprising the steps of: providing the data to be transmitted from each of the data sources in the form of a receiver-specific coded binary sequence (Xk) per data bit; transforming each of the coded binary sequences (Xk) to a respective transformed binary sequence (Yk) which changes its polarity per bit clock pulse whenever a bit of the original binary sequence (Xk) is present; adding the transformed binary sequences (Yk) of the individual data sources in mod 2 with a shift in phase to form a binary sequence (M) which corresponds to the mod 2 sum of all of the transformed binary sequences (Yk); feeding the sum signal (M) to the binary data channel as a binary sequence for transmission to the receivers; and at each of the receivers, detecting the specific coded binary sequence associated with the respective receiver and regenerating the data bits associated with the specific coded binary sequence.
Claim 3
Dependent Claim
48 words
The method as defined in claim 1 wherein said step of detecting and regenerating includes: forming an analog sum signal from the received mod 2 sum signal; and correlating the analog sum signal with a signal corresponding to the coded binary sequence (Xk) associated with the specific receiver.
Claim 4
Dependent Claim
100 words
The method as defined in claim 2 wherein said step of forming comprises: differentiating and then rectifying the mod 2 sum signal to form an output signal T; applying the signal T directly to one input of an integrator; and applying the signal T to the opposite polarity input of the integrator after a delay of the duration of one bit of the coded binary sequence (Xk) whereby a constant amplitude signal of the duration of a bit of the binary sequence is added to the output signal from the integrator for every change in the mod 2 sum signal.
Claim 5
Dependent Claim
32 words
The method as defined in claim 1 wherein said transformed binary sequences (Yk) of the data sources are added in mod 2 in any desired phase position with respect to one another.
Claim 6
Dependent Claim
58 words
The method as defined in claim 1 wherein said transformed binary sequences are transmitted in a time quantized manner so that all partial sequences of the mod 2 sum signal have a minimum phase shift tp > or = 1/fg with respect to one another, where fg is the frequency limit of the electronics of the transmission system.
Claim 7
Dependent Claim
52 words
The method as defined in claim 1 wherein said step of detecting and regenerating comprises: differentiating and then rectifying the mod 2 sum signal; and correlating the differentiated and rectified mod 2 sum signal with a signal (Xkd) corresponding to the differentiated and rectified transformed binary sequence associated with the specific receiver.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1978-05-19 | 1978-11-18 | 1979-05-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1982-05-19 | 1982-11-18 | 1983-05-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1986-05-19 | 1986-11-18 | 1987-05-20 | $7700.00 | Window Closed / Lapsed |