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

Collision detection method using CRC code

Assignee: Intel Corp
•
Filing: 1983-01-24
•
Granted: 1986-02-25
•
Expires: 2003-01-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for detecting collisions between digital messages transmitted on a common cable communication system is disclosed. A transmitting station computes a cylic redundancy checking (CRC) code for the transmitted message, and stores the value of the code after N bits have been sent. N bits corresponds to the number of bits transmitted during the "collision window" of the particular system. The transmitting station monitors the receive channel and computes a CRC value for N bits of the received message. If the CRC value calculated for the received message does not match the stored CRC value for the transmitted message, a collision is assumed. If no message is received by the transmitting station after the collision window has elapsed, a collision is also assumed.

Inventors

  • 👤 Robert Galin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 05:51
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/407; H04L12/413

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 137 words
In a data communication system having first and second stations coupled to a common line, an improved method utilized by said first station for determining if a message transmitted by said first station has collided with a message transmitted by said second station, comprising the steps of: calculating the value of a predetermined code for N bits of said transmitted message; said predetermined code containing the same number of bits for all values of N; storing the value of said code after N bits; receiving said message on said line and computing said predetermined code for N bits of said received message; comparing the value of said stored code value with the value of said computed code value for said received message; whereby a collision is detected if said stored and computed code values do not match.
Claim 2
Dependent Claim 137 words
In a data communication system having first and second stations coupled to a common line, an improved method utilized by said first station for determining if a message transmitted by said first station has collided with a message transmitted by said second station, comprising the steps of: calculating the value of a predetermined code for N bits of said transmitted message; said predetermined code containing the same number of bits for all values of N; storing the value of said code after N bits; receiving said message on said line and computing said predetermined code for N bits of said received message; comparing the value of said stored code value with the value of said computed code value for said received message; whereby a collision is detected if said stored and computed code values do not match.
Claim 3
Dependent Claim 44 words
The method as defined by claim 1 wherein a collision is assumed if said first station does not receive said transmitted message after a period 2T, where T is the maximum propagation time delay for a message transmitted on said line to be received.
Claim 4
Dependent Claim 18 words
The method as defined by claim 2 wherein said predetermined code is a cyclic redundancy checking (CRC) code.
Claim 5
Dependent Claim 43 words
The method as defined by claim 3 wherein said message includes a first flag signal on said line indicating that said message is about to be transmitted, said CRC being calculated beginning with the first bit following the transmission of said flag signal.
Claim 6
Dependent Claim 26 words
The method as defined by claim 4 wherein said CRC for said received message is calculated for N bits after receipt of said first flag signal.
Claim 7
Dependent Claim 43 words
The method as defined by claim 5 wherein said common line comprises a transmit channel and a receive channel, each of said stations being coupled to said channels such that said stations transmit on said transmit channel and receive on said receive channel.
Claim 8
Dependent Claim 32 words
The method as defined by claim 5 wherein the number (N) of said bits to be used to calculate said CRC values corresponds to the number of bits transmitted during time 2T.
Claim 9
Dependent Claim 23 words
The method as defined by claim 7 wherein said message includes a second flag signal indicating that said message has been fully transmitted.
Claim 10
Dependent Claim 206 words
In a data communications system having first and second stations coupled to transmit and receive channels, said channels being coupled by a head end means, an improved method utilized by said first station for determining if a message transmitted by said first station has collided with a message transmitted by said second station, comprising the steps of: transmitting a message from said first station to said second station; calculating the value of a cyclic redundance checking (CRC) code for N bits of said message where N corresponds to 2DT and where, D=the transmission rate of said first station; and T=the maximum propagation delay time of said system for a message transmitted on said transmit line to be received on said receive channel after passing through said head end means; storing the value of said CRC code after N bits; receiving said message on said receive channel and computing a CRC value for N bits of said received message; comparing the value of said stored CRC with the value of said CRC computed for said received message; halting transmission of said message if said stored and computed CRC values do not match; whereby a collision is detected if said stored and computed CRC values do not match.
Claim 11
Dependent Claim 206 words
In a data communications system having first and second stations coupled to transmit and receive channels, said channels being coupled by a head end means, an improved method utilized by said first station for determining if a message transmitted by said first station has collided with a message transmitted by said second station, comprising the steps of: transmitting a message from said first station to said second station; calculating the value of a cyclic redundance checking (CRC) code for N bits of said message where N corresponds to 2DT and where, D=the transmission rate of said first station; and T=the maximum propagation delay time of said system for a message transmitted on said transmit line to be received on said receive channel after passing through said head end means; storing the value of said CRC code after N bits; receiving said message on said receive channel and computing a CRC value for N bits of said received message; comparing the value of said stored CRC with the value of said CRC computed for said received message; halting transmission of said message if said stored and computed CRC values do not match; whereby a collision is detected if said stored and computed CRC values do not match.
Claim 12
Dependent Claim 28 words
The method as defined by claim 9 wherein a collision is assumed if said first station does not receive said transmitted message after a period 2T has elapsed.
Claim 13
Dependent Claim 20 words
The method as defined by claim 10 wherein said first station senses said receive channel for a period of 2T.
Claim 14
Dependent Claim 38 words
The method as defined by claim 11 wherein said message includes a first flag signal prior to the transmission of said message, said CRC being calculated beginning with the first bit following the transmission of said flag signal.
Claim 15
Dependent Claim 26 words
The method as defined by claim 12 wherein said CRC for said received message is calculated for N bits after receipt of said first flag signal.
Claim 16
Dependent Claim 25 words
The method as defined by claim 13 wherein said first station retransmits said message in accordance with a predetermined scheme if a collision is detected.
Claim 17
Dependent Claim 23 words
The method as defined by claim 14 wherein said message includes a second flag signal indicating that said message has been fully transmitted.

References Cited (Backward Citations)

US4354252A Cited
US4210780A Cited
US4281380A Cited
US4271523A Cited
US4292623A Cited
US4332027A Cited
US4412326A Cited
US4500989A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-02-24 1989-08-26 1990-02-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-02-24 1993-08-26 1994-02-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-02-24 1997-08-26 1998-02-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag