← Back to Patent Explorer
US5583872A Expired / Lapsed US ⏱️ 0.0 years remaining

High speed data transfer over twisted pair cabling

Assignee: Hewlett Packard Development Co LP
•
Filing: 1995-02-10
•
Granted: 1996-12-10
•
Expires: 2015-02-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method provides for a first network node in a plurality of network nodes to transmit a data packet to a hub. The hub and the network nodes are interconnected within a local network system. Control signals are exchanged between the first network node and the hub. The exchange of control signals is done in a first signal frequency range. A data packet is sent from the first network node to the hub. The data packet is sent using data signals within a second signal frequency range. The first signal frequency range and the second signal frequency range do not overlap.

Inventors

  • 👤 Alan Albrecht
  • 👤 Steven H. Goody
  • 👤 Michael P. Spratt
  • 👤 Joseph A. Curcio, Jr.
  • 👤 Daniel J. Dove

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 07:09
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/44; H04L25/00; H04L25/02; H04L25/14; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; H04L5/00; H04L5/14; H04L5/143; H04L12/40; H04L12/407; H04L12/413

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 88 words
A method for transmitting first data across a network, the method comprising the steps of: (a) scrambling the first data to produce scrambled data; (b) serializing and block coding the scrambled data to produce a plurality of serial data stream, wherein the block coding is performed using a 5B/6B code; (c) transmitting the plurality of serial data streams across the network; (d) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (e) descrambling the scrambled data to recover the first data.
Claim 2
Independent Claim 88 words
A method for transmitting first data across a network, the method comprising the steps of: (a) scrambling the first data to produce scrambled data; (b) serializing and block coding the scrambled data to produce a plurality of serial data stream, wherein the block coding is performed using a 5B/6B code; (c) transmitting the plurality of serial data streams across the network; (d) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (e) descrambling the scrambled data to recover the first data.
Claim 3
Dependent Claim 15 words
A method as in claim 1 wherein step (c) is performed using binary NRZ modulation.
Claim 4
Dependent Claim 20 words
A method as in claim 1 wherein in step (a) the scrambling is based on the following polynomial factors: S[n]=1+S[n-9]+S[n-11].
Claim 5
Dependent Claim 44 words
A method as in claim 1 additionally comprising the following step performed before step (a): (f) dividing the first data into a plurality of data streams, wherein step (a) is performed on the plurality of data streams into which the first data is divided.
Claim 6
Dependent Claim 50 words
A method as in claim 1 wherein step (a) includes independently scrambling each of the plurality of data streams to produce a plurality of scrambled data streams, and step (b) includes independently serializing and block coding the plurality of scrambled data streams to produce the plurality of serial data streams.
Claim 7
Dependent Claim 22 words
A method as in claim 5 wherein in step (b) the plurality of data streams are each block coded before being serialized.
Claim 8
Dependent Claim 19 words
A method as in claim 5 wherein in step (b) the scrambled data is block coded before being serialized.
Claim 9
Independent Claim 170 words
A method for transmitting first data across a network, the method comprising the steps of: (a) dividing the first data into a plurality of data streams; (b) scrambling the first data to produce scrambled data, wherein step (b) is performed on the plurality of data streams into which the first data is divided, and wherein step (b) includes independently scrambling each of the plurality of data streams to produce a plurality of scrambled data streams; (c) serializing and block coding the scrambled data to produce a plurality of serial data streams, wherein step (c) includes independently serializing and block coding the plurality of scrambled data streams to produce the plurality of serial data streams, and wherein in step (c) the plurality of scrambled data streams are each block coded before being serialized; (d) transmitting the plurality of serial data streams across the network; (e) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (f) descrambling the scrambled data to recover the first data.
Claim 10
Independent Claim 170 words
A method for transmitting first data across a network, the method comprising the steps of: (a) dividing the first data into a plurality of data streams; (b) scrambling the first data to produce scrambled data, wherein step (b) is performed on the plurality of data streams into which the first data is divided, and wherein step (b) includes independently scrambling each of the plurality of data streams to produce a plurality of scrambled data streams; (c) serializing and block coding the scrambled data to produce a plurality of serial data streams, wherein step (c) includes independently serializing and block coding the plurality of scrambled data streams to produce the plurality of serial data streams, and wherein in step (c) the plurality of scrambled data streams are each block coded before being serialized; (d) transmitting the plurality of serial data streams across the network; (e) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (f) descrambling the scrambled data to recover the first data.
Claim 11
Dependent Claim 21 words
A method as in claim 8 wherein in step (b) the scrambling is based on the following polynomial factors: S[n]=1+S[n-9]+S[n-11]. 10.
Claim 12
Dependent Claim 15 words
A method as in claim 8 wherein step (d) is performed using binary NRZ modulation.
Claim 13
Dependent Claim 19 words
A method as in claim 8 wherein in step (c) the block coding is performed using a 5B/6B code.
Claim 14
Independent Claim 166 words
A method for transmitting first data across a network, the method comprising the steps of: (a) dividing the first data into a plurality of data streams; (b) scrambling the first data to produce scrambled data, wherein step (b) is performed on the plurality of data streams into which the first data is divided and wherein step (b) includes independently scrambling each of the plurality of data streams to produce a plurality of scrambled data streams; (c) serializing and block coding the scrambled data to produce a plurality of serial data streams, wherein step (c) includes independently serializing and block coding the plurality of scrambled data streams to produce the plurality of serial data streams, and wherein in step (c) the scrambled data is block coded before being serialized; (d) transmitting the plurality of serial data streams across the network; (e) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (f) descrambling the scrambled data to recover the first data.
Claim 15
Independent Claim 166 words
A method for transmitting first data across a network, the method comprising the steps of: (a) dividing the first data into a plurality of data streams; (b) scrambling the first data to produce scrambled data, wherein step (b) is performed on the plurality of data streams into which the first data is divided and wherein step (b) includes independently scrambling each of the plurality of data streams to produce a plurality of scrambled data streams; (c) serializing and block coding the scrambled data to produce a plurality of serial data streams, wherein step (c) includes independently serializing and block coding the plurality of scrambled data streams to produce the plurality of serial data streams, and wherein in step (c) the scrambled data is block coded before being serialized; (d) transmitting the plurality of serial data streams across the network; (e) deserializing and block decoding the plurality of serial data streams to recover the scrambled data; and, (f) descrambling the scrambled data to recover the first data.
Claim 16
Dependent Claim 20 words
A method as in claim 12 wherein in step (b) the scrambling is based on the following polynomial factors: S[n]=1+S[n-9]+S[n-11].
Claim 17
Dependent Claim 15 words
A method as in claim 12 wherein step (d) is performed using binary NRZ modulation.
Claim 18
Dependent Claim 19 words
A method as in claim 12 wherein in step (c) the block coding is performed using a 5B/6B code.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-12-10 2000-06-10 2000-12-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-12-10 2004-06-10 2004-12-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-12-10 2008-06-10 2008-12-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag