Patent US5577069A successfully refreshed from Google Patents.
US5577069A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Signalling method and structure suitable for out-of-band information transfer in communication network
Assignee: National Semiconductor Corp
•
Filing: 1994-12-09
•
Granted: 1996-11-19
•
Expires: 2014-12-09
Abstract
Abstract A high-speed out-of-band signalling technique for transferring information such as station status information between stations in a communication network, typically a local-area network, involves sequentially generating a plurality of n-bit sequence segments, where n is at least 3. Each bit is either a first binary value or a second binary value. Each sequence segment is coded with one of a plurality of different n-bit code groups divided into a first code group and a set of second code groups. The n bits in the first code group are all the first binary value--e.g., all "1s". None of the second code groups contain a pair of non-contiguous bits of the second binary value--e.g., none of the second code groups contains two "0s" separated by at least one other bit. The sequence segments are outputted in the order that they were generated to produce a special bit sequence which carries the desired information. The station status information typically includes configuration capability, flow control parameters, and integrity control parameters.
Inventors
- 👤 Hung-Wah A. Lau
- 👤 Ching Huang
- 👤 Ramin Shirani
- 👤 Michael J. Woodring
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 10:06
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/44; G; G01; G01G; G01G3/00; G01G3/12; G01G3/14; G01G3/1402; G01G3/16; G01G3/165; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; H04L2012/445
Claims Analysis
Total Claims: 47
Claim 1
Independent Claim
123 words
A signalling method comprising the steps of: sequentially generating n-bit sequence segments where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups allocated into a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and outputting the sequence segments according to the order in which they are generated to produce a special bit sequence.
Claim 2
Dependent Claim
123 words
A signalling method comprising the steps of: sequentially generating n-bit sequence segments where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups allocated into a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and outputting the sequence segments according to the order in which they are generated to produce a special bit sequence.
Claim 3
Dependent Claim
33 words
A method as in claim 1 wherein no pair of non-contiguous bits of the second binary value occur in any m consecutive bits in the special bit sequence, m being at least n+1.
Claim 4
Dependent Claim
10 words
A method as in claim 2 wherein m equals 2n.
Claim 5
Dependent Claim
37 words
A method as in claim 2 wherein at least two sequence segments coded with the first code group are inserted between each pair of sequence segments coded with the second code groups in the special bit sequence.
Claim 6
Dependent Claim
55 words
A method as in claim 1 wherein: the special bit sequence contains a plurality of separate portions, each being at least two of the second code groups in length; and a specified one of the second code groups occurs at the beginning of all the separate portions to indicate the start of each separate portion.
Claim 7
Dependent Claim
38 words
A method as in claim 5 wherein two sequence segments coded with the first code group are between each pair of sequence segments coded with the second code groups in each separate portion of the special bit sequence.
Claim 8
Dependent Claim
63 words
A method as in claim 4 wherein: the special bit sequence contains a plurality of separate portions, each being at least two of the second code groups in length; and a selected plurality of more than two of the first code groups is inserted between each pair of consecutive separate portions to indicate the start of each separate portion after the first one.
Claim 9
Dependent Claim
38 words
A method as in claim 7 wherein two sequence segments coded with the first code group are between each pair of sequence segments coded with the second code groups in each separate portion of the special bit sequence.
Claim 10
Dependent Claim
29 words
A method as in claim 1 wherein a first communication station transmits a bit stream representing the special bit sequence to a second communication station during an out-of-band period.
Claim 11
Dependent Claim
18 words
A method as in claim 9 wherein the second code groups convey information particular to the first station.
Claim 12
Dependent Claim
14 words
A method as in claim 10 wherein the conveyed information comprises station configuration information.
Claim 13
Dependent Claim
14 words
A method as in claim 11 wherein the conveyed information includes data flow information.
Claim 14
Dependent Claim
40 words
A method as in claim 9 wherein the special bit sequence includes loopback information that attempts to cause the second station to transmit back to the first station information that the first station has previously transmitted to the second station.
Claim 15
Dependent Claim
10 words
A method as in claim 9 wherein n is 5.
Claim 16
Dependent Claim
21 words
A method as in claim 9 wherein the first station is capable of transmitting information in accordance with the 100Base-X protocol.
Claim 17
Dependent Claim
48 words
A method as in claim 15 wherein: the first code group is the 5-bit code group I of the 100Base-X protocol; and the second code groups include at least part of the 5-bit code groups 0, 7, 9, B, D, E, F, and R of the 100Base-X protocol.
Claim 18
Dependent Claim
17 words
A method as in claim 16 wherein the second code groups include the 5-bit code group (11001).
Claim 19
Dependent Claim
24 words
A method as in claim 15 wherein the number of second code groups is eight, each second code group representing a different three-bit code.
Claim 20
Dependent Claim
20 words
A method as in claim 15 wherein at least twelve of the first code group precede the special bit sequence.
Claim 21
Dependent Claim
63 words
A method as in claim 15 wherein the second station, upon receiving information transmitted from the first station in accordance with the 100Base-X protocol, is capable of processing the received information in accordance with the 100Base-X protocol, the reception in the second station of the bit stream representing the special bit sequence not causing carrier sense to be asserted in the second station.
Claim 22
Dependent Claim
65 words
A method as in claim 9 further including the step of producing an additional special bit sequence having characteristics of the same type as the first-mentioned special bit sequence except that the organization of the second code groups in the additional sequence may differ from that in the first-mentioned sequence, the second station transmitting a bit stream representing the additional sequence to the first station.
Claim 23
Dependent Claim
89 words
A method as in claim 1 wherein: a plurality of data-transferring communication stations are interconnected with a communication-management station in a communication network, each of the data-transferring stations being capable of transmitting data to at least one other data-transferring station in the network; and communication-management station transmits a bit stream representing the special bit sequence to each of the data-transferring communication stations to establish communication priorities for transferring data among the data-transferring stations, the special bit sequence varying in content for each data-transferring station depending on its communication priority.
Claim 24
Dependent Claim
130 words
A signalling method comprising the step of producing a special bit sequence containing a plurality of 5-bit segments that occur timewise one after another, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different 5-bit code groups comprising a first code group and a set of second code groups, the five bits in the first code group all being the first binary value, no pair of non-contiguous bits of the second binary value occurring in any of the second code groups, and no pair of non-contiguous bits of the second binary value occurring in any ten consecutive bits in the special bit sequence.
Claim 25
Dependent Claim
130 words
A signalling method comprising the step of producing a special bit sequence containing a plurality of 5-bit segments that occur timewise one after another, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different 5-bit code groups comprising a first code group and a set of second code groups, the five bits in the first code group all being the first binary value, no pair of non-contiguous bits of the second binary value occurring in any of the second code groups, and no pair of non-contiguous bits of the second binary value occurring in any ten consecutive bits in the special bit sequence.
Claim 26
Dependent Claim
48 words
A method as in claim 23 wherein: the first code group is the 5-bit code group I of the 100Base-X protocol; and the second code groups include at least part of the 5-bit code groups 0, 7, 9, B, D, E, F, and R of the 100Base-X protocol.
Claim 27
Dependent Claim
142 words
Electronic communication apparatus comprising: state circuitry which produces a special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups allocated into a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and output circuitry which modifies the special bit sequence for cable transmission and then furnishes the so modified special bit sequence to an external cable.
Claim 28
Dependent Claim
142 words
Electronic communication apparatus comprising: state circuitry which produces a special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups allocated into a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and output circuitry which modifies the special bit sequence for cable transmission and then furnishes the so modified special bit sequence to an external cable.
Claim 29
Dependent Claim
32 words
Apparatus as in claim 25 wherein no pair of non-contiguous bits of the second binary value occurs in any m consecutive bits in the special bit sequence, m being at least n+1.
Claim 30
Dependent Claim
9 words
Apparatus as in claim 26 wherein m equals 2n.
Claim 31
Dependent Claim
30 words
Apparatus as in claim 26 wherein at least two sequence segments coded with the first code group are between each pair of sequence segments coded with the second code groups.
Claim 32
Dependent Claim
50 words
Apparatus as in claim 25 wherein: n is 5; the first code group is the 5-bit code group I of the 100Base-X protocol; and the second code groups include at least part of the 5-bit code groups 0, 7, 9, B, D, E, F, and R of the 100Base-X protocol.
Claim 33
Dependent Claim
16 words
Apparatus as in claim 29 wherein the second code groups include the 5-bit code group (11001).
Claim 34
Dependent Claim
20 words
Apparatus as in claim 29 wherein the number of second code groups is eight, each representing a different three-bit code.
Claim 35
Dependent Claim
19 words
Apparatus as in claim 29 wherein at least twelve of the first code group precede the special bit sequence.
Claim 36
Dependent Claim
23 words
Apparatus as in claim 25 wherein the apparatus transmits data during in-band periods and repetitively transmits the special bit sequence during out-of-band periods.
Claim 37
Dependent Claim
16 words
Apparatus as in claim 33 wherein the second code groups convey information particular to the apparatus.
Claim 38
Dependent Claim
160 words
A communication network comprising: a transmission cable; a first communication station that transmits a bit stream representing a special bit sequence over the cable during an out-of-band period when data is not being transferred, the special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups comprising a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and a second communication station to which the cable supplies the bit stream representing the special bit sequence.
Claim 39
Dependent Claim
160 words
A communication network comprising: a transmission cable; a first communication station that transmits a bit stream representing a special bit sequence over the cable during an out-of-band period when data is not being transferred, the special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups comprising a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups; and a second communication station to which the cable supplies the bit stream representing the special bit sequence.
Claim 40
Dependent Claim
33 words
A network as in claim 35 wherein no pair of non-contiguous bits of the second binary value occur in any m consecutive bits in the special bit sequence, m being at least n+1.
Claim 41
Dependent Claim
67 words
A network as in claim 35 wherein the second station transmits an additional special bit sequence to the first station during an out-of-band period, the additional special bit sequence having substantially the same characteristics as the first-mentioned special bit sequence except that the arrangement of the first and second code groups in the additional special bit sequence may differ from that in the first-mentioned special bit sequence.
Claim 42
Dependent Claim
48 words
A network as in claim 37 wherein: the first code group is the 5-bit code group I of the 100Base-X protocol; and the second code groups include at least part of the 5-bit code groups 0, 7, 9, B, D, E, F, and R of the 100Base-X protocol.
Claim 43
Dependent Claim
183 words
A communication network comprising: a plurality of data-transferring communication stations, each capable of transmitting data to at least one other data-transferring communication station in the network; and a communication-management station that provides a bit stream representing a special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups comprising a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups, the bit stream being supplied to each of the data-transferring communication stations to establish communication priorities for transferring data among the data-transferring stations, the special bit sequence varying in content for each data-transferring station depending on its communication priority.
Claim 44
Dependent Claim
183 words
A communication network comprising: a plurality of data-transferring communication stations, each capable of transmitting data to at least one other data-transferring communication station in the network; and a communication-management station that provides a bit stream representing a special bit sequence containing a plurality of n-bit sequence segments that occur timewise one after another where n is at least 3, each bit in each sequence segment selectively being a first binary value or a second binary value opposite to the first binary value, each sequence segment being coded with a selected one of a plurality of different n-bit code groups comprising a first code group and a set of second code groups, the n bits in the first code group all being the first binary value, and no pair of non-contiguous bits of the second binary value occurring in any of the second code groups, the bit stream being supplied to each of the data-transferring communication stations to establish communication priorities for transferring data among the data-transferring stations, the special bit sequence varying in content for each data-transferring station depending on its communication priority.
Claim 45
Dependent Claim
33 words
A network as in claim 39 wherein no pair of non-contiguous bits of the second binary value occur in any m consecutive bits in the special bit sequence, m being at least n+1.
Claim 46
Dependent Claim
34 words
A network as in claim 39 wherein the communication priorities comprise establishing minimum widths for out-of-band periods between periods during which one of the data-transferring stations transmits data to another of the data-transferring stations.
Claim 47
Dependent Claim
48 words
A network as in claim 39 wherein: the first code group is the 5-bit code group I of the 100Base-X protocol; and the second code groups include at least part of the 5-bit code groups 0, 7, 9, B, D, E, F, and R of the 100Base-X protocol.
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) | 1999-11-19 | 2000-05-20 | 2000-11-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-11-19 | 2004-05-20 | 2004-11-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-11-19 | 2008-05-20 | 2008-11-19 | $7700.00 | Window Closed / Lapsed |