US4768189A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High capacity communication utilizing static, OR-type channels
Assignee: Iconectiv LLC
•
Filing: 1987-06-17
•
Granted: 1988-08-30
•
Expires: 2007-06-17
Abstract
Abstract Methodology and associated circuitry (131,141-143, 151,152,161,162,171-174,181) are disclosed for achieving contention-free broadcasting over one or more buses interconnecting a plurality of synchronized stations. In broad terms for the multiple bus case, each station that intends to utilize the buses prepares candidate message frames equalling the number of buses. The first candidate message of each station (301), after a first perturbation, is propagated over the first bus (311); also, the second candidate message of each station (302), after a second perturbation, is propagated over the second bus (312); this process occurs for all buses. Then, any station detecting a mismatch between its most recently propagated bit on a particular bus and the state of that bus deactivates further propagation of the candidate message on that bus. To arrive at the correct candidate message revealed by each bus, the inverse of the original perturbation must be applied to the revealed message. Examples of perturbations include an EXCLUSIVE-OR operation with randomly generated numbers, cyclic shift operation, cyclic inversion operation and linear transformation.
Inventors
- 👤 Bhaskarpillai Gopinath
- 👤 Shuo-Yen R. Li
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 08:02
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/407; H04L12/413; H04L12/4135
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
151 words
A method for transmitting at least one first message over a first bus and at least one second message over a second bus, each said bus interconnecting a plurality of synchronized stations, said method comprising the steps of broadcasting the bits generated by each of the stations serially over said first bus and the complement of said bits serially over said second bus, and wherein the state of each said bus during each bit interval is the OR of the bits broadcast by the stations, deactivating broadcasting over said first bus by any of the stations whenever its most recently broadcast bit differs from the state of said first bus, and deactivating broadcasting over said second bus by any of the stations whenever its most recently broadcast complemented bit differs from the state of said second bus, wherein each said message is comprised of the bits broadcast on its respective bus.
Claim 2
Independent Claim
151 words
A method for transmitting at least one first message over a first bus and at least one second message over a second bus, each said bus interconnecting a plurality of synchronized stations, said method comprising the steps of broadcasting the bits generated by each of the stations serially over said first bus and the complement of said bits serially over said second bus, and wherein the state of each said bus during each bit interval is the OR of the bits broadcast by the stations, deactivating broadcasting over said first bus by any of the stations whenever its most recently broadcast bit differs from the state of said first bus, and deactivating broadcasting over said second bus by any of the stations whenever its most recently broadcast complemented bit differs from the state of said second bus, wherein each said message is comprised of the bits broadcast on its respective bus.
Claim 3
Independent Claim
207 words
A method for transmitting a plurality of messages in each time period over a set of buses interconnecting numerous synchronized stations, each of said messages comprising the series of bits transmitted by the corresponding ones of said buses in said period, said method comprising the steps of supplying to each of said stations a first set of bit sequences corresponding to the number of said buses, generating for each of said stations a second set of bit sequences by serially performing EXCLUSIVE-OR operations on the bits of a message generated by each of said stations and said first set of sequences, serially broadcasting the bits from each sequence in said second set over corresponding ones of said buses, and wherein the state of each of said buses during each bit interval is the OR of the bits from said second set as broadcast by the stations, deactivating broadcasting over any of said buses by any of said stations during said period whenever its most recently broadcast bit differs from the state of said corresponding one of said buses, and generating each of said messages by performing EXCLUSIVE-OR operations on the bits broadcast on each said corresponding bus during said period with said sequences in said first set.
Claim 4
Independent Claim
207 words
A method for transmitting a plurality of messages in each time period over a set of buses interconnecting numerous synchronized stations, each of said messages comprising the series of bits transmitted by the corresponding ones of said buses in said period, said method comprising the steps of supplying to each of said stations a first set of bit sequences corresponding to the number of said buses, generating for each of said stations a second set of bit sequences by serially performing EXCLUSIVE-OR operations on the bits of a message generated by each of said stations and said first set of sequences, serially broadcasting the bits from each sequence in said second set over corresponding ones of said buses, and wherein the state of each of said buses during each bit interval is the OR of the bits from said second set as broadcast by the stations, deactivating broadcasting over any of said buses by any of said stations during said period whenever its most recently broadcast bit differs from the state of said corresponding one of said buses, and generating each of said messages by performing EXCLUSIVE-OR operations on the bits broadcast on each said corresponding bus during said period with said sequences in said first set.
Claim 5
Dependent Claim
29 words
The method as recited in claim 2 wherein said step of supplying includes the step of providing a set of random bit sequences to serve as said first set.
Claim 6
Dependent Claim
30 words
The method as recited in claim 2 wherein said step of supplying includes the step of providing a set of cyclicly shifted bit sequences to serve as said first set.
Claim 7
Dependent Claim
30 words
The method as recited in claim 2 wherein said step of supplying includes the step of providing a set of cyclicly inverted bit sequences to serve as said first set.
Claim 8
Dependent Claim
30 words
The method as recited in claim 2 wherein said step of supplying includes the step of providing a set of linearly transformed bit sequences to serve as said first set.
Claim 9
Dependent Claim
159 words
Circuitry for broadcasting a first message and a second message to a plurality of synchronized stations, said circuitry comprising first and second OR buses interconnecting the stations, means for generating candidate message information bits within each of the stations, means for broadcasting said candidate message information bits serially over said first bus and for broadcasting the complement of said candidate message information bits serially over said second bus, and wherein the state of each said bus during each bit interval is the OR of the bits broadcast by the stations, means for deactivating broadcasting over said first bus by any of the stations whenever its most recently broadcast bit differs from the state of said first bus, and means for deactivating broadcasting over said second bus by any of the stations whenever its most recently broadcast bit differs from the state of said second bus, wherein each said message is comprised of the bits broadcast on its respective bus.
Claim 10
Dependent Claim
159 words
Circuitry for broadcasting a first message and a second message to a plurality of synchronized stations, said circuitry comprising first and second OR buses interconnecting the stations, means for generating candidate message information bits within each of the stations, means for broadcasting said candidate message information bits serially over said first bus and for broadcasting the complement of said candidate message information bits serially over said second bus, and wherein the state of each said bus during each bit interval is the OR of the bits broadcast by the stations, means for deactivating broadcasting over said first bus by any of the stations whenever its most recently broadcast bit differs from the state of said first bus, and means for deactivating broadcasting over said second bus by any of the stations whenever its most recently broadcast bit differs from the state of said second bus, wherein each said message is comprised of the bits broadcast on its respective bus.
Claim 11
Dependent Claim
208 words
Circuitry for broadcasting a plurality of messages in each time period over a set of buses interconnecting numerous synchronized stations, each of said messages comprising the series of bits transmitted by the corresponding ones of said buses in said period, said circuitry comprising means for providing to each of the stations a first set of bit sequences corresponding to the number of said buses, means for generating for each of said stations a second set of bit sequences by serially performing EXCLUSIVE-OR operations on the bits of a message generated by each of said stations and said first set of sequences, means for serially broadcasting the bits from each sequence in said second set over corresponding ones of said buses, and wherein the state of each of said buses during each bit interval is the OR of the bits from said second set as broadcast by the stations, means for deactivating broadcasting over any of said stations during said period whenever its most recently broadcast bit differs from the state of said corresponding one of said buses, and means for generating each of said messages by performing EXCLUSIVE-OR operations on the bits broadcast on each said corresponding bus during said period with said sequences in said first set.
Claim 12
Dependent Claim
208 words
Circuitry for broadcasting a plurality of messages in each time period over a set of buses interconnecting numerous synchronized stations, each of said messages comprising the series of bits transmitted by the corresponding ones of said buses in said period, said circuitry comprising means for providing to each of the stations a first set of bit sequences corresponding to the number of said buses, means for generating for each of said stations a second set of bit sequences by serially performing EXCLUSIVE-OR operations on the bits of a message generated by each of said stations and said first set of sequences, means for serially broadcasting the bits from each sequence in said second set over corresponding ones of said buses, and wherein the state of each of said buses during each bit interval is the OR of the bits from said second set as broadcast by the stations, means for deactivating broadcasting over any of said stations during said period whenever its most recently broadcast bit differs from the state of said corresponding one of said buses, and means for generating each of said messages by performing EXCLUSIVE-OR operations on the bits broadcast on each said corresponding bus during said period with said sequences in said first set.
References Cited (Backward Citations)
US3796992A
Cited
GB1365838A
Cited
US4253179A
Cited
US4281380A
Cited
US4359731A
Cited
US4470110A
Cited
US4376278A
Cited
US4481626A
Cited
US4476467A
Cited
US4569046A
Cited
JPS61195036A
Cited
US4715031A
Cited
US4719458A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-08-30 | 1992-02-29 | 1992-08-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-08-30 | 1996-02-29 | 1996-08-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-08-30 | 2000-02-29 | 2000-08-30 | $7700.00 | Window Closed / Lapsed |