Patent US4700341A successfully refreshed from Google Patents.
US4700341A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Stochastic time division multiplexing
Assignee: Racal Data Communications Inc
•
Filing: 1985-10-30
•
Granted: 1987-10-13
•
Expires: 2005-10-30
Abstract
Abstract Stochastic Time Division Multiplexing (STOTDM) is disclosed. in STOTDM data packets are preceded by a flag word. Each data packet appears in a frame of data packets in a predetermined order. If there is no data to be placed in the packet location, only the flag is transmitted and the data location is allocated to other data. By using a fixed length frame, synchronous data packets can be placed near the beginning of the frame and packets which are not timing sensitive may follow them. A variable length frame may also be used wherein data from a plurality of sources are once again ordered and preceded by a flag word or bit. The flag may be used to indicate whether or not the packet location is filled or this may be determined by control packets. Variable length frames may be accommodated as long as the average bandwidth required to transmit the data does not exceed the channel bandwidth.
Inventors
- 👤 Zheng F. Huang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 19:31
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/16; H04J3/1682
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
151 words
A method of multiplexing a plurality of N data packets selected from M possible data packets where M>N, comprising the steps of: arranging M possible data packet locations and M flag words into a frame, each flag word being identical to the other flag words, each flag word and each packet location being associated with a predetermined one of said M possible packets so that each said flag word is also associated with a predetermined one of said packet locations, and each said flag word preceding its associated packet location; filling N of said M packet location with said N packets so that each of said N packets fills its associated packet location leaving (M-N) unfilled packet locations in said frame; and omitting each of said (M-N) unfilled packet location so that no packet location is reserved for packets not included in said N packet locations associated with said N packets.
Claim 2
Independent Claim
151 words
A method of multiplexing a plurality of N data packets selected from M possible data packets where M>N, comprising the steps of: arranging M possible data packet locations and M flag words into a frame, each flag word being identical to the other flag words, each flag word and each packet location being associated with a predetermined one of said M possible packets so that each said flag word is also associated with a predetermined one of said packet locations, and each said flag word preceding its associated packet location; filling N of said M packet location with said N packets so that each of said N packets fills its associated packet location leaving (M-N) unfilled packet locations in said frame; and omitting each of said (M-N) unfilled packet location so that no packet location is reserved for packets not included in said N packet locations associated with said N packets.
Claim 3
Independent Claim
94 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) locating a first flag within said frame; (b) determining, by inspection of information following said first flag, if said first flag is followed by a second flag or a first packet; and (c) routing said first packet if it follows said first flag.
Claim 4
Independent Claim
94 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) locating a first flag within said frame; (b) determining, by inspection of information following said first flag, if said first flag is followed by a second flag or a first packet; and (c) routing said first packet if it follows said first flag.
Claim 5
Dependent Claim
28 words
The method of claim 2, further comprising the steps of: detecting a word associated said first flag; and comparing said word with a stored word to verify synchronization.
Claim 6
Dependent Claim
38 words
The method of claim 2, further comprising the steps of: (d) determining if said second flag is followed by a third flag or a second packet; and (e) routing said second packet if it follows said second flag.
Claim 7
Independent Claim
107 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) locating a first flag within said frame; (b) looking for a second flag after said first flag; (c) routing a first packet if said second flag is not found in step (b); and (d) looking for said second flag after said first packet is routed if said second flag is not found in step (b).
Claim 8
Independent Claim
107 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) locating a first flag within said frame; (b) looking for a second flag after said first flag; (c) routing a first packet if said second flag is not found in step (b); and (d) looking for said second flag after said first packet is routed if said second flag is not found in step (b).
Claim 9
Independent Claim
111 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) reading a first flag and determining by inspecting information following said first flag whether or not a first packet follows said first flag; (b) reading a second flag after step (a) if said first packet does not follow said first flag; and (c) routing said first packet after step (a) if said first packet does follow said first flag.
Claim 10
Independent Claim
111 words
A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of: (a) reading a first flag and determining by inspecting information following said first flag whether or not a first packet follows said first flag; (b) reading a second flag after step (a) if said first packet does not follow said first flag; and (c) routing said first packet after step (a) if said first packet does follow said first flag.
Claim 11
Independent Claim
63 words
An apparatus for demultiplexing a stochastic time division multiplexed frame of data packets, comprising: detecting means for detecting a predetermined flag pattern within said frame of data packets; counting means for counting the number of flag patterns detected by said detecting means; and routing means, responsive to said counting means, for routing a data packet in accordance with said number of flag patterns.
Claim 12
Independent Claim
63 words
An apparatus for demultiplexing a stochastic time division multiplexed frame of data packets, comprising: detecting means for detecting a predetermined flag pattern within said frame of data packets; counting means for counting the number of flag patterns detected by said detecting means; and routing means, responsive to said counting means, for routing a data packet in accordance with said number of flag patterns.
Claim 13
Dependent Claim
30 words
The apparatus of claim 7, further comprising: framing means for detecting the first flag pattern in said frame; and means responsive to said detecting means for resetting said counting means.
Claim 14
Dependent Claim
40 words
The apparatus of claim 7, further comprising: masking means for inhibiting said detecting means during a portion of said data packets so that data packets may include said flag pattern within their data without causing said counting means to count.
Claim 15
Dependent Claim
35 words
The apparatus of claim 7, further including means for reading a word associated with said flag and for comparing said word with the number of flag patterns detected by said detecting means for verifying synchronization.
Claim 16
Dependent Claim
20 words
The apparatus of claim 7, wherein said frame is a fixed length so that a first flag pattern reoccurs periodically.
Claim 17
Dependent Claim
12 words
The apparatus of claim 7, wherein said frame has a variable length.
Claim 18
Dependent Claim
52 words
The apparatus of claim 7, further comprising: comparing means for comparing the number of said flag patterns detected by said detecting means with a count in said frame; and error detecting means for producing an error signal in response to said comparing means if said count and said number do not agree.
Claim 19
Dependent Claim
31 words
The apparatus of claim 11 wherein said frame includes an idle pattern at the end of said frame to fill in the frame until time for the next recurring flag pattern.
References Cited (Backward Citations)
GB997992A
Cited
US3124652A
Cited
US3466397A
Cited
US3686442A
Cited
US3749842A
Cited
US4096355A
Cited
US4334306A
Cited
US4236245A
Cited
US4445214A
Cited
US4417334A
Cited
US4477899A
Cited
US4507778A
Cited
US4490817A
Cited
US4542380A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-10-12 | 1991-04-13 | 1991-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-10-12 | 1995-04-13 | 1995-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-10-12 | 1999-04-13 | 1999-10-13 | $7700.00 | Window Closed / Lapsed |