Patent US3986997A successfully refreshed from Google Patents.
Patent US3912872A successfully refreshed from Google Patents.
US3912872A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data transmission process
Assignee: International Business Machines Corp
•
Filing: 1974-09-26
•
Granted: 1975-10-14
•
Expires: 1994-09-26
Abstract
Abstract A multiplexing method which utilizes each data bit transmitted to convey both message information and multiplex address information. A memory having sufficient bit position capacity to store a binary number capable of uniquely identifying each multiplexed message source or sink is connected at each point of communication in a point-to-point, multidrop, loop, or other communication link. As information is transmitted across the communication link, it is also shifted through or cyclically written into each memory. One or more of the data bits stored in a memory at any instant in time are used as an address, to identify the source or sink, from or to which, the next data bit or plurality of bits is to be multiplexed.
Inventors
- 👤 Paul Raymond Callens
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 10:56
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/02; H04J3/12; H04J3/24; H04J3/26
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
83 words
The method of multiplexing data from a plurality of sources comprising the steps of: a. storing a plurality of previously multiplexed data bits; b. decoding said stored data bits as an address of one of said sources of data bits to be multiplexed; c. multiplexing at least one data bit from said one of said sources; d. storing said at least one data bit multiplexed in place of an equal number of previously stored data bits and repeating steps (b), (c) and (d).
Claim 2
Independent Claim
83 words
The method of multiplexing data from a plurality of sources comprising the steps of: a. storing a plurality of previously multiplexed data bits; b. decoding said stored data bits as an address of one of said sources of data bits to be multiplexed; c. multiplexing at least one data bit from said one of said sources; d. storing said at least one data bit multiplexed in place of an equal number of previously stored data bits and repeating steps (b), (c) and (d).
Claim 3
Independent Claim
93 words
The method of demultiplexing data comprising the steps of: a. receiving at least one data bit to be routed to one of a plurality of receivers; b. decoding a plurality of previously received data bits as an address of one of said plurality of receivers; c. routing said received at least one data bit to the receiver of said plurality of receivers identified by said address; d. replacing at Least one of said plurality of previously received data bits with said at least one data bit and repeating steps (b), (c) and (d).
Claim 4
Independent Claim
93 words
The method of demultiplexing data comprising the steps of: a. receiving at least one data bit to be routed to one of a plurality of receivers; b. decoding a plurality of previously received data bits as an address of one of said plurality of receivers; c. routing said received at least one data bit to the receiver of said plurality of receivers identified by said address; d. replacing at Least one of said plurality of previously received data bits with said at least one data bit and repeating steps (b), (c) and (d).
Claim 5
Dependent Claim
180 words
A data transmission system including a common communication channel between a plurality of data sources and a plurality of data receivers wherein the improvement comprises: a first memory; first decoding means connected to said first memory for establishing a univocal correspondence between data in said first memory and addresses of said plurality of sources; multiplexing means connected to each of said plurality of sources, to said decoding means, to said communication channel, and to said first memory for gating data from one of said plurality of sources identified by said first decoding means onto said communication channel and into said first memory; a second memory; second decoding means connected to said second memory for establishing said univocal correspondence between data in said second memory and addresses of said plurality of data receivers; demultiplexing means connected to said communication channel, to said second decoding means, to said second memory, and to each of said receivers for gating data from said communication channel into said second memory and to one of said plurality of data receivers identified by said second decoding means.
Claim 6
Dependent Claim
180 words
A data transmission system including a common communication channel between a plurality of data sources and a plurality of data receivers wherein the improvement comprises: a first memory; first decoding means connected to said first memory for establishing a univocal correspondence between data in said first memory and addresses of said plurality of sources; multiplexing means connected to each of said plurality of sources, to said decoding means, to said communication channel, and to said first memory for gating data from one of said plurality of sources identified by said first decoding means onto said communication channel and into said first memory; a second memory; second decoding means connected to said second memory for establishing said univocal correspondence between data in said second memory and addresses of said plurality of data receivers; demultiplexing means connected to said communication channel, to said second decoding means, to said second memory, and to each of said receivers for gating data from said communication channel into said second memory and to one of said plurality of data receivers identified by said second decoding means.
Claim 7
Dependent Claim
76 words
The data transmission system of claim 3 wherein said first memory has a binary bit capacity n capable of defining 2n unique addresses, and wherein less than 2n data sources are connected to said multiplexing means and at least one of said data sources is identified by more than one unique address thereby allowing said at least one of said data sources to transmit at a rate greater than others of said plurality of data sources.
Claim 8
Dependent Claim
76 words
The data transmission system of claim 4 wherein said second memory has a binary bit capacity n capable of defining 2n unique addressses, and wherein less than 2n data receivers are connected to said multiplexing means and at least one of said data receivers is identified by more than one unique address thereby allowing said at least one of said data receivers to transmit at a rate greater than others of said plurality of data receivers.
Claim 9
Dependent Claim
16 words
The data transmission system of claim 3 wherein each of said memories is a shift register.
Claim 10
Dependent Claim
88 words
The data transmission system of claim 3 wherein said multiplexing means further comprises: a different first AND gate connected to each of said plurality of data sources, the outputs of each of said first AND gates connected to said communication channel and to said first memory; and wherein said demultiplexing means further comprises: a different second AND gate connected at an output to each of said plurality of data receivers, an input of each of said second AND gates being connected to an output of said communication channel.
Claim 11
Dependent Claim
197 words
A data transmission system including a common communication channel betweenn a plurality of data sources and a plurality of data receivers wherein the improvement comprises: a first shifting memory, the output of the last stage of said first memory being connected to said communication channel; first decoding means connected to said first memory for establishing a univocal correspondence between data in said first memory and addresses of said plurality of sources; multiplexing means connected to each of said plurality of sources, to said decoding means, and to said first memory for gating data from one of said plurality of sources identified by said first decoding means into said first memory; a second shifting memory having a first stage input connected to said communication channel; second decoding means connected to said second memory for establishing said univocal correspondence between data in said second memory and addresses of said plurality of data receivers; demultiplexing means connected to said second decoding means, to an output of said first stage of said second memory, and to each of said receivers for gating data from said communication channel to one of said plurality of data receivers identified by said second decoding means.
Claim 12
Dependent Claim
197 words
A data transmission system including a common communication channel betweenn a plurality of data sources and a plurality of data receivers wherein the improvement comprises: a first shifting memory, the output of the last stage of said first memory being connected to said communication channel; first decoding means connected to said first memory for establishing a univocal correspondence between data in said first memory and addresses of said plurality of sources; multiplexing means connected to each of said plurality of sources, to said decoding means, and to said first memory for gating data from one of said plurality of sources identified by said first decoding means into said first memory; a second shifting memory having a first stage input connected to said communication channel; second decoding means connected to said second memory for establishing said univocal correspondence between data in said second memory and addresses of said plurality of data receivers; demultiplexing means connected to said second decoding means, to an output of said first stage of said second memory, and to each of said receivers for gating data from said communication channel to one of said plurality of data receivers identified by said second decoding means.
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-10-13 | 1979-04-14 | 1979-10-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1982-10-13 | 1983-04-14 | 1983-10-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1986-10-13 | 1987-04-14 | 1987-10-14 | $7700.00 | Window Closed / Lapsed |